/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 22:06:01,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 22:06:01,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 22:06:01,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 22:06:01,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 22:06:01,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 22:06:01,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 22:06:01,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 22:06:01,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 22:06:01,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 22:06:01,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 22:06:01,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 22:06:01,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 22:06:01,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 22:06:01,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 22:06:01,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 22:06:01,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 22:06:01,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 22:06:01,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 22:06:01,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 22:06:01,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 22:06:01,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 22:06:01,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 22:06:01,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 22:06:01,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 22:06:01,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 22:06:01,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 22:06:01,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 22:06:01,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 22:06:01,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 22:06:01,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 22:06:01,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 22:06:01,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 22:06:01,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 22:06:01,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 22:06:01,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 22:06:01,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 22:06:01,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 22:06:01,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 22:06:01,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 22:06:01,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 22:06:01,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 22:06:01,150 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 22:06:01,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 22:06:01,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 22:06:01,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 22:06:01,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 22:06:01,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 22:06:01,153 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 22:06:01,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 22:06:01,153 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 22:06:01,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 22:06:01,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 22:06:01,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 22:06:01,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 22:06:01,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 22:06:01,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 22:06:01,155 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 [2021-06-05 22:06:01,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 22:06:01,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 22:06:01,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 22:06:01,422 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 22:06:01,423 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 22:06:01,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl [2021-06-05 22:06:01,424 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl' [2021-06-05 22:06:01,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 22:06:01,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 22:06:01,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 22:06:01,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 22:06:01,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 22:06:01,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 22:06:01,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 22:06:01,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 22:06:01,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 22:06:01,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/1) ... [2021-06-05 22:06:01,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 22:06:01,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 22:06:01,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 22:06:01,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 22:06:01,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (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 [2021-06-05 22:06:01,592 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 22:06:01,592 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 22:06:01,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 22:06:01,593 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 22:06:01,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 22:06:01,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 22:06:01,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 22:06:01,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 22:06:01,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 22:06:01,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 22:06:01,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 22:06:01,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 22:06:01,596 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 22:06:02,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 22:06:02,336 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-05 22:06:02,337 INFO L202 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:06:02 BoogieIcfgContainer [2021-06-05 22:06:02,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 22:06:02,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 22:06:02,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 22:06:02,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 22:06:02,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:06:01" (1/2) ... [2021-06-05 22:06:02,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d70de4 and model type poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:06:02, skipping insertion in model container [2021-06-05 22:06:02,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:06:02" (2/2) ... [2021-06-05 22:06:02,346 INFO L111 eAbstractionObserver]: Analyzing ICFG poker-hand-subst.wvr.bpl [2021-06-05 22:06:02,349 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 22:06:02,350 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 22:06:02,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 22:06:02,351 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 22:06:02,392 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 22:06:02,408 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 22:06:02,428 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 22:06:02,428 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 22:06:02,428 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 22:06:02,428 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 22:06:02,428 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 22:06:02,428 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 22:06:02,428 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 22:06:02,428 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 22:06:02,434 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 37 transitions, 98 flow [2021-06-05 22:06:02,457 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:06:02,470 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:02,471 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:02,471 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2024028845, now seen corresponding path program 1 times [2021-06-05 22:06:02,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:02,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757555512] [2021-06-05 22:06:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:03,063 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-06-05 22:06:03,372 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2021-06-05 22:06:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:03,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:03,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757555512] [2021-06-05 22:06:03,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757555512] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:03,423 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:03,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:03,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325320273] [2021-06-05 22:06:03,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:03,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:03,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:03,435 INFO L87 Difference]: Start difference. First operand has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:03,675 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-06-05 22:06:03,957 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 22:06:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:04,032 INFO L93 Difference]: Finished difference Result 474 states and 1876 transitions. [2021-06-05 22:06:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:06:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:04,044 INFO L225 Difference]: With dead ends: 474 [2021-06-05 22:06:04,045 INFO L226 Difference]: Without dead ends: 459 [2021-06-05 22:06:04,046 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 868.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-05 22:06:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 223. [2021-06-05 22:06:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 4.324324324324325) internal successors, (960), 222 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 960 transitions. [2021-06-05 22:06:04,117 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 960 transitions. Word has length 14 [2021-06-05 22:06:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:04,118 INFO L482 AbstractCegarLoop]: Abstraction has 223 states and 960 transitions. [2021-06-05 22:06:04,118 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 960 transitions. [2021-06-05 22:06:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:06:04,120 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:04,120 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:04,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 22:06:04,120 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1233644461, now seen corresponding path program 2 times [2021-06-05 22:06:04,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:04,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298987019] [2021-06-05 22:06:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:04,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:04,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298987019] [2021-06-05 22:06:04,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298987019] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:04,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:04,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:04,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469654665] [2021-06-05 22:06:04,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:04,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:04,427 INFO L87 Difference]: Start difference. First operand 223 states and 960 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:04,866 INFO L93 Difference]: Finished difference Result 685 states and 2857 transitions. [2021-06-05 22:06:04,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:04,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:06:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:04,871 INFO L225 Difference]: With dead ends: 685 [2021-06-05 22:06:04,871 INFO L226 Difference]: Without dead ends: 670 [2021-06-05 22:06:04,872 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 420.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:06:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-06-05 22:06:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 227. [2021-06-05 22:06:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 4.300884955752212) internal successors, (972), 226 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 972 transitions. [2021-06-05 22:06:04,884 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 972 transitions. Word has length 14 [2021-06-05 22:06:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:04,884 INFO L482 AbstractCegarLoop]: Abstraction has 227 states and 972 transitions. [2021-06-05 22:06:04,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 972 transitions. [2021-06-05 22:06:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:06:04,886 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:04,886 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:04,886 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 22:06:04,886 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1840634711, now seen corresponding path program 3 times [2021-06-05 22:06:04,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:04,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751229468] [2021-06-05 22:06:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:05,195 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2021-06-05 22:06:05,659 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2021-06-05 22:06:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:05,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:05,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751229468] [2021-06-05 22:06:05,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751229468] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:05,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:05,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:05,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447124021] [2021-06-05 22:06:05,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:05,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:05,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:05,767 INFO L87 Difference]: Start difference. First operand 227 states and 972 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:06,182 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2021-06-05 22:06:06,500 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2021-06-05 22:06:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:06,618 INFO L93 Difference]: Finished difference Result 506 states and 2014 transitions. [2021-06-05 22:06:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:06:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:06,621 INFO L225 Difference]: With dead ends: 506 [2021-06-05 22:06:06,622 INFO L226 Difference]: Without dead ends: 491 [2021-06-05 22:06:06,622 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1244.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-06-05 22:06:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 234. [2021-06-05 22:06:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 4.309012875536481) internal successors, (1004), 233 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1004 transitions. [2021-06-05 22:06:06,631 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1004 transitions. Word has length 14 [2021-06-05 22:06:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:06,631 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 1004 transitions. [2021-06-05 22:06:06,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1004 transitions. [2021-06-05 22:06:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:06:06,632 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:06,632 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:06,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 22:06:06,632 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -867555397, now seen corresponding path program 4 times [2021-06-05 22:06:06,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:06,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979915250] [2021-06-05 22:06:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:07,126 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2021-06-05 22:06:07,628 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2021-06-05 22:06:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:07,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:07,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979915250] [2021-06-05 22:06:07,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979915250] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:07,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:07,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:07,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792496437] [2021-06-05 22:06:07,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:07,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:07,715 INFO L87 Difference]: Start difference. First operand 234 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:08,117 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 129 [2021-06-05 22:06:08,451 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 117 [2021-06-05 22:06:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:08,551 INFO L93 Difference]: Finished difference Result 526 states and 2085 transitions. [2021-06-05 22:06:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:06:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:08,554 INFO L225 Difference]: With dead ends: 526 [2021-06-05 22:06:08,554 INFO L226 Difference]: Without dead ends: 511 [2021-06-05 22:06:08,555 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1461.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-06-05 22:06:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 240. [2021-06-05 22:06:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 4.2803347280334725) internal successors, (1023), 239 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1023 transitions. [2021-06-05 22:06:08,564 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1023 transitions. Word has length 14 [2021-06-05 22:06:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:08,565 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 1023 transitions. [2021-06-05 22:06:08,565 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1023 transitions. [2021-06-05 22:06:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:06:08,566 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:08,566 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:08,566 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 22:06:08,566 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash 922889575, now seen corresponding path program 5 times [2021-06-05 22:06:08,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:08,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110130957] [2021-06-05 22:06:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:08,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:08,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110130957] [2021-06-05 22:06:08,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110130957] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:08,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:08,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:08,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137634540] [2021-06-05 22:06:08,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:08,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:08,826 INFO L87 Difference]: Start difference. First operand 240 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:09,200 INFO L93 Difference]: Finished difference Result 697 states and 2896 transitions. [2021-06-05 22:06:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:06:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:09,204 INFO L225 Difference]: With dead ends: 697 [2021-06-05 22:06:09,204 INFO L226 Difference]: Without dead ends: 682 [2021-06-05 22:06:09,205 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 328.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:06:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-06-05 22:06:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 242. [2021-06-05 22:06:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 4.2987551867219915) internal successors, (1036), 241 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1036 transitions. [2021-06-05 22:06:09,215 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1036 transitions. Word has length 14 [2021-06-05 22:06:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:09,215 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 1036 transitions. [2021-06-05 22:06:09,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1036 transitions. [2021-06-05 22:06:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:06:09,216 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:09,217 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:09,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 22:06:09,217 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 594755113, now seen corresponding path program 6 times [2021-06-05 22:06:09,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:09,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836917843] [2021-06-05 22:06:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:09,469 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2021-06-05 22:06:09,727 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2021-06-05 22:06:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:09,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:09,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836917843] [2021-06-05 22:06:09,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836917843] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:09,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:09,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:09,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761830] [2021-06-05 22:06:09,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:09,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:09,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:09,779 INFO L87 Difference]: Start difference. First operand 242 states and 1036 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:09,959 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-06-05 22:06:10,139 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-06-05 22:06:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,202 INFO L93 Difference]: Finished difference Result 505 states and 1974 transitions. [2021-06-05 22:06:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:10,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:06:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,208 INFO L225 Difference]: With dead ends: 505 [2021-06-05 22:06:10,208 INFO L226 Difference]: Without dead ends: 490 [2021-06-05 22:06:10,209 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 730.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-06-05 22:06:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 263. [2021-06-05 22:06:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 4.198473282442748) internal successors, (1100), 262 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1100 transitions. [2021-06-05 22:06:10,216 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1100 transitions. Word has length 14 [2021-06-05 22:06:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,217 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 1100 transitions. [2021-06-05 22:06:10,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1100 transitions. [2021-06-05 22:06:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:06:10,217 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,217 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 22:06:10,218 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1857764697, now seen corresponding path program 1 times [2021-06-05 22:06:10,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422249321] [2021-06-05 22:06:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:10,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422249321] [2021-06-05 22:06:10,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422249321] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 22:06:10,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510716835] [2021-06-05 22:06:10,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 22:06:10,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 22:06:10,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,230 INFO L87 Difference]: Start difference. First operand 263 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,234 INFO L93 Difference]: Finished difference Result 303 states and 1256 transitions. [2021-06-05 22:06:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:06:10,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:06:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,236 INFO L225 Difference]: With dead ends: 303 [2021-06-05 22:06:10,236 INFO L226 Difference]: Without dead ends: 303 [2021-06-05 22:06:10,236 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-05 22:06:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2021-06-05 22:06:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 4.158940397350993) internal successors, (1256), 302 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 1256 transitions. [2021-06-05 22:06:10,243 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 1256 transitions. Word has length 15 [2021-06-05 22:06:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,243 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 1256 transitions. [2021-06-05 22:06:10,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 1256 transitions. [2021-06-05 22:06:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:06:10,244 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,244 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 22:06:10,244 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1693444409, now seen corresponding path program 1 times [2021-06-05 22:06:10,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376844193] [2021-06-05 22:06:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:10,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376844193] [2021-06-05 22:06:10,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376844193] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 22:06:10,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688195274] [2021-06-05 22:06:10,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 22:06:10,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 22:06:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,254 INFO L87 Difference]: Start difference. First operand 303 states and 1256 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,259 INFO L93 Difference]: Finished difference Result 343 states and 1412 transitions. [2021-06-05 22:06:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:06:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:06:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,261 INFO L225 Difference]: With dead ends: 343 [2021-06-05 22:06:10,261 INFO L226 Difference]: Without dead ends: 343 [2021-06-05 22:06:10,262 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-06-05 22:06:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-06-05 22:06:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 4.128654970760234) internal successors, (1412), 342 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1412 transitions. [2021-06-05 22:06:10,269 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1412 transitions. Word has length 15 [2021-06-05 22:06:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,269 INFO L482 AbstractCegarLoop]: Abstraction has 343 states and 1412 transitions. [2021-06-05 22:06:10,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1412 transitions. [2021-06-05 22:06:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:06:10,270 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,270 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 22:06:10,270 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2109293491, now seen corresponding path program 1 times [2021-06-05 22:06:10,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103713313] [2021-06-05 22:06:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:10,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103713313] [2021-06-05 22:06:10,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103713313] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 22:06:10,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432081106] [2021-06-05 22:06:10,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 22:06:10,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 22:06:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,290 INFO L87 Difference]: Start difference. First operand 343 states and 1412 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,293 INFO L93 Difference]: Finished difference Result 386 states and 1566 transitions. [2021-06-05 22:06:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:06:10,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:06:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,296 INFO L225 Difference]: With dead ends: 386 [2021-06-05 22:06:10,298 INFO L226 Difference]: Without dead ends: 386 [2021-06-05 22:06:10,298 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-05 22:06:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-06-05 22:06:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 4.067532467532468) internal successors, (1566), 385 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1566 transitions. [2021-06-05 22:06:10,308 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1566 transitions. Word has length 15 [2021-06-05 22:06:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,308 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1566 transitions. [2021-06-05 22:06:10,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1566 transitions. [2021-06-05 22:06:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:06:10,309 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,309 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 22:06:10,309 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1748926659, now seen corresponding path program 1 times [2021-06-05 22:06:10,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391169051] [2021-06-05 22:06:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:10,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391169051] [2021-06-05 22:06:10,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391169051] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 22:06:10,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771177212] [2021-06-05 22:06:10,323 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 22:06:10,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 22:06:10,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,323 INFO L87 Difference]: Start difference. First operand 386 states and 1566 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,327 INFO L93 Difference]: Finished difference Result 439 states and 1766 transitions. [2021-06-05 22:06:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:06:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:06:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,330 INFO L225 Difference]: With dead ends: 439 [2021-06-05 22:06:10,330 INFO L226 Difference]: Without dead ends: 439 [2021-06-05 22:06:10,331 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-06-05 22:06:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-06-05 22:06:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 4.031963470319635) internal successors, (1766), 438 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1766 transitions. [2021-06-05 22:06:10,342 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1766 transitions. Word has length 15 [2021-06-05 22:06:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,342 INFO L482 AbstractCegarLoop]: Abstraction has 439 states and 1766 transitions. [2021-06-05 22:06:10,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1766 transitions. [2021-06-05 22:06:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:06:10,343 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,343 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,343 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 22:06:10,343 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 181705837, now seen corresponding path program 1 times [2021-06-05 22:06:10,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946204456] [2021-06-05 22:06:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:10,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946204456] [2021-06-05 22:06:10,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946204456] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 22:06:10,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428736020] [2021-06-05 22:06:10,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 22:06:10,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 22:06:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,358 INFO L87 Difference]: Start difference. First operand 439 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,363 INFO L93 Difference]: Finished difference Result 489 states and 1957 transitions. [2021-06-05 22:06:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:06:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:06:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,365 INFO L225 Difference]: With dead ends: 489 [2021-06-05 22:06:10,365 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 22:06:10,366 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 22:06:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2021-06-05 22:06:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 4.010245901639344) internal successors, (1957), 488 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1957 transitions. [2021-06-05 22:06:10,375 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1957 transitions. Word has length 15 [2021-06-05 22:06:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,377 INFO L482 AbstractCegarLoop]: Abstraction has 489 states and 1957 transitions. [2021-06-05 22:06:10,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1957 transitions. [2021-06-05 22:06:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:06:10,378 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,378 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 22:06:10,378 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash 542072669, now seen corresponding path program 1 times [2021-06-05 22:06:10,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852595148] [2021-06-05 22:06:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:10,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852595148] [2021-06-05 22:06:10,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852595148] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 22:06:10,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597298744] [2021-06-05 22:06:10,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 22:06:10,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 22:06:10,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,389 INFO L87 Difference]: Start difference. First operand 489 states and 1957 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,393 INFO L93 Difference]: Finished difference Result 549 states and 2181 transitions. [2021-06-05 22:06:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:06:10,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:06:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,396 INFO L225 Difference]: With dead ends: 549 [2021-06-05 22:06:10,396 INFO L226 Difference]: Without dead ends: 549 [2021-06-05 22:06:10,396 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 22:06:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-06-05 22:06:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2021-06-05 22:06:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 3.97992700729927) internal successors, (2181), 548 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 2181 transitions. [2021-06-05 22:06:10,407 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 2181 transitions. Word has length 15 [2021-06-05 22:06:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,408 INFO L482 AbstractCegarLoop]: Abstraction has 549 states and 2181 transitions. [2021-06-05 22:06:10,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 2181 transitions. [2021-06-05 22:06:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:10,410 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,410 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 22:06:10,410 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash 705140398, now seen corresponding path program 1 times [2021-06-05 22:06:10,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637081333] [2021-06-05 22:06:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:10,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637081333] [2021-06-05 22:06:10,426 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637081333] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:10,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358503166] [2021-06-05 22:06:10,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:10,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:10,427 INFO L87 Difference]: Start difference. First operand 549 states and 2181 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,455 INFO L93 Difference]: Finished difference Result 789 states and 2890 transitions. [2021-06-05 22:06:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:06:10,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,459 INFO L225 Difference]: With dead ends: 789 [2021-06-05 22:06:10,459 INFO L226 Difference]: Without dead ends: 689 [2021-06-05 22:06:10,459 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-06-05 22:06:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 565. [2021-06-05 22:06:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.891843971631206) internal successors, (2195), 564 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 2195 transitions. [2021-06-05 22:06:10,472 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 2195 transitions. Word has length 16 [2021-06-05 22:06:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,473 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 2195 transitions. [2021-06-05 22:06:10,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 2195 transitions. [2021-06-05 22:06:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:10,475 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,475 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 22:06:10,475 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1842088947, now seen corresponding path program 1 times [2021-06-05 22:06:10,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153640211] [2021-06-05 22:06:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:10,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153640211] [2021-06-05 22:06:10,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153640211] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:10,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251180698] [2021-06-05 22:06:10,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:10,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:10,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:10,615 INFO L87 Difference]: Start difference. First operand 565 states and 2195 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:10,829 INFO L93 Difference]: Finished difference Result 1056 states and 3563 transitions. [2021-06-05 22:06:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:10,833 INFO L225 Difference]: With dead ends: 1056 [2021-06-05 22:06:10,833 INFO L226 Difference]: Without dead ends: 903 [2021-06-05 22:06:10,833 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 189.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-06-05 22:06:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 566. [2021-06-05 22:06:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 3.720353982300885) internal successors, (2102), 565 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 2102 transitions. [2021-06-05 22:06:10,846 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 2102 transitions. Word has length 16 [2021-06-05 22:06:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:10,846 INFO L482 AbstractCegarLoop]: Abstraction has 566 states and 2102 transitions. [2021-06-05 22:06:10,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 2102 transitions. [2021-06-05 22:06:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:10,847 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:10,847 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:10,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 22:06:10,847 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash -881757258, now seen corresponding path program 1 times [2021-06-05 22:06:10,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:10,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719592429] [2021-06-05 22:06:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:10,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:10,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719592429] [2021-06-05 22:06:10,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719592429] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:10,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:10,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:10,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087163622] [2021-06-05 22:06:10,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:10,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:10,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:10,917 INFO L87 Difference]: Start difference. First operand 566 states and 2102 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:11,002 INFO L93 Difference]: Finished difference Result 856 states and 2892 transitions. [2021-06-05 22:06:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:11,005 INFO L225 Difference]: With dead ends: 856 [2021-06-05 22:06:11,005 INFO L226 Difference]: Without dead ends: 814 [2021-06-05 22:06:11,006 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-06-05 22:06:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 540. [2021-06-05 22:06:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 3.640074211502783) internal successors, (1962), 539 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1962 transitions. [2021-06-05 22:06:11,016 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1962 transitions. Word has length 16 [2021-06-05 22:06:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:11,016 INFO L482 AbstractCegarLoop]: Abstraction has 540 states and 1962 transitions. [2021-06-05 22:06:11,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1962 transitions. [2021-06-05 22:06:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:11,018 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:11,018 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:11,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 22:06:11,018 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:11,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:11,018 INFO L82 PathProgramCache]: Analyzing trace with hash 768619160, now seen corresponding path program 1 times [2021-06-05 22:06:11,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:11,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761025146] [2021-06-05 22:06:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:11,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:11,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761025146] [2021-06-05 22:06:11,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761025146] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:11,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:11,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:11,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039185574] [2021-06-05 22:06:11,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:11,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:11,069 INFO L87 Difference]: Start difference. First operand 540 states and 1962 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:11,128 INFO L93 Difference]: Finished difference Result 783 states and 2585 transitions. [2021-06-05 22:06:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:11,131 INFO L225 Difference]: With dead ends: 783 [2021-06-05 22:06:11,131 INFO L226 Difference]: Without dead ends: 746 [2021-06-05 22:06:11,131 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-06-05 22:06:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 560. [2021-06-05 22:06:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.5778175313059033) internal successors, (2000), 559 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 2000 transitions. [2021-06-05 22:06:11,141 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 2000 transitions. Word has length 16 [2021-06-05 22:06:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:11,141 INFO L482 AbstractCegarLoop]: Abstraction has 560 states and 2000 transitions. [2021-06-05 22:06:11,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 2000 transitions. [2021-06-05 22:06:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:11,143 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:11,143 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:11,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 22:06:11,143 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1488759573, now seen corresponding path program 1 times [2021-06-05 22:06:11,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:11,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700623780] [2021-06-05 22:06:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:11,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:11,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700623780] [2021-06-05 22:06:11,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700623780] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:11,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:11,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:11,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844058742] [2021-06-05 22:06:11,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:11,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:11,442 INFO L87 Difference]: Start difference. First operand 560 states and 2000 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:11,624 INFO L93 Difference]: Finished difference Result 839 states and 2793 transitions. [2021-06-05 22:06:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:11,627 INFO L225 Difference]: With dead ends: 839 [2021-06-05 22:06:11,627 INFO L226 Difference]: Without dead ends: 797 [2021-06-05 22:06:11,627 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 308.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-06-05 22:06:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 560. [2021-06-05 22:06:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.5706618962432914) internal successors, (1996), 559 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1996 transitions. [2021-06-05 22:06:11,638 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1996 transitions. Word has length 16 [2021-06-05 22:06:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:11,638 INFO L482 AbstractCegarLoop]: Abstraction has 560 states and 1996 transitions. [2021-06-05 22:06:11,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1996 transitions. [2021-06-05 22:06:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:11,639 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:11,639 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:11,639 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 22:06:11,639 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 185156587, now seen corresponding path program 1 times [2021-06-05 22:06:11,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:11,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788347268] [2021-06-05 22:06:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:11,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:11,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788347268] [2021-06-05 22:06:11,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788347268] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:11,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:11,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:11,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31634927] [2021-06-05 22:06:11,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:11,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:11,662 INFO L87 Difference]: Start difference. First operand 560 states and 1996 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:11,691 INFO L93 Difference]: Finished difference Result 694 states and 2293 transitions. [2021-06-05 22:06:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:06:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:11,693 INFO L225 Difference]: With dead ends: 694 [2021-06-05 22:06:11,693 INFO L226 Difference]: Without dead ends: 613 [2021-06-05 22:06:11,693 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-05 22:06:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 490. [2021-06-05 22:06:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.5337423312883436) internal successors, (1728), 489 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1728 transitions. [2021-06-05 22:06:11,701 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1728 transitions. Word has length 16 [2021-06-05 22:06:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:11,701 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1728 transitions. [2021-06-05 22:06:11,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1728 transitions. [2021-06-05 22:06:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:11,702 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:11,702 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:11,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 22:06:11,703 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1866944204, now seen corresponding path program 2 times [2021-06-05 22:06:11,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:11,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979817591] [2021-06-05 22:06:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:11,752 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:11,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979817591] [2021-06-05 22:06:11,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979817591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:11,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:11,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:11,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491186112] [2021-06-05 22:06:11,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:11,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:11,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:11,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:11,753 INFO L87 Difference]: Start difference. First operand 490 states and 1728 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:11,845 INFO L93 Difference]: Finished difference Result 937 states and 3020 transitions. [2021-06-05 22:06:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:11,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:11,848 INFO L225 Difference]: With dead ends: 937 [2021-06-05 22:06:11,848 INFO L226 Difference]: Without dead ends: 819 [2021-06-05 22:06:11,848 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-06-05 22:06:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 479. [2021-06-05 22:06:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 3.50418410041841) internal successors, (1675), 478 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1675 transitions. [2021-06-05 22:06:11,857 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1675 transitions. Word has length 16 [2021-06-05 22:06:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:11,857 INFO L482 AbstractCegarLoop]: Abstraction has 479 states and 1675 transitions. [2021-06-05 22:06:11,858 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1675 transitions. [2021-06-05 22:06:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:11,859 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:11,859 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:11,860 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 22:06:11,860 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1453708437, now seen corresponding path program 2 times [2021-06-05 22:06:11,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:11,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016398033] [2021-06-05 22:06:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:12,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:12,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016398033] [2021-06-05 22:06:12,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016398033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:12,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:12,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:12,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557437729] [2021-06-05 22:06:12,009 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:12,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:12,010 INFO L87 Difference]: Start difference. First operand 479 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:12,203 INFO L93 Difference]: Finished difference Result 990 states and 3110 transitions. [2021-06-05 22:06:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:12,207 INFO L225 Difference]: With dead ends: 990 [2021-06-05 22:06:12,207 INFO L226 Difference]: Without dead ends: 861 [2021-06-05 22:06:12,207 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 191.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-06-05 22:06:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 447. [2021-06-05 22:06:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.3430493273542603) internal successors, (1491), 446 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1491 transitions. [2021-06-05 22:06:12,216 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1491 transitions. Word has length 16 [2021-06-05 22:06:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:12,216 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1491 transitions. [2021-06-05 22:06:12,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1491 transitions. [2021-06-05 22:06:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:12,217 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:12,217 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:12,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 22:06:12,217 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1227931188, now seen corresponding path program 2 times [2021-06-05 22:06:12,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:12,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61733846] [2021-06-05 22:06:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:12,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:12,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61733846] [2021-06-05 22:06:12,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61733846] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:12,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:12,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:12,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975953306] [2021-06-05 22:06:12,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:12,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:12,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:12,296 INFO L87 Difference]: Start difference. First operand 447 states and 1491 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:12,436 INFO L93 Difference]: Finished difference Result 772 states and 2437 transitions. [2021-06-05 22:06:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:06:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:12,440 INFO L225 Difference]: With dead ends: 772 [2021-06-05 22:06:12,440 INFO L226 Difference]: Without dead ends: 749 [2021-06-05 22:06:12,440 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 111.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:06:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-06-05 22:06:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 447. [2021-06-05 22:06:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.3430493273542603) internal successors, (1491), 446 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1491 transitions. [2021-06-05 22:06:12,447 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1491 transitions. Word has length 16 [2021-06-05 22:06:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:12,447 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1491 transitions. [2021-06-05 22:06:12,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1491 transitions. [2021-06-05 22:06:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:12,448 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:12,448 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:12,448 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 22:06:12,448 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1214418261, now seen corresponding path program 2 times [2021-06-05 22:06:12,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:12,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018347080] [2021-06-05 22:06:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:12,602 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 22:06:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:12,691 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:12,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018347080] [2021-06-05 22:06:12,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018347080] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:12,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:12,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:12,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502168633] [2021-06-05 22:06:12,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:12,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:12,692 INFO L87 Difference]: Start difference. First operand 447 states and 1491 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:12,821 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2021-06-05 22:06:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:13,036 INFO L93 Difference]: Finished difference Result 756 states and 2389 transitions. [2021-06-05 22:06:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:13,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:13,039 INFO L225 Difference]: With dead ends: 756 [2021-06-05 22:06:13,039 INFO L226 Difference]: Without dead ends: 729 [2021-06-05 22:06:13,039 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 435.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2021-06-05 22:06:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 447. [2021-06-05 22:06:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.3385650224215246) internal successors, (1489), 446 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1489 transitions. [2021-06-05 22:06:13,048 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1489 transitions. Word has length 16 [2021-06-05 22:06:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:13,048 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1489 transitions. [2021-06-05 22:06:13,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1489 transitions. [2021-06-05 22:06:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:13,049 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:13,049 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:13,050 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 22:06:13,050 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash 423749436, now seen corresponding path program 3 times [2021-06-05 22:06:13,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:13,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241903347] [2021-06-05 22:06:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:13,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:13,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241903347] [2021-06-05 22:06:13,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241903347] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:13,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:13,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:13,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956536217] [2021-06-05 22:06:13,084 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:13,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:13,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:13,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:13,085 INFO L87 Difference]: Start difference. First operand 447 states and 1489 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:13,133 INFO L93 Difference]: Finished difference Result 570 states and 1746 transitions. [2021-06-05 22:06:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:13,135 INFO L225 Difference]: With dead ends: 570 [2021-06-05 22:06:13,135 INFO L226 Difference]: Without dead ends: 521 [2021-06-05 22:06:13,135 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-06-05 22:06:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 411. [2021-06-05 22:06:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.3) internal successors, (1353), 410 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1353 transitions. [2021-06-05 22:06:13,143 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1353 transitions. Word has length 16 [2021-06-05 22:06:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:13,143 INFO L482 AbstractCegarLoop]: Abstraction has 411 states and 1353 transitions. [2021-06-05 22:06:13,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1353 transitions. [2021-06-05 22:06:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:13,144 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:13,144 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:13,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 22:06:13,144 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash 486403162, now seen corresponding path program 3 times [2021-06-05 22:06:13,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:13,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590931159] [2021-06-05 22:06:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:13,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:13,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590931159] [2021-06-05 22:06:13,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590931159] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:13,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:13,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:13,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102760881] [2021-06-05 22:06:13,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:13,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:13,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:13,187 INFO L87 Difference]: Start difference. First operand 411 states and 1353 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:13,254 INFO L93 Difference]: Finished difference Result 529 states and 1624 transitions. [2021-06-05 22:06:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:13,255 INFO L225 Difference]: With dead ends: 529 [2021-06-05 22:06:13,255 INFO L226 Difference]: Without dead ends: 506 [2021-06-05 22:06:13,256 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-06-05 22:06:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 430. [2021-06-05 22:06:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.2634032634032635) internal successors, (1400), 429 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1400 transitions. [2021-06-05 22:06:13,263 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1400 transitions. Word has length 16 [2021-06-05 22:06:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:13,263 INFO L482 AbstractCegarLoop]: Abstraction has 430 states and 1400 transitions. [2021-06-05 22:06:13,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1400 transitions. [2021-06-05 22:06:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:13,264 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:13,264 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:13,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 22:06:13,265 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1119769510, now seen corresponding path program 4 times [2021-06-05 22:06:13,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:13,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994555575] [2021-06-05 22:06:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:13,300 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:13,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994555575] [2021-06-05 22:06:13,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994555575] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:13,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:13,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:13,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478601177] [2021-06-05 22:06:13,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:13,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:13,301 INFO L87 Difference]: Start difference. First operand 430 states and 1400 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:13,374 INFO L93 Difference]: Finished difference Result 537 states and 1643 transitions. [2021-06-05 22:06:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:13,376 INFO L225 Difference]: With dead ends: 537 [2021-06-05 22:06:13,376 INFO L226 Difference]: Without dead ends: 514 [2021-06-05 22:06:13,376 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-06-05 22:06:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2021-06-05 22:06:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.2460136674259683) internal successors, (1425), 439 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1425 transitions. [2021-06-05 22:06:13,383 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1425 transitions. Word has length 16 [2021-06-05 22:06:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:13,383 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1425 transitions. [2021-06-05 22:06:13,384 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1425 transitions. [2021-06-05 22:06:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:13,384 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:13,384 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:13,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 22:06:13,385 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2014690215, now seen corresponding path program 3 times [2021-06-05 22:06:13,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:13,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047385227] [2021-06-05 22:06:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:13,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:13,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047385227] [2021-06-05 22:06:13,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047385227] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:13,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:13,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:13,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541676132] [2021-06-05 22:06:13,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:13,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:13,548 INFO L87 Difference]: Start difference. First operand 440 states and 1425 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:13,776 INFO L93 Difference]: Finished difference Result 558 states and 1685 transitions. [2021-06-05 22:06:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:13,778 INFO L225 Difference]: With dead ends: 558 [2021-06-05 22:06:13,778 INFO L226 Difference]: Without dead ends: 516 [2021-06-05 22:06:13,778 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 281.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-06-05 22:06:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 440. [2021-06-05 22:06:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.225512528473804) internal successors, (1416), 439 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1416 transitions. [2021-06-05 22:06:13,786 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1416 transitions. Word has length 16 [2021-06-05 22:06:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:13,786 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1416 transitions. [2021-06-05 22:06:13,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1416 transitions. [2021-06-05 22:06:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:13,787 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:13,787 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:13,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 22:06:13,787 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1307197767, now seen corresponding path program 4 times [2021-06-05 22:06:13,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:13,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731822327] [2021-06-05 22:06:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:13,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:13,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731822327] [2021-06-05 22:06:13,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731822327] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:13,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:13,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:13,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847459116] [2021-06-05 22:06:13,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:13,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:13,928 INFO L87 Difference]: Start difference. First operand 440 states and 1416 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,162 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2021-06-05 22:06:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:14,181 INFO L93 Difference]: Finished difference Result 547 states and 1649 transitions. [2021-06-05 22:06:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:14,182 INFO L225 Difference]: With dead ends: 547 [2021-06-05 22:06:14,182 INFO L226 Difference]: Without dead ends: 514 [2021-06-05 22:06:14,182 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 297.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-06-05 22:06:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2021-06-05 22:06:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.214123006833713) internal successors, (1411), 439 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1411 transitions. [2021-06-05 22:06:14,189 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1411 transitions. Word has length 16 [2021-06-05 22:06:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:14,189 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1411 transitions. [2021-06-05 22:06:14,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1411 transitions. [2021-06-05 22:06:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:14,191 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:14,191 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:14,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 22:06:14,191 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash 648487496, now seen corresponding path program 2 times [2021-06-05 22:06:14,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:14,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645501367] [2021-06-05 22:06:14,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:14,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:14,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645501367] [2021-06-05 22:06:14,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645501367] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:14,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:14,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:14,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55465006] [2021-06-05 22:06:14,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:14,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:14,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:14,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:14,255 INFO L87 Difference]: Start difference. First operand 440 states and 1411 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:14,321 INFO L93 Difference]: Finished difference Result 727 states and 2197 transitions. [2021-06-05 22:06:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:06:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:14,323 INFO L225 Difference]: With dead ends: 727 [2021-06-05 22:06:14,323 INFO L226 Difference]: Without dead ends: 679 [2021-06-05 22:06:14,323 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-06-05 22:06:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 430. [2021-06-05 22:06:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.191142191142191) internal successors, (1369), 429 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1369 transitions. [2021-06-05 22:06:14,330 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1369 transitions. Word has length 16 [2021-06-05 22:06:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:14,330 INFO L482 AbstractCegarLoop]: Abstraction has 430 states and 1369 transitions. [2021-06-05 22:06:14,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1369 transitions. [2021-06-05 22:06:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:14,331 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:14,331 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:14,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 22:06:14,331 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 529800585, now seen corresponding path program 2 times [2021-06-05 22:06:14,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:14,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260946066] [2021-06-05 22:06:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:14,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:14,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260946066] [2021-06-05 22:06:14,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260946066] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:14,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:14,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:14,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216601197] [2021-06-05 22:06:14,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:14,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:14,535 INFO L87 Difference]: Start difference. First operand 430 states and 1369 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:14,737 INFO L93 Difference]: Finished difference Result 785 states and 2408 transitions. [2021-06-05 22:06:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:06:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:14,739 INFO L225 Difference]: With dead ends: 785 [2021-06-05 22:06:14,739 INFO L226 Difference]: Without dead ends: 737 [2021-06-05 22:06:14,739 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2021-06-05 22:06:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 409. [2021-06-05 22:06:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 3.2107843137254903) internal successors, (1310), 408 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1310 transitions. [2021-06-05 22:06:14,746 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1310 transitions. Word has length 16 [2021-06-05 22:06:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:14,746 INFO L482 AbstractCegarLoop]: Abstraction has 409 states and 1310 transitions. [2021-06-05 22:06:14,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1310 transitions. [2021-06-05 22:06:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:14,747 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:14,747 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:14,747 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 22:06:14,747 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash 637834109, now seen corresponding path program 3 times [2021-06-05 22:06:14,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:14,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686055640] [2021-06-05 22:06:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:14,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:14,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686055640] [2021-06-05 22:06:14,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686055640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:14,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:14,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:14,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792731291] [2021-06-05 22:06:14,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:14,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:14,884 INFO L87 Difference]: Start difference. First operand 409 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:15,026 INFO L93 Difference]: Finished difference Result 646 states and 1995 transitions. [2021-06-05 22:06:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:06:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:15,028 INFO L225 Difference]: With dead ends: 646 [2021-06-05 22:06:15,028 INFO L226 Difference]: Without dead ends: 606 [2021-06-05 22:06:15,028 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 147.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-06-05 22:06:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 396. [2021-06-05 22:06:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.2430379746835443) internal successors, (1281), 395 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1281 transitions. [2021-06-05 22:06:15,034 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1281 transitions. Word has length 16 [2021-06-05 22:06:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:15,035 INFO L482 AbstractCegarLoop]: Abstraction has 396 states and 1281 transitions. [2021-06-05 22:06:15,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1281 transitions. [2021-06-05 22:06:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:15,036 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:15,036 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:15,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 22:06:15,036 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash 784334086, now seen corresponding path program 5 times [2021-06-05 22:06:15,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:15,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167823876] [2021-06-05 22:06:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:15,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:15,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167823876] [2021-06-05 22:06:15,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167823876] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:15,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:15,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:15,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844341404] [2021-06-05 22:06:15,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:15,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:15,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:15,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:15,125 INFO L87 Difference]: Start difference. First operand 396 states and 1281 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:15,302 INFO L93 Difference]: Finished difference Result 680 states and 2107 transitions. [2021-06-05 22:06:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:06:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:15,303 INFO L225 Difference]: With dead ends: 680 [2021-06-05 22:06:15,303 INFO L226 Difference]: Without dead ends: 657 [2021-06-05 22:06:15,303 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 150.9ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:06:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-06-05 22:06:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 392. [2021-06-05 22:06:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.2455242966751916) internal successors, (1269), 391 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1269 transitions. [2021-06-05 22:06:15,310 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1269 transitions. Word has length 16 [2021-06-05 22:06:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:15,310 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1269 transitions. [2021-06-05 22:06:15,310 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1269 transitions. [2021-06-05 22:06:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:15,311 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:15,311 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:15,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 22:06:15,311 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash 797847013, now seen corresponding path program 5 times [2021-06-05 22:06:15,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:15,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770439467] [2021-06-05 22:06:15,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:15,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:15,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770439467] [2021-06-05 22:06:15,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770439467] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:15,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:15,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:15,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451569367] [2021-06-05 22:06:15,517 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:15,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:15,518 INFO L87 Difference]: Start difference. First operand 392 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,787 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2021-06-05 22:06:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:15,815 INFO L93 Difference]: Finished difference Result 690 states and 2128 transitions. [2021-06-05 22:06:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:06:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:15,817 INFO L225 Difference]: With dead ends: 690 [2021-06-05 22:06:15,817 INFO L226 Difference]: Without dead ends: 663 [2021-06-05 22:06:15,817 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 323.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-06-05 22:06:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 392. [2021-06-05 22:06:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.2404092071611252) internal successors, (1267), 391 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1267 transitions. [2021-06-05 22:06:15,824 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1267 transitions. Word has length 16 [2021-06-05 22:06:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:15,824 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1267 transitions. [2021-06-05 22:06:15,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1267 transitions. [2021-06-05 22:06:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:15,825 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:15,825 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:15,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 22:06:15,825 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1214532848, now seen corresponding path program 6 times [2021-06-05 22:06:15,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:15,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215407153] [2021-06-05 22:06:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:15,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:15,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215407153] [2021-06-05 22:06:15,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215407153] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:15,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:15,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:15,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606376525] [2021-06-05 22:06:15,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:15,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:15,884 INFO L87 Difference]: Start difference. First operand 392 states and 1267 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:15,958 INFO L93 Difference]: Finished difference Result 595 states and 1821 transitions. [2021-06-05 22:06:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:15,960 INFO L225 Difference]: With dead ends: 595 [2021-06-05 22:06:15,960 INFO L226 Difference]: Without dead ends: 572 [2021-06-05 22:06:15,960 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-06-05 22:06:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 392. [2021-06-05 22:06:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.2404092071611252) internal successors, (1267), 391 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1267 transitions. [2021-06-05 22:06:15,967 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1267 transitions. Word has length 16 [2021-06-05 22:06:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:15,967 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1267 transitions. [2021-06-05 22:06:15,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1267 transitions. [2021-06-05 22:06:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:06:15,968 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:15,968 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:15,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 22:06:15,968 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1154290151, now seen corresponding path program 6 times [2021-06-05 22:06:15,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:15,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210280676] [2021-06-05 22:06:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 22:06:16,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:16,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210280676] [2021-06-05 22:06:16,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210280676] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:16,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:16,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:06:16,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904630192] [2021-06-05 22:06:16,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:06:16,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:06:16,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:16,311 INFO L87 Difference]: Start difference. First operand 392 states and 1267 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:16,490 INFO L93 Difference]: Finished difference Result 595 states and 1811 transitions. [2021-06-05 22:06:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:06:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:16,491 INFO L225 Difference]: With dead ends: 595 [2021-06-05 22:06:16,491 INFO L226 Difference]: Without dead ends: 562 [2021-06-05 22:06:16,492 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 358.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:06:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-06-05 22:06:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 392. [2021-06-05 22:06:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.235294117647059) internal successors, (1265), 391 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1265 transitions. [2021-06-05 22:06:16,497 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1265 transitions. Word has length 16 [2021-06-05 22:06:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:16,498 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1265 transitions. [2021-06-05 22:06:16,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1265 transitions. [2021-06-05 22:06:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:16,498 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:16,498 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:16,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 22:06:16,499 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:16,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:16,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1318202505, now seen corresponding path program 1 times [2021-06-05 22:06:16,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:16,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707616314] [2021-06-05 22:06:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:16,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:16,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707616314] [2021-06-05 22:06:16,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707616314] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:16,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:16,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:16,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63761396] [2021-06-05 22:06:16,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:16,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:16,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:16,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:16,514 INFO L87 Difference]: Start difference. First operand 392 states and 1265 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:16,543 INFO L93 Difference]: Finished difference Result 566 states and 1698 transitions. [2021-06-05 22:06:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:16,544 INFO L225 Difference]: With dead ends: 566 [2021-06-05 22:06:16,544 INFO L226 Difference]: Without dead ends: 566 [2021-06-05 22:06:16,545 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-06-05 22:06:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 420. [2021-06-05 22:06:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.252983293556086) internal successors, (1363), 419 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1363 transitions. [2021-06-05 22:06:16,551 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1363 transitions. Word has length 18 [2021-06-05 22:06:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:16,551 INFO L482 AbstractCegarLoop]: Abstraction has 420 states and 1363 transitions. [2021-06-05 22:06:16,551 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1363 transitions. [2021-06-05 22:06:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:16,552 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:16,552 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:16,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 22:06:16,552 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1664376435, now seen corresponding path program 2 times [2021-06-05 22:06:16,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:16,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499939379] [2021-06-05 22:06:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:16,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:16,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499939379] [2021-06-05 22:06:16,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499939379] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:16,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:16,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:16,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374918110] [2021-06-05 22:06:16,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:16,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:16,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:16,576 INFO L87 Difference]: Start difference. First operand 420 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:16,619 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2021-06-05 22:06:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:16,621 INFO L225 Difference]: With dead ends: 594 [2021-06-05 22:06:16,621 INFO L226 Difference]: Without dead ends: 586 [2021-06-05 22:06:16,626 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-06-05 22:06:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 420. [2021-06-05 22:06:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.243436754176611) internal successors, (1359), 419 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1359 transitions. [2021-06-05 22:06:16,633 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1359 transitions. Word has length 18 [2021-06-05 22:06:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:16,634 INFO L482 AbstractCegarLoop]: Abstraction has 420 states and 1359 transitions. [2021-06-05 22:06:16,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1359 transitions. [2021-06-05 22:06:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:16,635 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:16,635 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:16,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 22:06:16,635 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1681246645, now seen corresponding path program 1 times [2021-06-05 22:06:16,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:16,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563504020] [2021-06-05 22:06:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:16,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:16,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563504020] [2021-06-05 22:06:16,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563504020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:16,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:16,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:16,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814978694] [2021-06-05 22:06:16,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:16,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:16,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:16,677 INFO L87 Difference]: Start difference. First operand 420 states and 1359 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:16,742 INFO L93 Difference]: Finished difference Result 602 states and 1832 transitions. [2021-06-05 22:06:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:16,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:16,743 INFO L225 Difference]: With dead ends: 602 [2021-06-05 22:06:16,743 INFO L226 Difference]: Without dead ends: 602 [2021-06-05 22:06:16,743 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-06-05 22:06:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 457. [2021-06-05 22:06:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.2214912280701755) internal successors, (1469), 456 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1469 transitions. [2021-06-05 22:06:16,750 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1469 transitions. Word has length 18 [2021-06-05 22:06:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:16,750 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1469 transitions. [2021-06-05 22:06:16,751 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1469 transitions. [2021-06-05 22:06:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:16,751 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:16,751 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:16,751 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 22:06:16,752 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1406905333, now seen corresponding path program 2 times [2021-06-05 22:06:16,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:16,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920914536] [2021-06-05 22:06:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:16,787 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:16,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920914536] [2021-06-05 22:06:16,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920914536] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:16,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:16,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:16,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515827128] [2021-06-05 22:06:16,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:16,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:16,789 INFO L87 Difference]: Start difference. First operand 457 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:16,850 INFO L93 Difference]: Finished difference Result 590 states and 1764 transitions. [2021-06-05 22:06:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:16,852 INFO L225 Difference]: With dead ends: 590 [2021-06-05 22:06:16,852 INFO L226 Difference]: Without dead ends: 582 [2021-06-05 22:06:16,852 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-06-05 22:06:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 457. [2021-06-05 22:06:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.212719298245614) internal successors, (1465), 456 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1465 transitions. [2021-06-05 22:06:16,858 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1465 transitions. Word has length 18 [2021-06-05 22:06:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:16,859 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1465 transitions. [2021-06-05 22:06:16,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1465 transitions. [2021-06-05 22:06:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:16,859 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:16,859 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:16,860 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 22:06:16,860 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 506049385, now seen corresponding path program 1 times [2021-06-05 22:06:16,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:16,860 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842224818] [2021-06-05 22:06:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:16,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:16,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842224818] [2021-06-05 22:06:16,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842224818] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:16,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:16,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:16,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560369010] [2021-06-05 22:06:16,907 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:16,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:16,907 INFO L87 Difference]: Start difference. First operand 457 states and 1465 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:16,989 INFO L93 Difference]: Finished difference Result 537 states and 1634 transitions. [2021-06-05 22:06:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:16,990 INFO L225 Difference]: With dead ends: 537 [2021-06-05 22:06:16,990 INFO L226 Difference]: Without dead ends: 525 [2021-06-05 22:06:16,991 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-05 22:06:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 453. [2021-06-05 22:06:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.2234513274336285) internal successors, (1457), 452 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1457 transitions. [2021-06-05 22:06:16,997 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1457 transitions. Word has length 18 [2021-06-05 22:06:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:16,997 INFO L482 AbstractCegarLoop]: Abstraction has 453 states and 1457 transitions. [2021-06-05 22:06:16,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1457 transitions. [2021-06-05 22:06:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:16,998 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:16,998 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:16,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 22:06:16,998 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:16,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1415879781, now seen corresponding path program 3 times [2021-06-05 22:06:16,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:16,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952834403] [2021-06-05 22:06:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952834403] [2021-06-05 22:06:17,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952834403] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:17,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067638253] [2021-06-05 22:06:17,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:17,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:17,015 INFO L87 Difference]: Start difference. First operand 453 states and 1457 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,045 INFO L93 Difference]: Finished difference Result 549 states and 1641 transitions. [2021-06-05 22:06:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,046 INFO L225 Difference]: With dead ends: 549 [2021-06-05 22:06:17,046 INFO L226 Difference]: Without dead ends: 549 [2021-06-05 22:06:17,046 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-06-05 22:06:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 396. [2021-06-05 22:06:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1544303797468354) internal successors, (1246), 395 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1246 transitions. [2021-06-05 22:06:17,052 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1246 transitions. Word has length 18 [2021-06-05 22:06:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,052 INFO L482 AbstractCegarLoop]: Abstraction has 396 states and 1246 transitions. [2021-06-05 22:06:17,052 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1246 transitions. [2021-06-05 22:06:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,053 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,053 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,053 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 22:06:17,053 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1243069021, now seen corresponding path program 1 times [2021-06-05 22:06:17,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174629529] [2021-06-05 22:06:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174629529] [2021-06-05 22:06:17,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174629529] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:17,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234459747] [2021-06-05 22:06:17,067 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:17,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:17,067 INFO L87 Difference]: Start difference. First operand 396 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,094 INFO L93 Difference]: Finished difference Result 442 states and 1323 transitions. [2021-06-05 22:06:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:06:17,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,095 INFO L225 Difference]: With dead ends: 442 [2021-06-05 22:06:17,095 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 22:06:17,095 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 22:06:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 396. [2021-06-05 22:06:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.118987341772152) internal successors, (1232), 395 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1232 transitions. [2021-06-05 22:06:17,100 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1232 transitions. Word has length 18 [2021-06-05 22:06:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,100 INFO L482 AbstractCegarLoop]: Abstraction has 396 states and 1232 transitions. [2021-06-05 22:06:17,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1232 transitions. [2021-06-05 22:06:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,101 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,101 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 22:06:17,101 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1059721977, now seen corresponding path program 3 times [2021-06-05 22:06:17,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978315158] [2021-06-05 22:06:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978315158] [2021-06-05 22:06:17,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978315158] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:17,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958200735] [2021-06-05 22:06:17,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:17,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:17,134 INFO L87 Difference]: Start difference. First operand 396 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,194 INFO L93 Difference]: Finished difference Result 482 states and 1411 transitions. [2021-06-05 22:06:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,196 INFO L225 Difference]: With dead ends: 482 [2021-06-05 22:06:17,196 INFO L226 Difference]: Without dead ends: 482 [2021-06-05 22:06:17,196 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-06-05 22:06:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 359. [2021-06-05 22:06:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0754189944134076) internal successors, (1101), 358 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1101 transitions. [2021-06-05 22:06:17,202 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1101 transitions. Word has length 18 [2021-06-05 22:06:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,202 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1101 transitions. [2021-06-05 22:06:17,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1101 transitions. [2021-06-05 22:06:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,203 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,203 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,203 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 22:06:17,203 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash -197121861, now seen corresponding path program 2 times [2021-06-05 22:06:17,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252721481] [2021-06-05 22:06:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252721481] [2021-06-05 22:06:17,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252721481] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:17,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186935638] [2021-06-05 22:06:17,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:17,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,261 INFO L87 Difference]: Start difference. First operand 359 states and 1101 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,311 INFO L93 Difference]: Finished difference Result 467 states and 1366 transitions. [2021-06-05 22:06:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,313 INFO L225 Difference]: With dead ends: 467 [2021-06-05 22:06:17,313 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 22:06:17,314 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 22:06:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 379. [2021-06-05 22:06:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.0714285714285716) internal successors, (1161), 378 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1161 transitions. [2021-06-05 22:06:17,320 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1161 transitions. Word has length 18 [2021-06-05 22:06:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,321 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1161 transitions. [2021-06-05 22:06:17,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1161 transitions. [2021-06-05 22:06:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,322 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,322 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,322 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 22:06:17,322 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1939653789, now seen corresponding path program 3 times [2021-06-05 22:06:17,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722637301] [2021-06-05 22:06:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722637301] [2021-06-05 22:06:17,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722637301] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:17,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331216827] [2021-06-05 22:06:17,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:17,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:17,357 INFO L87 Difference]: Start difference. First operand 379 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,411 INFO L93 Difference]: Finished difference Result 504 states and 1436 transitions. [2021-06-05 22:06:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,413 INFO L225 Difference]: With dead ends: 504 [2021-06-05 22:06:17,413 INFO L226 Difference]: Without dead ends: 496 [2021-06-05 22:06:17,413 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-06-05 22:06:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 379. [2021-06-05 22:06:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.060846560846561) internal successors, (1157), 378 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1157 transitions. [2021-06-05 22:06:17,418 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1157 transitions. Word has length 18 [2021-06-05 22:06:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,418 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1157 transitions. [2021-06-05 22:06:17,418 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1157 transitions. [2021-06-05 22:06:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,419 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,419 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,419 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 22:06:17,419 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1583210651, now seen corresponding path program 4 times [2021-06-05 22:06:17,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269381009] [2021-06-05 22:06:17,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269381009] [2021-06-05 22:06:17,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269381009] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:17,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521051740] [2021-06-05 22:06:17,472 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:17,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,472 INFO L87 Difference]: Start difference. First operand 379 states and 1157 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,516 INFO L93 Difference]: Finished difference Result 441 states and 1293 transitions. [2021-06-05 22:06:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,518 INFO L225 Difference]: With dead ends: 441 [2021-06-05 22:06:17,518 INFO L226 Difference]: Without dead ends: 441 [2021-06-05 22:06:17,518 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-06-05 22:06:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 359. [2021-06-05 22:06:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0083798882681565) internal successors, (1077), 358 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1077 transitions. [2021-06-05 22:06:17,523 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1077 transitions. Word has length 18 [2021-06-05 22:06:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,523 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1077 transitions. [2021-06-05 22:06:17,523 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1077 transitions. [2021-06-05 22:06:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,523 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,523 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 22:06:17,524 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2015137509, now seen corresponding path program 4 times [2021-06-05 22:06:17,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277572793] [2021-06-05 22:06:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277572793] [2021-06-05 22:06:17,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277572793] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:17,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921700187] [2021-06-05 22:06:17,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:17,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,549 INFO L87 Difference]: Start difference. First operand 359 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,572 INFO L93 Difference]: Finished difference Result 439 states and 1246 transitions. [2021-06-05 22:06:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:06:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,573 INFO L225 Difference]: With dead ends: 439 [2021-06-05 22:06:17,573 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 22:06:17,573 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 22:06:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 359. [2021-06-05 22:06:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0027932960893855) internal successors, (1075), 358 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1075 transitions. [2021-06-05 22:06:17,578 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1075 transitions. Word has length 18 [2021-06-05 22:06:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,578 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1075 transitions. [2021-06-05 22:06:17,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1075 transitions. [2021-06-05 22:06:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,579 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,579 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 22:06:17,579 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 325544227, now seen corresponding path program 4 times [2021-06-05 22:06:17,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504882901] [2021-06-05 22:06:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504882901] [2021-06-05 22:06:17,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504882901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:06:17,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072385405] [2021-06-05 22:06:17,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:06:17,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:06:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,639 INFO L87 Difference]: Start difference. First operand 359 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,707 INFO L93 Difference]: Finished difference Result 384 states and 1113 transitions. [2021-06-05 22:06:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:06:17,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,708 INFO L225 Difference]: With dead ends: 384 [2021-06-05 22:06:17,708 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 22:06:17,708 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 71.0ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:06:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 22:06:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 359. [2021-06-05 22:06:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 2.9972067039106145) internal successors, (1073), 358 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1073 transitions. [2021-06-05 22:06:17,713 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1073 transitions. Word has length 18 [2021-06-05 22:06:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,713 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1073 transitions. [2021-06-05 22:06:17,713 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1073 transitions. [2021-06-05 22:06:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:06:17,713 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,714 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 22:06:17,714 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,714 INFO L82 PathProgramCache]: Analyzing trace with hash 724624817, now seen corresponding path program 5 times [2021-06-05 22:06:17,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482264892] [2021-06-05 22:06:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 22:06:17,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:17,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482264892] [2021-06-05 22:06:17,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482264892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:06:17,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:06:17,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:06:17,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298588086] [2021-06-05 22:06:17,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:06:17,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:06:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:06:17,729 INFO L87 Difference]: Start difference. First operand 359 states and 1073 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:17,751 INFO L93 Difference]: Finished difference Result 386 states and 1114 transitions. [2021-06-05 22:06:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:06:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:06:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:17,752 INFO L225 Difference]: With dead ends: 386 [2021-06-05 22:06:17,752 INFO L226 Difference]: Without dead ends: 374 [2021-06-05 22:06:17,752 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:06:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-05 22:06:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 357. [2021-06-05 22:06:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.002808988764045) internal successors, (1069), 356 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1069 transitions. [2021-06-05 22:06:17,757 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1069 transitions. Word has length 18 [2021-06-05 22:06:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:17,757 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1069 transitions. [2021-06-05 22:06:17,757 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1069 transitions. [2021-06-05 22:06:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:17,758 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:17,758 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:17,758 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 22:06:17,758 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2111156678, now seen corresponding path program 1 times [2021-06-05 22:06:17,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:17,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200052612] [2021-06-05 22:06:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:18,063 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:18,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200052612] [2021-06-05 22:06:18,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200052612] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:18,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028102900] [2021-06-05 22:06:18,064 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 [2021-06-05 22:06:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:18,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 22:06:18,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:18,764 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-06-05 22:06:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:19,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028102900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:19,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:19,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:06:19,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241885672] [2021-06-05 22:06:19,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:06:19,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:06:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:06:19,043 INFO L87 Difference]: Start difference. First operand 357 states and 1069 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:19,687 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 22:06:19,905 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2021-06-05 22:06:20,174 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 22:06:20,463 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2021-06-05 22:06:20,657 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-06-05 22:06:20,814 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 22:06:20,960 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 22:06:21,093 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2021-06-05 22:06:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:21,215 INFO L93 Difference]: Finished difference Result 620 states and 1813 transitions. [2021-06-05 22:06:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 22:06:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:21,217 INFO L225 Difference]: With dead ends: 620 [2021-06-05 22:06:21,218 INFO L226 Difference]: Without dead ends: 605 [2021-06-05 22:06:21,218 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2597.7ms TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 22:06:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-06-05 22:06:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 378. [2021-06-05 22:06:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.981432360742706) internal successors, (1124), 377 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1124 transitions. [2021-06-05 22:06:21,225 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1124 transitions. Word has length 20 [2021-06-05 22:06:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:21,225 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1124 transitions. [2021-06-05 22:06:21,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1124 transitions. [2021-06-05 22:06:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:21,226 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:21,226 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:21,433 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 22:06:21,433 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:21,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:21,433 INFO L82 PathProgramCache]: Analyzing trace with hash 301436920, now seen corresponding path program 2 times [2021-06-05 22:06:21,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:21,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487790923] [2021-06-05 22:06:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:21,930 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:21,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487790923] [2021-06-05 22:06:21,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487790923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:21,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311366025] [2021-06-05 22:06:21,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2021-06-05 22:06:21,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:06:21,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:21,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:21,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:22,410 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-06-05 22:06:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:22,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311366025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:22,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:22,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:06:22,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506627910] [2021-06-05 22:06:22,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:06:22,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:22,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:06:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:06:22,614 INFO L87 Difference]: Start difference. First operand 378 states and 1124 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:22,768 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-06-05 22:06:23,043 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-06-05 22:06:23,556 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 22:06:24,090 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2021-06-05 22:06:24,238 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2021-06-05 22:06:24,926 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2021-06-05 22:06:25,084 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2021-06-05 22:06:25,296 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2021-06-05 22:06:25,577 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-05 22:06:25,823 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2021-06-05 22:06:25,978 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2021-06-05 22:06:26,154 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2021-06-05 22:06:26,521 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2021-06-05 22:06:26,750 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2021-06-05 22:06:26,909 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2021-06-05 22:06:27,057 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2021-06-05 22:06:27,293 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-06-05 22:06:27,473 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2021-06-05 22:06:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:27,509 INFO L93 Difference]: Finished difference Result 704 states and 2057 transitions. [2021-06-05 22:06:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 22:06:27,509 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:27,511 INFO L225 Difference]: With dead ends: 704 [2021-06-05 22:06:27,511 INFO L226 Difference]: Without dead ends: 689 [2021-06-05 22:06:27,511 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 5079.1ms TimeCoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 22:06:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-06-05 22:06:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 398. [2021-06-05 22:06:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.025188916876574) internal successors, (1201), 397 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1201 transitions. [2021-06-05 22:06:27,519 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1201 transitions. Word has length 20 [2021-06-05 22:06:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:27,519 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1201 transitions. [2021-06-05 22:06:27,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1201 transitions. [2021-06-05 22:06:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:27,519 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:27,520 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:27,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:27,735 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1134434440, now seen corresponding path program 3 times [2021-06-05 22:06:27,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:27,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597167818] [2021-06-05 22:06:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:28,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:28,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597167818] [2021-06-05 22:06:28,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597167818] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:28,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394294179] [2021-06-05 22:06:28,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2021-06-05 22:06:28,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:06:28,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:28,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:28,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:28,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394294179] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:28,653 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:28,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:06:28,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423304114] [2021-06-05 22:06:28,653 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:06:28,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:06:28,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:06:28,654 INFO L87 Difference]: Start difference. First operand 398 states and 1201 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:29,137 INFO L93 Difference]: Finished difference Result 596 states and 1774 transitions. [2021-06-05 22:06:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:06:29,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:29,139 INFO L225 Difference]: With dead ends: 596 [2021-06-05 22:06:29,139 INFO L226 Difference]: Without dead ends: 581 [2021-06-05 22:06:29,139 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 957.0ms TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:06:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-06-05 22:06:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 407. [2021-06-05 22:06:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.0246305418719213) internal successors, (1228), 406 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1228 transitions. [2021-06-05 22:06:29,145 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1228 transitions. Word has length 20 [2021-06-05 22:06:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:29,145 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 1228 transitions. [2021-06-05 22:06:29,145 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1228 transitions. [2021-06-05 22:06:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:29,146 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:29,146 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:29,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:29,361 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 464235032, now seen corresponding path program 4 times [2021-06-05 22:06:29,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:29,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111504490] [2021-06-05 22:06:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:29,917 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:29,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111504490] [2021-06-05 22:06:29,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111504490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:29,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806774910] [2021-06-05 22:06:29,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2021-06-05 22:06:29,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:06:29,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:29,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:29,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:30,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806774910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:30,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:30,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:06:30,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260062528] [2021-06-05 22:06:30,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:06:30,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:30,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:06:30,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:06:30,480 INFO L87 Difference]: Start difference. First operand 407 states and 1228 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:31,212 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 22:06:31,440 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2021-06-05 22:06:31,580 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2021-06-05 22:06:31,699 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-06-05 22:06:31,837 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2021-06-05 22:06:31,996 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2021-06-05 22:06:32,184 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2021-06-05 22:06:32,347 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-06-05 22:06:32,491 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-06-05 22:06:32,634 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 22:06:32,766 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-06-05 22:06:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:32,805 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2021-06-05 22:06:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 22:06:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:32,807 INFO L225 Difference]: With dead ends: 628 [2021-06-05 22:06:32,807 INFO L226 Difference]: Without dead ends: 613 [2021-06-05 22:06:32,807 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2774.3ms TimeCoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 22:06:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-05 22:06:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 407. [2021-06-05 22:06:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.0246305418719213) internal successors, (1228), 406 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1228 transitions. [2021-06-05 22:06:32,813 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1228 transitions. Word has length 20 [2021-06-05 22:06:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:32,813 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 1228 transitions. [2021-06-05 22:06:32,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1228 transitions. [2021-06-05 22:06:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:32,814 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:32,814 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:33,022 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:33,022 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 812620716, now seen corresponding path program 5 times [2021-06-05 22:06:33,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:33,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284182790] [2021-06-05 22:06:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:33,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:33,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284182790] [2021-06-05 22:06:33,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284182790] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:33,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271055596] [2021-06-05 22:06:33,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2021-06-05 22:06:33,255 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:06:33,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:33,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:33,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:33,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271055596] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:33,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:33,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:06:33,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234429806] [2021-06-05 22:06:33,794 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:06:33,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:06:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:06:33,794 INFO L87 Difference]: Start difference. First operand 407 states and 1228 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:34,150 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-06-05 22:06:34,568 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-06-05 22:06:34,697 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2021-06-05 22:06:35,031 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-06-05 22:06:35,252 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2021-06-05 22:06:35,390 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-06-05 22:06:35,755 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-06-05 22:06:35,962 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2021-06-05 22:06:36,150 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-06-05 22:06:36,367 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2021-06-05 22:06:36,537 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2021-06-05 22:06:36,720 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2021-06-05 22:06:37,011 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2021-06-05 22:06:37,269 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2021-06-05 22:06:37,519 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2021-06-05 22:06:37,843 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2021-06-05 22:06:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:37,896 INFO L93 Difference]: Finished difference Result 753 states and 2206 transitions. [2021-06-05 22:06:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 22:06:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:37,898 INFO L225 Difference]: With dead ends: 753 [2021-06-05 22:06:37,898 INFO L226 Difference]: Without dead ends: 738 [2021-06-05 22:06:37,898 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 4029.8ms TimeCoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 22:06:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-06-05 22:06:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 432. [2021-06-05 22:06:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.0255220417633413) internal successors, (1304), 431 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1304 transitions. [2021-06-05 22:06:37,905 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1304 transitions. Word has length 20 [2021-06-05 22:06:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:37,905 INFO L482 AbstractCegarLoop]: Abstraction has 432 states and 1304 transitions. [2021-06-05 22:06:37,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1304 transitions. [2021-06-05 22:06:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:37,906 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:37,906 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:38,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2021-06-05 22:06:38,115 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1379795916, now seen corresponding path program 6 times [2021-06-05 22:06:38,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:38,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385096886] [2021-06-05 22:06:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:38,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:38,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385096886] [2021-06-05 22:06:38,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385096886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:38,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462186034] [2021-06-05 22:06:38,307 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2021-06-05 22:06:38,344 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:06:38,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:38,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:38,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:38,708 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-06-05 22:06:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:38,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462186034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:38,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:38,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:06:38,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214319133] [2021-06-05 22:06:38,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:06:38,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:06:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:06:38,945 INFO L87 Difference]: Start difference. First operand 432 states and 1304 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:39,307 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2021-06-05 22:06:39,548 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2021-06-05 22:06:39,774 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2021-06-05 22:06:39,971 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2021-06-05 22:06:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:40,011 INFO L93 Difference]: Finished difference Result 700 states and 2057 transitions. [2021-06-05 22:06:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:06:40,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:40,012 INFO L225 Difference]: With dead ends: 700 [2021-06-05 22:06:40,012 INFO L226 Difference]: Without dead ends: 685 [2021-06-05 22:06:40,012 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1393.0ms TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:06:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-06-05 22:06:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 435. [2021-06-05 22:06:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.032258064516129) internal successors, (1316), 434 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1316 transitions. [2021-06-05 22:06:40,018 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1316 transitions. Word has length 20 [2021-06-05 22:06:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:40,018 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1316 transitions. [2021-06-05 22:06:40,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1316 transitions. [2021-06-05 22:06:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:40,019 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:40,019 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:40,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:40,233 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1032797682, now seen corresponding path program 7 times [2021-06-05 22:06:40,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:40,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510681974] [2021-06-05 22:06:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:40,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:40,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510681974] [2021-06-05 22:06:40,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510681974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:40,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303383887] [2021-06-05 22:06:40,484 INFO L93 rtionOrderModulation]: Changing assertion order to 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 [2021-06-05 22:06:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:40,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:40,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:41,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303383887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:41,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:41,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:06:41,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774815081] [2021-06-05 22:06:41,089 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:06:41,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:06:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:06:41,089 INFO L87 Difference]: Start difference. First operand 435 states and 1316 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:41,231 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 22:06:41,390 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2021-06-05 22:06:41,592 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2021-06-05 22:06:41,825 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2021-06-05 22:06:42,246 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 22:06:42,479 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 22:06:42,679 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2021-06-05 22:06:42,862 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2021-06-05 22:06:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:42,911 INFO L93 Difference]: Finished difference Result 745 states and 2194 transitions. [2021-06-05 22:06:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 22:06:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:42,913 INFO L225 Difference]: With dead ends: 745 [2021-06-05 22:06:42,913 INFO L226 Difference]: Without dead ends: 730 [2021-06-05 22:06:42,913 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2148.2ms TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 22:06:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-06-05 22:06:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 433. [2021-06-05 22:06:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 3.0300925925925926) internal successors, (1309), 432 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1309 transitions. [2021-06-05 22:06:42,919 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1309 transitions. Word has length 20 [2021-06-05 22:06:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:42,919 INFO L482 AbstractCegarLoop]: Abstraction has 433 states and 1309 transitions. [2021-06-05 22:06:42,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1309 transitions. [2021-06-05 22:06:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:42,920 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:42,920 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:43,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:43,124 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -280993702, now seen corresponding path program 8 times [2021-06-05 22:06:43,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:43,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484024397] [2021-06-05 22:06:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:43,491 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:43,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484024397] [2021-06-05 22:06:43,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484024397] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:43,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885402168] [2021-06-05 22:06:43,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2021-06-05 22:06:43,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:06:43,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:43,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:43,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:44,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885402168] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:44,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:44,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:06:44,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776199647] [2021-06-05 22:06:44,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:06:44,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:06:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:06:44,149 INFO L87 Difference]: Start difference. First operand 433 states and 1309 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:44,297 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2021-06-05 22:06:44,634 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-06-05 22:06:44,855 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2021-06-05 22:06:45,028 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2021-06-05 22:06:45,184 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-05 22:06:45,417 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2021-06-05 22:06:45,582 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2021-06-05 22:06:45,829 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2021-06-05 22:06:45,956 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-06-05 22:06:46,238 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 22:06:46,571 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 22:06:46,822 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 22:06:47,247 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2021-06-05 22:06:47,496 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-06-05 22:06:47,720 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-06-05 22:06:47,852 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2021-06-05 22:06:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:47,903 INFO L93 Difference]: Finished difference Result 718 states and 2099 transitions. [2021-06-05 22:06:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 22:06:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:47,904 INFO L225 Difference]: With dead ends: 718 [2021-06-05 22:06:47,905 INFO L226 Difference]: Without dead ends: 703 [2021-06-05 22:06:47,905 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4001.6ms TimeCoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 22:06:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-06-05 22:06:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 442. [2021-06-05 22:06:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.036281179138322) internal successors, (1339), 441 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1339 transitions. [2021-06-05 22:06:47,911 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1339 transitions. Word has length 20 [2021-06-05 22:06:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:47,911 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1339 transitions. [2021-06-05 22:06:47,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1339 transitions. [2021-06-05 22:06:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:47,912 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:47,912 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:48,132 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable204 [2021-06-05 22:06:48,133 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2131599896, now seen corresponding path program 9 times [2021-06-05 22:06:48,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:48,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720046308] [2021-06-05 22:06:48,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:48,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:48,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720046308] [2021-06-05 22:06:48,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720046308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:48,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627256857] [2021-06-05 22:06:48,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2021-06-05 22:06:48,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:06:48,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:48,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:48,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:48,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627256857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:48,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:48,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:06:48,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664502734] [2021-06-05 22:06:48,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:06:48,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:06:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:06:48,983 INFO L87 Difference]: Start difference. First operand 442 states and 1339 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:49,572 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 22:06:49,783 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-06-05 22:06:50,223 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-06-05 22:06:50,480 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2021-06-05 22:06:50,744 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-06-05 22:06:50,873 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-06-05 22:06:51,032 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-06-05 22:06:51,159 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2021-06-05 22:06:51,363 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-05 22:06:51,489 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-06-05 22:06:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:51,521 INFO L93 Difference]: Finished difference Result 691 states and 2058 transitions. [2021-06-05 22:06:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 22:06:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:51,522 INFO L225 Difference]: With dead ends: 691 [2021-06-05 22:06:51,522 INFO L226 Difference]: Without dead ends: 676 [2021-06-05 22:06:51,522 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2858.3ms TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 22:06:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-06-05 22:06:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 439. [2021-06-05 22:06:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.029680365296804) internal successors, (1327), 438 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1327 transitions. [2021-06-05 22:06:51,528 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1327 transitions. Word has length 20 [2021-06-05 22:06:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:51,528 INFO L482 AbstractCegarLoop]: Abstraction has 439 states and 1327 transitions. [2021-06-05 22:06:51,528 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1327 transitions. [2021-06-05 22:06:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:51,529 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:51,529 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:51,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable224 [2021-06-05 22:06:51,745 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash 695728536, now seen corresponding path program 10 times [2021-06-05 22:06:51,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:51,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103545406] [2021-06-05 22:06:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:51,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:51,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103545406] [2021-06-05 22:06:51,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103545406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:51,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887978659] [2021-06-05 22:06:51,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2021-06-05 22:06:52,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:06:52,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:52,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:52,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:52,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887978659] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:52,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:52,503 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:06:52,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227840183] [2021-06-05 22:06:52,503 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:06:52,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:06:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:06:52,503 INFO L87 Difference]: Start difference. First operand 439 states and 1327 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:53,039 INFO L93 Difference]: Finished difference Result 653 states and 1947 transitions. [2021-06-05 22:06:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:06:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:53,040 INFO L225 Difference]: With dead ends: 653 [2021-06-05 22:06:53,040 INFO L226 Difference]: Without dead ends: 638 [2021-06-05 22:06:53,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 859.9ms TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2021-06-05 22:06:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-05 22:06:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 442. [2021-06-05 22:06:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.036281179138322) internal successors, (1339), 441 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1339 transitions. [2021-06-05 22:06:53,050 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1339 transitions. Word has length 20 [2021-06-05 22:06:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:53,050 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1339 transitions. [2021-06-05 22:06:53,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1339 transitions. [2021-06-05 22:06:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:53,050 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:53,051 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:53,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:53,269 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2000569288, now seen corresponding path program 11 times [2021-06-05 22:06:53,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:53,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445617188] [2021-06-05 22:06:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:53,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:53,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445617188] [2021-06-05 22:06:53,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445617188] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:53,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632178149] [2021-06-05 22:06:53,471 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:53,508 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:06:53,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:53,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:53,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:53,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632178149] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:53,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:53,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:06:53,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200817232] [2021-06-05 22:06:53,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:06:53,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:53,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:06:53,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:06:53,955 INFO L87 Difference]: Start difference. First operand 442 states and 1339 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:54,237 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 22:06:54,774 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-05 22:06:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:55,083 INFO L93 Difference]: Finished difference Result 689 states and 2044 transitions. [2021-06-05 22:06:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 22:06:55,083 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:55,084 INFO L225 Difference]: With dead ends: 689 [2021-06-05 22:06:55,084 INFO L226 Difference]: Without dead ends: 674 [2021-06-05 22:06:55,084 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1303.1ms TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2021-06-05 22:06:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-06-05 22:06:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 437. [2021-06-05 22:06:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.032110091743119) internal successors, (1322), 436 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1322 transitions. [2021-06-05 22:06:55,090 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1322 transitions. Word has length 20 [2021-06-05 22:06:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:55,090 INFO L482 AbstractCegarLoop]: Abstraction has 437 states and 1322 transitions. [2021-06-05 22:06:55,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1322 transitions. [2021-06-05 22:06:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:55,091 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:55,091 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:55,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable260 [2021-06-05 22:06:55,291 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -616411988, now seen corresponding path program 12 times [2021-06-05 22:06:55,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:55,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931729961] [2021-06-05 22:06:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:06:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:55,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:06:55,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931729961] [2021-06-05 22:06:55,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931729961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:55,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958481365] [2021-06-05 22:06:55,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:06:55,734 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:06:55,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:06:55,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:06:55,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:06:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:06:56,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958481365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:06:56,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:06:56,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:06:56,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470027965] [2021-06-05 22:06:56,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:06:56,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:06:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:06:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:06:56,227 INFO L87 Difference]: Start difference. First operand 437 states and 1322 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:56,646 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 22:06:56,873 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2021-06-05 22:06:57,002 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2021-06-05 22:06:57,345 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2021-06-05 22:06:57,555 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-06-05 22:06:57,736 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-06-05 22:06:57,958 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-06-05 22:06:58,081 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2021-06-05 22:06:58,302 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2021-06-05 22:06:58,531 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2021-06-05 22:06:58,696 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2021-06-05 22:06:58,988 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2021-06-05 22:06:59,197 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2021-06-05 22:06:59,476 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-06-05 22:06:59,679 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2021-06-05 22:06:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:06:59,727 INFO L93 Difference]: Finished difference Result 768 states and 2264 transitions. [2021-06-05 22:06:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 22:06:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:06:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:06:59,728 INFO L225 Difference]: With dead ends: 768 [2021-06-05 22:06:59,728 INFO L226 Difference]: Without dead ends: 753 [2021-06-05 22:06:59,729 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3764.1ms TimeCoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 22:06:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-06-05 22:06:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 446. [2021-06-05 22:06:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.0314606741573034) internal successors, (1349), 445 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1349 transitions. [2021-06-05 22:06:59,734 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1349 transitions. Word has length 20 [2021-06-05 22:06:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:06:59,735 INFO L482 AbstractCegarLoop]: Abstraction has 446 states and 1349 transitions. [2021-06-05 22:06:59,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:06:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1349 transitions. [2021-06-05 22:06:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:06:59,735 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:06:59,735 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:06:59,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable279 [2021-06-05 22:06:59,936 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:06:59,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:06:59,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1559034530, now seen corresponding path program 13 times [2021-06-05 22:06:59,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:06:59,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945718750] [2021-06-05 22:06:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:06:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:00,263 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:00,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945718750] [2021-06-05 22:07:00,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945718750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:00,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312660036] [2021-06-05 22:07:00,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:00,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 22:07:00,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:00,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312660036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:00,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:00,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:07:00,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766990039] [2021-06-05 22:07:00,907 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:07:00,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:00,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:07:00,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:07:00,907 INFO L87 Difference]: Start difference. First operand 446 states and 1349 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:01,645 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-06-05 22:07:01,861 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-06-05 22:07:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:01,930 INFO L93 Difference]: Finished difference Result 636 states and 1870 transitions. [2021-06-05 22:07:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 22:07:01,930 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:01,931 INFO L225 Difference]: With dead ends: 636 [2021-06-05 22:07:01,931 INFO L226 Difference]: Without dead ends: 621 [2021-06-05 22:07:01,931 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1493.9ms TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:07:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-05 22:07:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 442. [2021-06-05 22:07:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.036281179138322) internal successors, (1339), 441 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1339 transitions. [2021-06-05 22:07:01,936 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1339 transitions. Word has length 20 [2021-06-05 22:07:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:01,936 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1339 transitions. [2021-06-05 22:07:01,936 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1339 transitions. [2021-06-05 22:07:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:01,937 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:01,937 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:02,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 22:07:02,142 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:02,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1464824568, now seen corresponding path program 14 times [2021-06-05 22:07:02,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:02,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855571373] [2021-06-05 22:07:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:02,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:02,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855571373] [2021-06-05 22:07:02,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855571373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:02,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987867833] [2021-06-05 22:07:02,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:02,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:07:02,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:02,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:02,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:03,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987867833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:03,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:03,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:07:03,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491136811] [2021-06-05 22:07:03,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:07:03,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:07:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:07:03,172 INFO L87 Difference]: Start difference. First operand 442 states and 1339 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:03,897 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-06-05 22:07:04,043 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:07:04,350 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2021-06-05 22:07:04,513 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2021-06-05 22:07:04,755 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2021-06-05 22:07:04,995 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2021-06-05 22:07:05,325 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2021-06-05 22:07:05,486 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-06-05 22:07:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:05,528 INFO L93 Difference]: Finished difference Result 699 states and 2057 transitions. [2021-06-05 22:07:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 22:07:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:05,529 INFO L225 Difference]: With dead ends: 699 [2021-06-05 22:07:05,529 INFO L226 Difference]: Without dead ends: 684 [2021-06-05 22:07:05,529 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2672.8ms TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 22:07:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-06-05 22:07:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 436. [2021-06-05 22:07:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 3.0298850574712644) internal successors, (1318), 435 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1318 transitions. [2021-06-05 22:07:05,535 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1318 transitions. Word has length 20 [2021-06-05 22:07:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:05,535 INFO L482 AbstractCegarLoop]: Abstraction has 436 states and 1318 transitions. [2021-06-05 22:07:05,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1318 transitions. [2021-06-05 22:07:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:05,536 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:05,536 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:05,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:05,736 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1005557752, now seen corresponding path program 15 times [2021-06-05 22:07:05,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:05,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299102902] [2021-06-05 22:07:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:06,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:06,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299102902] [2021-06-05 22:07:06,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299102902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:06,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744167094] [2021-06-05 22:07:06,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:06,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:07:06,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:06,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:06,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:06,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744167094] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:06,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:06,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:07:06,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374427299] [2021-06-05 22:07:06,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:07:06,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:07:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:07:06,605 INFO L87 Difference]: Start difference. First operand 436 states and 1318 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:07,370 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2021-06-05 22:07:07,568 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2021-06-05 22:07:07,753 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2021-06-05 22:07:08,030 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2021-06-05 22:07:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:08,101 INFO L93 Difference]: Finished difference Result 557 states and 1658 transitions. [2021-06-05 22:07:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 22:07:08,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:08,102 INFO L225 Difference]: With dead ends: 557 [2021-06-05 22:07:08,102 INFO L226 Difference]: Without dead ends: 542 [2021-06-05 22:07:08,102 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1822.4ms TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2021-06-05 22:07:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-06-05 22:07:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 449. [2021-06-05 22:07:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.0401785714285716) internal successors, (1362), 448 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1362 transitions. [2021-06-05 22:07:08,108 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1362 transitions. Word has length 20 [2021-06-05 22:07:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:08,108 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1362 transitions. [2021-06-05 22:07:08,108 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1362 transitions. [2021-06-05 22:07:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:08,108 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:08,108 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:08,325 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable345 [2021-06-05 22:07:08,325 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash -876815946, now seen corresponding path program 16 times [2021-06-05 22:07:08,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:08,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646378133] [2021-06-05 22:07:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:08,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:08,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646378133] [2021-06-05 22:07:08,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646378133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:08,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210013429] [2021-06-05 22:07:08,664 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:08,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:07:08,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:08,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:08,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:09,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210013429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:09,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:09,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:07:09,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266387251] [2021-06-05 22:07:09,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:07:09,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:09,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:07:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:07:09,187 INFO L87 Difference]: Start difference. First operand 449 states and 1362 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:09,350 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 22:07:09,541 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 22:07:09,960 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-05 22:07:10,671 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2021-06-05 22:07:10,919 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2021-06-05 22:07:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:11,192 INFO L93 Difference]: Finished difference Result 637 states and 1899 transitions. [2021-06-05 22:07:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:07:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:11,193 INFO L225 Difference]: With dead ends: 637 [2021-06-05 22:07:11,193 INFO L226 Difference]: Without dead ends: 622 [2021-06-05 22:07:11,194 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2292.9ms TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 22:07:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2021-06-05 22:07:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 447. [2021-06-05 22:07:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.0381165919282513) internal successors, (1355), 446 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1355 transitions. [2021-06-05 22:07:11,199 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1355 transitions. Word has length 20 [2021-06-05 22:07:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:11,199 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1355 transitions. [2021-06-05 22:07:11,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1355 transitions. [2021-06-05 22:07:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:11,200 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:11,200 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:11,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:11,400 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1982279990, now seen corresponding path program 17 times [2021-06-05 22:07:11,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:11,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410197380] [2021-06-05 22:07:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:11,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:11,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410197380] [2021-06-05 22:07:11,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410197380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:11,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753970372] [2021-06-05 22:07:11,641 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:11,670 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:07:11,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:11,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:11,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:12,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753970372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:12,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:12,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:07:12,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389870680] [2021-06-05 22:07:12,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:07:12,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:07:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:07:12,094 INFO L87 Difference]: Start difference. First operand 447 states and 1355 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:12,579 INFO L93 Difference]: Finished difference Result 571 states and 1708 transitions. [2021-06-05 22:07:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:07:12,580 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:12,580 INFO L225 Difference]: With dead ends: 571 [2021-06-05 22:07:12,580 INFO L226 Difference]: Without dead ends: 556 [2021-06-05 22:07:12,580 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 750.5ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:07:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-06-05 22:07:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 449. [2021-06-05 22:07:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.0401785714285716) internal successors, (1362), 448 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1362 transitions. [2021-06-05 22:07:12,585 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1362 transitions. Word has length 20 [2021-06-05 22:07:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:12,586 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1362 transitions. [2021-06-05 22:07:12,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1362 transitions. [2021-06-05 22:07:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:12,586 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:12,586 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:12,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:12,787 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:12,787 INFO L82 PathProgramCache]: Analyzing trace with hash -714017834, now seen corresponding path program 18 times [2021-06-05 22:07:12,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:12,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287443312] [2021-06-05 22:07:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:13,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:13,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287443312] [2021-06-05 22:07:13,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287443312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:13,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934778783] [2021-06-05 22:07:13,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:13,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:07:13,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:13,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:13,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934778783] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:13,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:13,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:07:13,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140138514] [2021-06-05 22:07:13,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:07:13,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:07:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:07:13,646 INFO L87 Difference]: Start difference. First operand 449 states and 1362 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:14,701 INFO L93 Difference]: Finished difference Result 604 states and 1799 transitions. [2021-06-05 22:07:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 22:07:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:14,702 INFO L225 Difference]: With dead ends: 604 [2021-06-05 22:07:14,702 INFO L226 Difference]: Without dead ends: 589 [2021-06-05 22:07:14,703 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1378.2ms TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2021-06-05 22:07:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-05 22:07:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 445. [2021-06-05 22:07:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.0405405405405403) internal successors, (1350), 444 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1350 transitions. [2021-06-05 22:07:14,708 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1350 transitions. Word has length 20 [2021-06-05 22:07:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:14,708 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1350 transitions. [2021-06-05 22:07:14,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1350 transitions. [2021-06-05 22:07:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:14,709 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:14,709 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:14,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable404 [2021-06-05 22:07:14,909 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash 670139466, now seen corresponding path program 19 times [2021-06-05 22:07:14,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:14,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353833536] [2021-06-05 22:07:14,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:15,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:15,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353833536] [2021-06-05 22:07:15,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353833536] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:15,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350340566] [2021-06-05 22:07:15,068 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:15,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:15,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:16,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,011 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,019 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:16,026 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,033 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,041 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:16,049 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,056 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,061 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:16,067 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:16,074 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,083 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,084 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,091 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:16,098 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,104 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:16,110 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:16,117 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,122 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,128 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,135 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:16,142 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,148 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,155 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,161 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,162 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:16,169 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,176 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,182 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,183 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,187 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,188 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:16,194 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,200 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,201 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,208 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,213 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,214 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:16,220 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,227 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,232 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,233 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,238 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,238 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,243 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,244 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,249 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,249 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,257 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,262 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,262 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,269 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,270 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,276 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,276 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,284 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,290 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,291 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,298 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,304 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,310 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,310 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,317 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,318 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,323 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,324 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:16,335 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,341 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,342 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:16,349 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,357 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,362 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,363 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:16,370 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,375 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,376 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,382 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,383 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,388 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,388 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,396 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,402 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,407 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,408 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,414 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,418 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,420 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,424 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,425 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,430 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,431 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,435 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,436 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,439 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,440 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,446 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,450 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,450 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,454 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,454 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,458 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,459 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,464 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,469 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,470 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,474 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,479 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,480 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:16,489 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,494 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,495 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,499 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,500 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,504 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,505 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:16,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:16,510 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,514 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,515 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,520 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:16,520 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:16,743 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2021-06-05 22:07:16,743 INFO L628 ElimStorePlain]: treesize reduction 257, result has 56.4 percent of original size [2021-06-05 22:07:16,759 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 14 xjuncts. [2021-06-05 22:07:16,759 INFO L247 ElimStorePlain]: Needed 82 recursive calls to eliminate 2 variables, input treesize:3475, output treesize:293 [2021-06-05 22:07:16,923 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-06-05 22:07:17,414 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 22:07:17,725 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-05 22:07:18,093 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 131 [2021-06-05 22:07:18,524 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2021-06-05 22:07:19,374 WARN L205 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 132 [2021-06-05 22:07:20,424 WARN L205 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2021-06-05 22:07:22,072 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-05 22:07:22,375 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 131 [2021-06-05 22:07:23,298 WARN L205 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-05 22:07:23,660 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 132 [2021-06-05 22:07:25,868 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 124 DAG size of output: 128 [2021-06-05 22:07:29,225 WARN L205 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-05 22:07:29,539 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 131 [2021-06-05 22:07:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:29,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350340566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:29,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:29,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 22:07:29,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276050261] [2021-06-05 22:07:29,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 22:07:29,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 22:07:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:07:29,747 INFO L87 Difference]: Start difference. First operand 445 states and 1350 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:30,452 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 108 [2021-06-05 22:07:30,637 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2021-06-05 22:07:30,897 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 136 [2021-06-05 22:07:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:30,948 INFO L93 Difference]: Finished difference Result 646 states and 1918 transitions. [2021-06-05 22:07:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:07:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:30,949 INFO L225 Difference]: With dead ends: 646 [2021-06-05 22:07:30,949 INFO L226 Difference]: Without dead ends: 631 [2021-06-05 22:07:30,949 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1714.4ms TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2021-06-05 22:07:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2021-06-05 22:07:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 443. [2021-06-05 22:07:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0429864253393664) internal successors, (1345), 442 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1345 transitions. [2021-06-05 22:07:30,954 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1345 transitions. Word has length 20 [2021-06-05 22:07:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:30,954 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1345 transitions. [2021-06-05 22:07:30,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1345 transitions. [2021-06-05 22:07:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:30,955 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:30,955 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:31,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable420 [2021-06-05 22:07:31,156 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -365457786, now seen corresponding path program 20 times [2021-06-05 22:07:31,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:31,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773199057] [2021-06-05 22:07:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:31,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:31,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773199057] [2021-06-05 22:07:31,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773199057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:31,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894883276] [2021-06-05 22:07:31,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:31,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:07:31,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:31,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:31,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:34,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:34,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,028 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,044 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,045 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-05 22:07:34,061 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,075 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,076 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,090 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,090 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,105 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,106 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,116 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,117 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2021-06-05 22:07:34,145 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,158 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,159 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-05 22:07:34,174 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:34,188 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,201 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,201 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:34,215 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,229 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,229 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2021-06-05 22:07:34,251 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,264 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,265 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:34,282 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,294 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,296 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-05 22:07:34,327 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,344 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,344 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,358 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,372 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,372 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,386 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,387 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,401 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,416 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,416 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:34,432 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:34,447 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,460 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,461 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,475 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,489 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,490 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,503 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,504 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,519 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,520 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,534 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,534 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,550 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,551 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,562 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,562 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,576 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,577 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-05 22:07:34,592 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,608 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,609 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,640 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,640 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,656 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,657 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,671 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,671 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,686 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,701 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,701 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,715 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,716 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,733 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,734 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2021-06-05 22:07:34,753 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:34,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:34,770 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,781 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,782 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,793 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,793 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,806 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,820 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,821 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,832 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,833 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,847 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,848 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,859 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,860 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,874 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,875 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,886 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,887 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,908 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,908 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,923 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,924 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,939 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,965 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,966 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,982 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:34,994 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:34,995 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,011 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,025 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,026 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,041 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,041 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,053 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,054 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,068 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,069 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,085 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,085 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,100 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,101 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,126 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,126 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,136 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,137 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,146 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,147 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,154 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,155 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,166 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,166 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,174 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,174 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,184 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,184 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,194 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,194 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,204 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,204 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:35,216 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,225 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,226 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,236 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,236 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,246 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,247 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,256 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,256 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,266 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,266 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,276 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,277 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,287 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,297 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,297 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,307 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,307 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,317 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,317 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,326 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,327 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,336 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,337 INFO L550 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:35,347 INFO L550 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,357 INFO L550 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,366 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,367 INFO L550 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,376 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,376 INFO L550 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,385 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,386 INFO L550 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,398 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,399 INFO L550 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:35,410 INFO L550 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,419 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,420 INFO L550 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,429 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,430 INFO L550 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,439 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,440 INFO L550 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,450 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,451 INFO L550 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,458 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,459 INFO L550 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,468 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,469 INFO L550 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:35,483 INFO L550 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,493 INFO L550 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:35,505 INFO L550 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,514 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,515 INFO L550 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,522 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,523 INFO L550 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,532 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,533 INFO L550 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,542 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,542 INFO L550 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,552 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,553 INFO L550 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,562 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,563 INFO L550 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,574 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,575 INFO L550 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,583 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,584 INFO L550 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,590 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,591 INFO L550 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,600 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,601 INFO L550 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,614 INFO L550 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,624 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,625 INFO L550 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,634 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,635 INFO L550 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,644 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,644 INFO L550 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:35,654 INFO L550 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,663 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,664 INFO L550 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,674 INFO L550 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,684 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,685 INFO L550 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,697 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,698 INFO L550 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,706 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,707 INFO L550 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,715 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,716 INFO L550 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:35,739 INFO L550 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,749 INFO L550 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,758 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,758 INFO L550 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,766 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,767 INFO L550 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,774 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,774 INFO L550 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,782 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,783 INFO L550 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,790 INFO L550 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,798 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,799 INFO L550 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,806 INFO L550 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,814 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,815 INFO L550 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,822 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,823 INFO L550 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,831 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,832 INFO L550 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,840 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,841 INFO L550 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,848 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,849 INFO L550 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,857 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,857 INFO L550 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,865 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,865 INFO L550 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,873 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,874 INFO L550 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,881 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,881 INFO L550 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,889 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,889 INFO L550 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,896 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,896 INFO L550 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,904 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,904 INFO L550 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:35,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:35,913 INFO L550 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,921 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,921 INFO L550 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,929 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,930 INFO L550 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,938 INFO L550 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,946 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,946 INFO L550 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,964 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,965 INFO L550 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,973 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,973 INFO L550 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:35,993 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:35,994 INFO L550 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,003 INFO L550 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,011 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,011 INFO L550 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,018 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,019 INFO L550 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,027 INFO L550 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,035 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,036 INFO L550 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,043 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,043 INFO L550 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,050 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,050 INFO L550 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,057 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,057 INFO L550 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,064 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,064 INFO L550 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,072 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,072 INFO L550 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,079 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,080 INFO L550 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,089 INFO L550 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,096 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,097 INFO L550 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,104 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,105 INFO L550 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,112 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,116 INFO L550 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,124 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,125 INFO L550 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,141 INFO L550 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:36,149 INFO L550 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,156 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,157 INFO L550 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,162 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,163 INFO L550 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,169 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,170 INFO L550 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,177 INFO L550 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:36,184 INFO L550 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,190 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,190 INFO L550 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,196 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,197 INFO L550 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,203 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,203 INFO L550 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:36,216 INFO L550 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,225 INFO L550 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:36,232 INFO L550 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,238 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,238 INFO L550 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,244 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,245 INFO L550 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,251 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,251 INFO L550 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,256 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,257 INFO L550 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,262 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,263 INFO L550 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,477 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2021-06-05 22:07:36,477 INFO L628 ElimStorePlain]: treesize reduction 969, result has 21.8 percent of original size [2021-06-05 22:07:36,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:36,482 INFO L550 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:36,486 INFO L550 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:36,490 INFO L550 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:36,494 INFO L550 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,496 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,497 INFO L550 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,499 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:36,500 INFO L550 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:36,504 INFO L550 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:36,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:36,507 INFO L550 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:36,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:07:36,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 22:07:36,557 INFO L247 ElimStorePlain]: Needed 201 recursive calls to eliminate 3 variables, input treesize:11142, output treesize:103 [2021-06-05 22:07:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:36,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894883276] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:36,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:36,720 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 22:07:36,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571629453] [2021-06-05 22:07:36,720 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 22:07:36,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 22:07:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:07:36,720 INFO L87 Difference]: Start difference. First operand 443 states and 1345 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:37,196 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-06-05 22:07:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:37,250 INFO L93 Difference]: Finished difference Result 560 states and 1663 transitions. [2021-06-05 22:07:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:07:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:37,251 INFO L225 Difference]: With dead ends: 560 [2021-06-05 22:07:37,251 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 22:07:37,252 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 846.1ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 22:07:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 22:07:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 440. [2021-06-05 22:07:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0387243735763096) internal successors, (1334), 439 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1334 transitions. [2021-06-05 22:07:37,256 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1334 transitions. Word has length 20 [2021-06-05 22:07:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:37,256 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1334 transitions. [2021-06-05 22:07:37,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1334 transitions. [2021-06-05 22:07:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:37,257 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:37,257 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:37,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1823 [2021-06-05 22:07:37,458 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 20773330, now seen corresponding path program 21 times [2021-06-05 22:07:37,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:37,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838272876] [2021-06-05 22:07:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:37,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:37,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838272876] [2021-06-05 22:07:37,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838272876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:37,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249020305] [2021-06-05 22:07:37,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:37,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 22:07:37,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:37,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:37,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:37,975 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-06-05 22:07:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:38,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249020305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:38,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:38,181 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:07:38,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298414163] [2021-06-05 22:07:38,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:07:38,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:07:38,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:07:38,182 INFO L87 Difference]: Start difference. First operand 440 states and 1334 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:38,784 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-06-05 22:07:39,190 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-06-05 22:07:39,440 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2021-06-05 22:07:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:39,723 INFO L93 Difference]: Finished difference Result 658 states and 1956 transitions. [2021-06-05 22:07:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 22:07:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:39,724 INFO L225 Difference]: With dead ends: 658 [2021-06-05 22:07:39,724 INFO L226 Difference]: Without dead ends: 643 [2021-06-05 22:07:39,724 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1728.8ms TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 22:07:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-05 22:07:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 439. [2021-06-05 22:07:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.0342465753424657) internal successors, (1329), 438 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1329 transitions. [2021-06-05 22:07:39,729 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1329 transitions. Word has length 20 [2021-06-05 22:07:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:39,729 INFO L482 AbstractCegarLoop]: Abstraction has 439 states and 1329 transitions. [2021-06-05 22:07:39,730 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1329 transitions. [2021-06-05 22:07:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:39,730 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:39,730 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:39,946 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2752 [2021-06-05 22:07:39,946 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1121094966, now seen corresponding path program 22 times [2021-06-05 22:07:39,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:39,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976951605] [2021-06-05 22:07:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:40,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:40,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976951605] [2021-06-05 22:07:40,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976951605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:40,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073325586] [2021-06-05 22:07:40,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:40,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:07:40,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:40,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:40,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:40,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073325586] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:40,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:07:40,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:07:40,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910321989] [2021-06-05 22:07:40,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:07:40,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:07:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:07:40,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:07:40,716 INFO L87 Difference]: Start difference. First operand 439 states and 1329 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:07:41,173 INFO L93 Difference]: Finished difference Result 586 states and 1747 transitions. [2021-06-05 22:07:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:07:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:07:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:07:41,174 INFO L225 Difference]: With dead ends: 586 [2021-06-05 22:07:41,174 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 22:07:41,174 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 838.3ms TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:07:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 22:07:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 444. [2021-06-05 22:07:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.0428893905191874) internal successors, (1348), 443 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1348 transitions. [2021-06-05 22:07:41,179 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1348 transitions. Word has length 20 [2021-06-05 22:07:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:07:41,179 INFO L482 AbstractCegarLoop]: Abstraction has 444 states and 1348 transitions. [2021-06-05 22:07:41,179 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:07:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1348 transitions. [2021-06-05 22:07:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:07:41,179 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:07:41,180 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:07:41,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2770,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:41,380 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:07:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:07:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1167101614, now seen corresponding path program 23 times [2021-06-05 22:07:41,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:07:41,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277665204] [2021-06-05 22:07:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:07:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:07:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:07:41,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:07:41,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277665204] [2021-06-05 22:07:41,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277665204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:07:41,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71712645] [2021-06-05 22:07:41,577 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:07:41,607 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:07:41,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:07:41,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:07:41,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:07:43,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,096 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:43,105 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:43,113 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,121 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,131 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:43,139 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:43,146 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:43,153 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,161 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,168 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,176 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:43,182 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,190 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,198 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:43,204 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-05 22:07:43,211 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,219 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,226 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:07:43,234 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,241 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,248 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,255 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,263 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,268 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,269 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:43,275 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,283 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,288 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,288 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,294 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,294 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,300 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,300 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,307 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,313 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,313 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,319 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,327 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,332 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,333 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,338 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,338 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,345 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,351 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,356 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,356 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,362 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,362 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,369 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:07:43,376 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,381 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,382 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,387 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,387 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,392 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,393 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,398 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,398 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,403 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,404 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,412 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,412 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,418 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,419 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,423 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,424 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,429 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,429 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,434 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,435 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,439 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,440 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:43,446 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,450 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,451 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,457 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,458 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,465 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,469 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,470 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,475 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,479 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,479 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,484 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,484 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,489 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,489 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,494 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,499 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,504 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,504 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,508 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,509 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:43,514 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,519 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,519 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,525 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,529 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,529 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,533 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,534 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 22:07:43,538 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,542 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,543 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,548 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,552 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,552 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,559 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:07:43,565 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,569 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,569 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:07:43,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:07:43,574 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,578 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,578 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,582 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:07:43,582 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 22:07:43,861 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-06-05 22:07:43,861 INFO L628 ElimStorePlain]: treesize reduction 296, result has 58.5 percent of original size [2021-06-05 22:07:43,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 14 xjuncts. [2021-06-05 22:07:43,867 INFO L247 ElimStorePlain]: Needed 82 recursive calls to eliminate 2 variables, input treesize:3961, output treesize:377 [2021-06-05 22:07:44,037 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-06-05 22:07:44,272 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 22:07:46,112 WARN L205 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:07:46,414 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-05 22:07:49,030 WARN L205 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 129 DAG size of output: 129 [2021-06-05 22:07:49,582 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 129 [2021-06-05 22:07:54,392 WARN L205 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:07:54,546 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-05 22:08:10,799 WARN L205 SmtUtils]: Spent 15.65 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:11,097 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-05 22:08:16,976 WARN L205 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:17,636 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:18,193 WARN L205 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 124 [2021-06-05 22:08:26,210 WARN L205 SmtUtils]: Spent 7.94 s on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-05 22:08:28,825 WARN L205 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 127 DAG size of output: 129 [2021-06-05 22:08:32,076 WARN L205 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:32,439 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:34,033 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 129 DAG size of output: 129 [2021-06-05 22:08:35,613 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 127 DAG size of output: 131 [2021-06-05 22:08:37,392 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:40,302 WARN L205 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:40,655 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-05 22:08:44,679 WARN L205 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:45,943 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-05 22:08:48,594 WARN L205 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-05 22:08:48,800 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 124 [2021-06-05 22:08:58,595 WARN L205 SmtUtils]: Spent 9.72 s on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-05 22:08:58,914 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 131 [2021-06-05 22:09:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:00,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71712645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:00,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:00,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 22:09:00,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443141018] [2021-06-05 22:09:00,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 22:09:00,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:00,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 22:09:00,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:09:00,277 INFO L87 Difference]: Start difference. First operand 444 states and 1348 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:00,433 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-05 22:09:00,698 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 22:09:01,393 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 139 [2021-06-05 22:09:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:01,589 INFO L93 Difference]: Finished difference Result 590 states and 1765 transitions. [2021-06-05 22:09:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 22:09:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:01,590 INFO L225 Difference]: With dead ends: 590 [2021-06-05 22:09:01,590 INFO L226 Difference]: Without dead ends: 575 [2021-06-05 22:09:01,590 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1624.7ms TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:09:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-06-05 22:09:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 442. [2021-06-05 22:09:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.0408163265306123) internal successors, (1341), 441 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1341 transitions. [2021-06-05 22:09:01,595 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1341 transitions. Word has length 20 [2021-06-05 22:09:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:01,595 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1341 transitions. [2021-06-05 22:09:01,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1341 transitions. [2021-06-05 22:09:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:01,596 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:01,596 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:01,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2788 [2021-06-05 22:09:01,801 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 30969814, now seen corresponding path program 24 times [2021-06-05 22:09:01,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:01,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170221713] [2021-06-05 22:09:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:02,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:02,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170221713] [2021-06-05 22:09:02,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170221713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:02,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118404948] [2021-06-05 22:09:02,092 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:02,123 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:09:02,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:09:02,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:02,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:02,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118404948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:02,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:02,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:09:02,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509554546] [2021-06-05 22:09:02,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:09:02,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:09:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:09:02,589 INFO L87 Difference]: Start difference. First operand 442 states and 1341 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:03,160 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2021-06-05 22:09:03,586 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 22:09:03,736 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-06-05 22:09:04,060 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 22:09:04,179 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 22:09:04,492 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 22:09:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:04,613 INFO L93 Difference]: Finished difference Result 716 states and 2128 transitions. [2021-06-05 22:09:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 22:09:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:04,614 INFO L225 Difference]: With dead ends: 716 [2021-06-05 22:09:04,614 INFO L226 Difference]: Without dead ends: 701 [2021-06-05 22:09:04,614 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2233.1ms TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 22:09:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-06-05 22:09:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 440. [2021-06-05 22:09:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0387243735763096) internal successors, (1334), 439 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1334 transitions. [2021-06-05 22:09:04,619 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1334 transitions. Word has length 20 [2021-06-05 22:09:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:04,620 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1334 transitions. [2021-06-05 22:09:04,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1334 transitions. [2021-06-05 22:09:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:04,620 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:04,620 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:04,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3972,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:04,821 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1850936306, now seen corresponding path program 25 times [2021-06-05 22:09:04,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:04,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635114410] [2021-06-05 22:09:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:05,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:05,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635114410] [2021-06-05 22:09:05,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635114410] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:05,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014669049] [2021-06-05 22:09:05,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:05,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:05,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:05,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014669049] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:05,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:05,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:09:05,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844478740] [2021-06-05 22:09:05,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:09:05,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:09:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:09:05,519 INFO L87 Difference]: Start difference. First operand 440 states and 1334 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:06,462 INFO L93 Difference]: Finished difference Result 596 states and 1780 transitions. [2021-06-05 22:09:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 22:09:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:06,463 INFO L225 Difference]: With dead ends: 596 [2021-06-05 22:09:06,463 INFO L226 Difference]: Without dead ends: 581 [2021-06-05 22:09:06,463 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1159.5ms TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:09:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-06-05 22:09:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 438. [2021-06-05 22:09:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.0320366132723113) internal successors, (1325), 437 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1325 transitions. [2021-06-05 22:09:06,468 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1325 transitions. Word has length 20 [2021-06-05 22:09:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:06,468 INFO L482 AbstractCegarLoop]: Abstraction has 438 states and 1325 transitions. [2021-06-05 22:09:06,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1325 transitions. [2021-06-05 22:09:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:06,469 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:06,469 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:06,669 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3991 [2021-06-05 22:09:06,669 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -756638044, now seen corresponding path program 26 times [2021-06-05 22:09:06,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:06,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433719588] [2021-06-05 22:09:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:06,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:06,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433719588] [2021-06-05 22:09:06,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433719588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:06,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189121947] [2021-06-05 22:09:06,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:06,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:09:06,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:09:06,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:06,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:07,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189121947] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:07,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:07,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:09:07,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581736414] [2021-06-05 22:09:07,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:09:07,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:07,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:09:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:09:07,287 INFO L87 Difference]: Start difference. First operand 438 states and 1325 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:07,883 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-06-05 22:09:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:07,910 INFO L93 Difference]: Finished difference Result 707 states and 2097 transitions. [2021-06-05 22:09:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 22:09:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:07,913 INFO L225 Difference]: With dead ends: 707 [2021-06-05 22:09:07,913 INFO L226 Difference]: Without dead ends: 692 [2021-06-05 22:09:07,914 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 845.5ms TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:09:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-06-05 22:09:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 437. [2021-06-05 22:09:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.029816513761468) internal successors, (1321), 436 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1321 transitions. [2021-06-05 22:09:07,919 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1321 transitions. Word has length 20 [2021-06-05 22:09:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:07,919 INFO L482 AbstractCegarLoop]: Abstraction has 437 states and 1321 transitions. [2021-06-05 22:09:07,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1321 transitions. [2021-06-05 22:09:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:07,920 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:07,920 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:08,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4007,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:08,121 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 629398172, now seen corresponding path program 27 times [2021-06-05 22:09:08,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:08,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74699251] [2021-06-05 22:09:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:08,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:08,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74699251] [2021-06-05 22:09:08,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74699251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:08,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558255261] [2021-06-05 22:09:08,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:08,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:09:08,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:09:08,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:08,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:08,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558255261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:08,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:08,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:09:08,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914744422] [2021-06-05 22:09:08,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:09:08,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:08,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:09:08,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:09:08,909 INFO L87 Difference]: Start difference. First operand 437 states and 1321 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:09,223 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2021-06-05 22:09:09,383 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-06-05 22:09:09,796 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2021-06-05 22:09:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:10,031 INFO L93 Difference]: Finished difference Result 540 states and 1606 transitions. [2021-06-05 22:09:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 22:09:10,032 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:10,032 INFO L225 Difference]: With dead ends: 540 [2021-06-05 22:09:10,032 INFO L226 Difference]: Without dead ends: 525 [2021-06-05 22:09:10,033 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1382.0ms TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:09:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-05 22:09:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 443. [2021-06-05 22:09:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0316742081447963) internal successors, (1340), 442 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1340 transitions. [2021-06-05 22:09:10,038 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1340 transitions. Word has length 20 [2021-06-05 22:09:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:10,038 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1340 transitions. [2021-06-05 22:09:10,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1340 transitions. [2021-06-05 22:09:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:10,038 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:10,038 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:10,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4030 [2021-06-05 22:09:10,239 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1252975526, now seen corresponding path program 28 times [2021-06-05 22:09:10,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:10,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251489806] [2021-06-05 22:09:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:10,519 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:10,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251489806] [2021-06-05 22:09:10,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251489806] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:10,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565697860] [2021-06-05 22:09:10,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:10,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:09:10,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:09:10,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:10,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:10,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565697860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:10,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:10,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:09:10,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998127645] [2021-06-05 22:09:10,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:09:10,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:09:10,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:09:10,975 INFO L87 Difference]: Start difference. First operand 443 states and 1340 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:12,036 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2021-06-05 22:09:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:12,767 INFO L93 Difference]: Finished difference Result 654 states and 1937 transitions. [2021-06-05 22:09:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 22:09:12,767 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:12,768 INFO L225 Difference]: With dead ends: 654 [2021-06-05 22:09:12,768 INFO L226 Difference]: Without dead ends: 624 [2021-06-05 22:09:12,768 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2040.4ms TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 22:09:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-06-05 22:09:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 441. [2021-06-05 22:09:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 3.0295454545454548) internal successors, (1333), 440 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1333 transitions. [2021-06-05 22:09:12,773 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1333 transitions. Word has length 20 [2021-06-05 22:09:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:12,773 INFO L482 AbstractCegarLoop]: Abstraction has 441 states and 1333 transitions. [2021-06-05 22:09:12,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1333 transitions. [2021-06-05 22:09:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:12,774 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:12,774 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:12,974 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4047,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:12,975 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1606120410, now seen corresponding path program 29 times [2021-06-05 22:09:12,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:12,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451181419] [2021-06-05 22:09:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:13,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:13,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451181419] [2021-06-05 22:09:13,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451181419] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:13,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307940193] [2021-06-05 22:09:13,205 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:13,239 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:09:13,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:09:13,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:13,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:13,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,693 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,700 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2021-06-05 22:09:13,708 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,715 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,722 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:09:13,730 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,737 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,744 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:09:13,751 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,759 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,766 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,772 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:09:13,773 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,780 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:09:13,787 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,794 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,801 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,809 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,816 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,823 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,848 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,848 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,855 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:09:13,863 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,870 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:09:13,876 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,883 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 22:09:13,889 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,895 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,895 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,903 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,909 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,909 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,914 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,915 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,922 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,928 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,934 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,934 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,939 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,939 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,945 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:13,946 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,953 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:09:13,960 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,969 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:13,977 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,984 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,991 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:13,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:13,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:13,997 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,002 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,002 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-05 22:09:14,009 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:14,015 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-06-05 22:09:14,021 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,027 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:14,033 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,043 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,044 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,050 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,050 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:14,057 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,062 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,063 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:14,069 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,074 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,075 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,080 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,081 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,086 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,086 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,091 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,091 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,096 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,096 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,101 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,102 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,107 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,107 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,112 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,112 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,117 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,122 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:09:14,129 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:14,134 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,138 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,138 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,142 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,143 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,154 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,154 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,158 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,159 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,162 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,163 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,166 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,167 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,171 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:09:14,177 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,180 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,181 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,184 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,185 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2021-06-05 22:09:14,190 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,193 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,194 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,197 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,198 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2021-06-05 22:09:14,203 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,207 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,207 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,211 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,214 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,215 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,218 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,219 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,222 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,223 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,226 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,226 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,229 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,230 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,233 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,233 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,236 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:09:14,237 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:09:14,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-05 22:09:14,241 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 22:09:14,463 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2021-06-05 22:09:14,463 INFO L628 ElimStorePlain]: treesize reduction 79, result has 82.6 percent of original size [2021-06-05 22:09:14,469 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 14 xjuncts. [2021-06-05 22:09:14,469 INFO L247 ElimStorePlain]: Needed 91 recursive calls to eliminate 2 variables, input treesize:3899, output treesize:335 [2021-06-05 22:09:14,612 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 22:09:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:18,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307940193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:18,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:09:18,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 22:09:18,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983993646] [2021-06-05 22:09:18,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 22:09:18,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:09:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 22:09:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:09:18,831 INFO L87 Difference]: Start difference. First operand 441 states and 1333 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:19,450 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 127 [2021-06-05 22:09:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:09:19,623 INFO L93 Difference]: Finished difference Result 540 states and 1617 transitions. [2021-06-05 22:09:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:09:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:09:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:09:19,624 INFO L225 Difference]: With dead ends: 540 [2021-06-05 22:09:19,624 INFO L226 Difference]: Without dead ends: 525 [2021-06-05 22:09:19,624 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1137.5ms TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-06-05 22:09:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-05 22:09:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 443. [2021-06-05 22:09:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0316742081447963) internal successors, (1340), 442 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1340 transitions. [2021-06-05 22:09:19,630 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1340 transitions. Word has length 20 [2021-06-05 22:09:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:09:19,630 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1340 transitions. [2021-06-05 22:09:19,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:09:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1340 transitions. [2021-06-05 22:09:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:09:19,631 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:09:19,631 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:09:19,831 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4065 [2021-06-05 22:09:19,831 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:09:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:09:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1090177414, now seen corresponding path program 30 times [2021-06-05 22:09:19,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:09:19,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025475915] [2021-06-05 22:09:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:09:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:09:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:09:20,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:09:20,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025475915] [2021-06-05 22:09:20,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025475915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:09:20,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234930424] [2021-06-05 22:09:20,105 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:09:20,150 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:09:20,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:09:20,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 22:09:20,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:09:20,501 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-05 22:09:20,955 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 97 [2021-06-05 22:09:21,959 WARN L205 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 163 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown