/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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 14:43:26,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 14:43:26,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 14:43:26,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 14:43:26,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 14:43:26,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 14:43:26,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 14:43:26,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 14:43:26,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 14:43:26,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 14:43:26,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 14:43:26,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 14:43:26,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 14:43:26,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 14:43:26,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 14:43:26,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 14:43:26,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 14:43:26,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 14:43:26,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 14:43:26,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 14:43:26,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 14:43:26,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 14:43:26,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 14:43:26,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 14:43:26,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 14:43:26,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 14:43:26,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 14:43:26,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 14:43:26,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 14:43:26,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 14:43:26,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 14:43:26,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 14:43:26,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 14:43:26,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 14:43:26,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 14:43:26,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 14:43:26,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 14:43:26,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 14:43:26,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 14:43:26,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 14:43:26,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 14:43:26,324 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-Separate.epf [2021-06-05 14:43:26,361 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 14:43:26,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 14:43:26,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 14:43:26,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 14:43:26,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 14:43:26,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 14:43:26,363 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 14:43:26,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 14:43:26,363 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 14:43:26,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 14:43:26,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 14:43:26,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 14:43:26,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 14:43:26,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 14:43:26,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 14:43:26,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 14:43:26,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 14:43:26,366 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 14:43:26,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 14:43:26,366 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 14:43:26,366 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 14:43:26,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 14:43:26,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 14:43:26,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 14:43:26,669 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 14:43:26,672 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 14:43:26,673 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-trans.wvr.bpl [2021-06-05 14:43:26,673 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-trans.wvr.bpl' [2021-06-05 14:43:26,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 14:43:26,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 14:43:26,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 14:43:26,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 14:43:26,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 14:43:26,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 14:43:26,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 14:43:26,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 14:43:26,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 14:43:26,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/1) ... [2021-06-05 14:43:26,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 14:43:26,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 14:43:26,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 14:43:26,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 14:43:26,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (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 14:43:26,876 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 14:43:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 14:43:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 14:43:26,876 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 14:43:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 14:43:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 14:43:26,877 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 14:43:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 14:43:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 14:43:26,877 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 14:43:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 14:43:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 14:43:26,878 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 14:43:27,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 14:43:27,725 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-05 14:43:27,727 INFO L202 PluginConnector]: Adding new model poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 02:43:27 BoogieIcfgContainer [2021-06-05 14:43:27,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 14:43:27,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 14:43:27,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 14:43:27,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 14:43:27,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:43:26" (1/2) ... [2021-06-05 14:43:27,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b424499 and model type poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 02:43:27, skipping insertion in model container [2021-06-05 14:43:27,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 02:43:27" (2/2) ... [2021-06-05 14:43:27,733 INFO L111 eAbstractionObserver]: Analyzing ICFG poker-hand-trans.wvr.bpl [2021-06-05 14:43:27,738 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 14:43:27,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 14:43:27,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 14:43:27,739 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 14:43:27,766 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 14:43:27,785 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 14:43:27,801 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 14:43:27,801 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 14:43:27,801 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 14:43:27,801 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 14:43:27,802 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 14:43:27,802 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 14:43:27,802 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 14:43:27,802 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 14:43:27,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 37 transitions, 98 flow [2021-06-05 14:43:27,829 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 14:43:27,832 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 14:43:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:43:27,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:27,841 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:27,842 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1233644461, now seen corresponding path program 1 times [2021-06-05 14:43:27,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:27,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812985489] [2021-06-05 14:43:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:28,366 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 14:43:28,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:28,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812985489] [2021-06-05 14:43:28,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812985489] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:28,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:28,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:28,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556028300] [2021-06-05 14:43:28,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:28,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:28,392 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 14:43:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:28,801 INFO L93 Difference]: Finished difference Result 319 states and 1217 transitions. [2021-06-05 14:43:28,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:28,803 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 14:43:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:28,825 INFO L225 Difference]: With dead ends: 319 [2021-06-05 14:43:28,825 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 14:43:28,827 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 424.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 14:43:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 201. [2021-06-05 14:43:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 4.41) internal successors, (882), 200 states have internal predecessors, (882), 0 states have call successors, (0), 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 14:43:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 882 transitions. [2021-06-05 14:43:28,926 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 882 transitions. Word has length 14 [2021-06-05 14:43:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:28,927 INFO L482 AbstractCegarLoop]: Abstraction has 201 states and 882 transitions. [2021-06-05 14:43:28,927 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 14:43:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 882 transitions. [2021-06-05 14:43:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:43:28,930 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:28,930 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:28,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 14:43:28,930 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:28,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2024028845, now seen corresponding path program 2 times [2021-06-05 14:43:28,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:28,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453568572] [2021-06-05 14:43:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:29,222 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2021-06-05 14:43:29,430 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-06-05 14:43:29,453 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 14:43:29,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:29,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453568572] [2021-06-05 14:43:29,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453568572] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:29,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:29,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:29,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220624806] [2021-06-05 14:43:29,455 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:29,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:29,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:29,456 INFO L87 Difference]: Start difference. First operand 201 states and 882 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 14:43:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:29,778 INFO L93 Difference]: Finished difference Result 346 states and 1298 transitions. [2021-06-05 14:43:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:29,779 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 14:43:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:29,782 INFO L225 Difference]: With dead ends: 346 [2021-06-05 14:43:29,782 INFO L226 Difference]: Without dead ends: 331 [2021-06-05 14:43:29,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 437.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-06-05 14:43:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 212. [2021-06-05 14:43:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 4.322274881516588) internal successors, (912), 211 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:43:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 912 transitions. [2021-06-05 14:43:29,812 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 912 transitions. Word has length 14 [2021-06-05 14:43:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:29,813 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 912 transitions. [2021-06-05 14:43:29,813 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 14:43:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 912 transitions. [2021-06-05 14:43:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:43:29,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:29,815 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:29,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 14:43:29,815 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1840634711, now seen corresponding path program 3 times [2021-06-05 14:43:29,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:29,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494640319] [2021-06-05 14:43:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:30,125 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 14:43:30,125 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:30,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494640319] [2021-06-05 14:43:30,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494640319] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:30,126 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:30,126 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:30,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112822308] [2021-06-05 14:43:30,126 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:30,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:30,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:30,127 INFO L87 Difference]: Start difference. First operand 212 states and 912 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 14:43:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:30,397 INFO L93 Difference]: Finished difference Result 378 states and 1427 transitions. [2021-06-05 14:43:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:30,398 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 14:43:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:30,401 INFO L225 Difference]: With dead ends: 378 [2021-06-05 14:43:30,401 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 14:43:30,402 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 303.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 14:43:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 219. [2021-06-05 14:43:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 4.330275229357798) internal successors, (944), 218 states have internal predecessors, (944), 0 states have call successors, (0), 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 14:43:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 944 transitions. [2021-06-05 14:43:30,414 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 944 transitions. Word has length 14 [2021-06-05 14:43:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:30,414 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 944 transitions. [2021-06-05 14:43:30,414 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 14:43:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 944 transitions. [2021-06-05 14:43:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:43:30,416 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:30,416 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:30,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 14:43:30,417 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash -867555397, now seen corresponding path program 4 times [2021-06-05 14:43:30,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:30,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170995199] [2021-06-05 14:43:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:30,664 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 14:43:30,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:30,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170995199] [2021-06-05 14:43:30,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170995199] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:30,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:30,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:30,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909652279] [2021-06-05 14:43:30,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:30,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:30,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:30,666 INFO L87 Difference]: Start difference. First operand 219 states and 944 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 14:43:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:30,940 INFO L93 Difference]: Finished difference Result 369 states and 1403 transitions. [2021-06-05 14:43:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:30,940 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 14:43:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:30,942 INFO L225 Difference]: With dead ends: 369 [2021-06-05 14:43:30,942 INFO L226 Difference]: Without dead ends: 354 [2021-06-05 14:43:30,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 300.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-06-05 14:43:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 231. [2021-06-05 14:43:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 4.243478260869566) internal successors, (976), 230 states have internal predecessors, (976), 0 states have call successors, (0), 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 14:43:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 976 transitions. [2021-06-05 14:43:30,952 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 976 transitions. Word has length 14 [2021-06-05 14:43:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:30,952 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 976 transitions. [2021-06-05 14:43:30,952 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 14:43:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 976 transitions. [2021-06-05 14:43:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:43:30,954 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:30,954 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:30,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 14:43:30,954 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash 922889575, now seen corresponding path program 5 times [2021-06-05 14:43:30,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:30,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628507961] [2021-06-05 14:43:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:31,186 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 14:43:31,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:31,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628507961] [2021-06-05 14:43:31,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628507961] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:31,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:31,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:31,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960573654] [2021-06-05 14:43:31,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:31,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:31,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:31,189 INFO L87 Difference]: Start difference. First operand 231 states and 976 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 14:43:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:31,523 INFO L93 Difference]: Finished difference Result 348 states and 1312 transitions. [2021-06-05 14:43:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:31,523 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 14:43:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:31,526 INFO L225 Difference]: With dead ends: 348 [2021-06-05 14:43:31,526 INFO L226 Difference]: Without dead ends: 333 [2021-06-05 14:43:31,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 327.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-06-05 14:43:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2021-06-05 14:43:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 4.262931034482759) internal successors, (989), 232 states have internal predecessors, (989), 0 states have call successors, (0), 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 14:43:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 989 transitions. [2021-06-05 14:43:31,535 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 989 transitions. Word has length 14 [2021-06-05 14:43:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:31,535 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 989 transitions. [2021-06-05 14:43:31,535 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 14:43:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 989 transitions. [2021-06-05 14:43:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:43:31,536 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:31,536 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:31,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 14:43:31,537 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 594755113, now seen corresponding path program 6 times [2021-06-05 14:43:31,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:31,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566751744] [2021-06-05 14:43:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:31,863 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2021-06-05 14:43:31,895 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 14:43:31,896 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:31,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566751744] [2021-06-05 14:43:31,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566751744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:31,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:31,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:31,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443258071] [2021-06-05 14:43:31,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:31,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:31,898 INFO L87 Difference]: Start difference. First operand 233 states and 989 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 14:43:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,188 INFO L93 Difference]: Finished difference Result 358 states and 1349 transitions. [2021-06-05 14:43:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:32,189 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 14:43:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,191 INFO L225 Difference]: With dead ends: 358 [2021-06-05 14:43:32,191 INFO L226 Difference]: Without dead ends: 343 [2021-06-05 14:43:32,192 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 420.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-06-05 14:43:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 233. [2021-06-05 14:43:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 4.262931034482759) internal successors, (989), 232 states have internal predecessors, (989), 0 states have call successors, (0), 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 14:43:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 989 transitions. [2021-06-05 14:43:32,200 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 989 transitions. Word has length 14 [2021-06-05 14:43:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,217 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 989 transitions. [2021-06-05 14:43:32,218 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 14:43:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 989 transitions. [2021-06-05 14:43:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:43:32,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,219 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 14:43:32,219 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1067380313, now seen corresponding path program 1 times [2021-06-05 14:43:32,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917044904] [2021-06-05 14:43:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,251 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 14:43:32,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917044904] [2021-06-05 14:43:32,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917044904] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 14:43:32,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433458781] [2021-06-05 14:43:32,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 14:43:32,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 14:43:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,253 INFO L87 Difference]: Start difference. First operand 233 states and 989 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 14:43:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,259 INFO L93 Difference]: Finished difference Result 268 states and 1130 transitions. [2021-06-05 14:43:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:43:32,262 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 14:43:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,264 INFO L225 Difference]: With dead ends: 268 [2021-06-05 14:43:32,264 INFO L226 Difference]: Without dead ends: 268 [2021-06-05 14:43:32,264 INFO L777 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 14:43:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-06-05 14:43:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2021-06-05 14:43:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 4.2796934865900385) internal successors, (1117), 261 states have internal predecessors, (1117), 0 states have call successors, (0), 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 14:43:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 1117 transitions. [2021-06-05 14:43:32,273 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 1117 transitions. Word has length 15 [2021-06-05 14:43:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,273 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 1117 transitions. [2021-06-05 14:43:32,273 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 14:43:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 1117 transitions. [2021-06-05 14:43:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:43:32,274 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,274 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 14:43:32,274 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1654834201, now seen corresponding path program 1 times [2021-06-05 14:43:32,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177350536] [2021-06-05 14:43:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,294 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 14:43:32,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177350536] [2021-06-05 14:43:32,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177350536] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 14:43:32,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700068901] [2021-06-05 14:43:32,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 14:43:32,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 14:43:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,296 INFO L87 Difference]: Start difference. First operand 262 states and 1117 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 14:43:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,304 INFO L93 Difference]: Finished difference Result 297 states and 1258 transitions. [2021-06-05 14:43:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:43:32,305 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 14:43:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,308 INFO L225 Difference]: With dead ends: 297 [2021-06-05 14:43:32,308 INFO L226 Difference]: Without dead ends: 297 [2021-06-05 14:43:32,309 INFO L777 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 14:43:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-06-05 14:43:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-06-05 14:43:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 4.25) internal successors, (1258), 296 states have internal predecessors, (1258), 0 states have call successors, (0), 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 14:43:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 1258 transitions. [2021-06-05 14:43:32,319 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 1258 transitions. Word has length 15 [2021-06-05 14:43:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,319 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 1258 transitions. [2021-06-05 14:43:32,320 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 14:43:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 1258 transitions. [2021-06-05 14:43:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:43:32,321 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,321 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,321 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 14:43:32,321 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2109293491, now seen corresponding path program 1 times [2021-06-05 14:43:32,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221777694] [2021-06-05 14:43:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,346 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 14:43:32,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221777694] [2021-06-05 14:43:32,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221777694] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 14:43:32,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667791846] [2021-06-05 14:43:32,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 14:43:32,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 14:43:32,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,348 INFO L87 Difference]: Start difference. First operand 297 states and 1258 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 14:43:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,355 INFO L93 Difference]: Finished difference Result 340 states and 1425 transitions. [2021-06-05 14:43:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:43:32,356 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 14:43:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,358 INFO L225 Difference]: With dead ends: 340 [2021-06-05 14:43:32,358 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 14:43:32,358 INFO L777 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 14:43:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 14:43:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2021-06-05 14:43:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 4.2298507462686565) internal successors, (1417), 335 states have internal predecessors, (1417), 0 states have call successors, (0), 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 14:43:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1417 transitions. [2021-06-05 14:43:32,375 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1417 transitions. Word has length 15 [2021-06-05 14:43:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,375 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 1417 transitions. [2021-06-05 14:43:32,375 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 14:43:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1417 transitions. [2021-06-05 14:43:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:43:32,376 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,376 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 14:43:32,377 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1748926659, now seen corresponding path program 1 times [2021-06-05 14:43:32,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011794524] [2021-06-05 14:43:32,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,393 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 14:43:32,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011794524] [2021-06-05 14:43:32,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011794524] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 14:43:32,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026662629] [2021-06-05 14:43:32,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 14:43:32,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 14:43:32,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,398 INFO L87 Difference]: Start difference. First operand 336 states and 1417 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 14:43:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,404 INFO L93 Difference]: Finished difference Result 386 states and 1608 transitions. [2021-06-05 14:43:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:43:32,405 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 14:43:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,407 INFO L225 Difference]: With dead ends: 386 [2021-06-05 14:43:32,407 INFO L226 Difference]: Without dead ends: 386 [2021-06-05 14:43:32,408 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-05 14:43:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-06-05 14:43:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 4.176623376623376) internal successors, (1608), 385 states have internal predecessors, (1608), 0 states have call successors, (0), 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 14:43:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1608 transitions. [2021-06-05 14:43:32,421 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1608 transitions. Word has length 15 [2021-06-05 14:43:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,421 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1608 transitions. [2021-06-05 14:43:32,422 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 14:43:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1608 transitions. [2021-06-05 14:43:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:43:32,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,423 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 14:43:32,424 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash 181705837, now seen corresponding path program 1 times [2021-06-05 14:43:32,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711053161] [2021-06-05 14:43:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,440 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 14:43:32,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711053161] [2021-06-05 14:43:32,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711053161] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,441 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 14:43:32,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718390364] [2021-06-05 14:43:32,441 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 14:43:32,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 14:43:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,442 INFO L87 Difference]: Start difference. First operand 386 states and 1608 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 14:43:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,449 INFO L93 Difference]: Finished difference Result 436 states and 1799 transitions. [2021-06-05 14:43:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:43:32,449 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 14:43:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,452 INFO L225 Difference]: With dead ends: 436 [2021-06-05 14:43:32,452 INFO L226 Difference]: Without dead ends: 436 [2021-06-05 14:43:32,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-06-05 14:43:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2021-06-05 14:43:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 4.135632183908046) internal successors, (1799), 435 states have internal predecessors, (1799), 0 states have call successors, (0), 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 14:43:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1799 transitions. [2021-06-05 14:43:32,465 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1799 transitions. Word has length 15 [2021-06-05 14:43:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,466 INFO L482 AbstractCegarLoop]: Abstraction has 436 states and 1799 transitions. [2021-06-05 14:43:32,467 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 14:43:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1799 transitions. [2021-06-05 14:43:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:43:32,468 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,468 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 14:43:32,468 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash 542072669, now seen corresponding path program 1 times [2021-06-05 14:43:32,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342543969] [2021-06-05 14:43:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,483 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 14:43:32,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342543969] [2021-06-05 14:43:32,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342543969] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 14:43:32,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110494940] [2021-06-05 14:43:32,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 14:43:32,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 14:43:32,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 14:43:32,485 INFO L87 Difference]: Start difference. First operand 436 states and 1799 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 14:43:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,492 INFO L93 Difference]: Finished difference Result 493 states and 2014 transitions. [2021-06-05 14:43:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:43:32,492 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 14:43:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,495 INFO L225 Difference]: With dead ends: 493 [2021-06-05 14:43:32,495 INFO L226 Difference]: Without dead ends: 493 [2021-06-05 14:43:32,496 INFO L777 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 14:43:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-06-05 14:43:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2021-06-05 14:43:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 4.09349593495935) internal successors, (2014), 492 states have internal predecessors, (2014), 0 states have call successors, (0), 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 14:43:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 2014 transitions. [2021-06-05 14:43:32,513 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 2014 transitions. Word has length 15 [2021-06-05 14:43:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,513 INFO L482 AbstractCegarLoop]: Abstraction has 493 states and 2014 transitions. [2021-06-05 14:43:32,513 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 14:43:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 2014 transitions. [2021-06-05 14:43:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:32,515 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,515 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 14:43:32,515 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash -85243986, now seen corresponding path program 1 times [2021-06-05 14:43:32,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73517609] [2021-06-05 14:43:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,555 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 14:43:32,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73517609] [2021-06-05 14:43:32,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73517609] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:32,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19425338] [2021-06-05 14:43:32,558 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:32,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:32,559 INFO L87 Difference]: Start difference. First operand 493 states and 2014 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 14:43:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,654 INFO L93 Difference]: Finished difference Result 725 states and 2618 transitions. [2021-06-05 14:43:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:32,654 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 14:43:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,659 INFO L225 Difference]: With dead ends: 725 [2021-06-05 14:43:32,659 INFO L226 Difference]: Without dead ends: 698 [2021-06-05 14:43:32,659 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-06-05 14:43:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 544. [2021-06-05 14:43:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.955801104972376) internal successors, (2148), 543 states have internal predecessors, (2148), 0 states have call successors, (0), 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 14:43:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 2148 transitions. [2021-06-05 14:43:32,677 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 2148 transitions. Word has length 16 [2021-06-05 14:43:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,677 INFO L482 AbstractCegarLoop]: Abstraction has 544 states and 2148 transitions. [2021-06-05 14:43:32,677 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 14:43:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 2148 transitions. [2021-06-05 14:43:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:32,681 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,681 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 14:43:32,681 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 705140398, now seen corresponding path program 2 times [2021-06-05 14:43:32,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889363672] [2021-06-05 14:43:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,722 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 14:43:32,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889363672] [2021-06-05 14:43:32,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889363672] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:32,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493837263] [2021-06-05 14:43:32,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:32,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:32,726 INFO L87 Difference]: Start difference. First operand 544 states and 2148 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 14:43:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:32,819 INFO L93 Difference]: Finished difference Result 779 states and 2777 transitions. [2021-06-05 14:43:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:32,819 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 14:43:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:32,823 INFO L225 Difference]: With dead ends: 779 [2021-06-05 14:43:32,823 INFO L226 Difference]: Without dead ends: 752 [2021-06-05 14:43:32,824 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-06-05 14:43:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 565. [2021-06-05 14:43:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.904255319148936) internal successors, (2202), 564 states have internal predecessors, (2202), 0 states have call successors, (0), 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 14:43:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 2202 transitions. [2021-06-05 14:43:32,846 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 2202 transitions. Word has length 16 [2021-06-05 14:43:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:32,846 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 2202 transitions. [2021-06-05 14:43:32,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 14:43:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 2202 transitions. [2021-06-05 14:43:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:32,848 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:32,848 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:32,848 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 14:43:32,848 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1662493965, now seen corresponding path program 1 times [2021-06-05 14:43:32,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:32,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976757624] [2021-06-05 14:43:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:32,943 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 14:43:32,943 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:32,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976757624] [2021-06-05 14:43:32,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976757624] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:32,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:32,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:32,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853489948] [2021-06-05 14:43:32,945 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:32,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:32,946 INFO L87 Difference]: Start difference. First operand 565 states and 2202 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 14:43:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:33,211 INFO L93 Difference]: Finished difference Result 793 states and 2784 transitions. [2021-06-05 14:43:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:33,212 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 14:43:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:33,216 INFO L225 Difference]: With dead ends: 793 [2021-06-05 14:43:33,216 INFO L226 Difference]: Without dead ends: 766 [2021-06-05 14:43:33,216 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 208.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-06-05 14:43:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 612. [2021-06-05 14:43:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.7872340425531914) internal successors, (2314), 611 states have internal predecessors, (2314), 0 states have call successors, (0), 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 14:43:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 2314 transitions. [2021-06-05 14:43:33,237 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 2314 transitions. Word has length 16 [2021-06-05 14:43:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:33,237 INFO L482 AbstractCegarLoop]: Abstraction has 612 states and 2314 transitions. [2021-06-05 14:43:33,237 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 14:43:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 2314 transitions. [2021-06-05 14:43:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:33,239 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:33,239 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:33,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 14:43:33,239 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:33,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1842088947, now seen corresponding path program 2 times [2021-06-05 14:43:33,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:33,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752246840] [2021-06-05 14:43:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:33,313 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 14:43:33,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:33,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752246840] [2021-06-05 14:43:33,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752246840] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:33,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:33,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:33,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830453730] [2021-06-05 14:43:33,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:33,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:33,315 INFO L87 Difference]: Start difference. First operand 612 states and 2314 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 14:43:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:33,594 INFO L93 Difference]: Finished difference Result 847 states and 2943 transitions. [2021-06-05 14:43:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:33,595 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 14:43:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:33,599 INFO L225 Difference]: With dead ends: 847 [2021-06-05 14:43:33,599 INFO L226 Difference]: Without dead ends: 820 [2021-06-05 14:43:33,600 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 209.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-06-05 14:43:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 633. [2021-06-05 14:43:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 3.7468354430379747) internal successors, (2368), 632 states have internal predecessors, (2368), 0 states have call successors, (0), 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 14:43:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 2368 transitions. [2021-06-05 14:43:33,620 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 2368 transitions. Word has length 16 [2021-06-05 14:43:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:33,620 INFO L482 AbstractCegarLoop]: Abstraction has 633 states and 2368 transitions. [2021-06-05 14:43:33,620 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 14:43:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 2368 transitions. [2021-06-05 14:43:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:33,622 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:33,622 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:33,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 14:43:33,622 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:33,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash -881757258, now seen corresponding path program 1 times [2021-06-05 14:43:33,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:33,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079898180] [2021-06-05 14:43:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:33,669 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 14:43:33,670 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:33,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079898180] [2021-06-05 14:43:33,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079898180] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:33,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:33,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:33,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060174403] [2021-06-05 14:43:33,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:33,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:33,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:33,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:33,671 INFO L87 Difference]: Start difference. First operand 633 states and 2368 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 14:43:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:33,820 INFO L93 Difference]: Finished difference Result 974 states and 3400 transitions. [2021-06-05 14:43:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:33,821 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 14:43:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:33,827 INFO L225 Difference]: With dead ends: 974 [2021-06-05 14:43:33,828 INFO L226 Difference]: Without dead ends: 951 [2021-06-05 14:43:33,828 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-06-05 14:43:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 641. [2021-06-05 14:43:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.7375) internal successors, (2392), 640 states have internal predecessors, (2392), 0 states have call successors, (0), 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 14:43:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 2392 transitions. [2021-06-05 14:43:33,848 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 2392 transitions. Word has length 16 [2021-06-05 14:43:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:33,848 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 2392 transitions. [2021-06-05 14:43:33,849 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 14:43:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 2392 transitions. [2021-06-05 14:43:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:33,852 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:33,852 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:33,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 14:43:33,852 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:33,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash 768619160, now seen corresponding path program 1 times [2021-06-05 14:43:33,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:33,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133779479] [2021-06-05 14:43:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:33,911 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 14:43:33,911 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:33,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133779479] [2021-06-05 14:43:33,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133779479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:33,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:33,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:33,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429876254] [2021-06-05 14:43:33,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:33,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:33,912 INFO L87 Difference]: Start difference. First operand 641 states and 2392 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 14:43:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:34,071 INFO L93 Difference]: Finished difference Result 965 states and 3345 transitions. [2021-06-05 14:43:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:34,071 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 14:43:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:34,076 INFO L225 Difference]: With dead ends: 965 [2021-06-05 14:43:34,076 INFO L226 Difference]: Without dead ends: 936 [2021-06-05 14:43:34,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 75.8ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-06-05 14:43:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 645. [2021-06-05 14:43:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 3.732919254658385) internal successors, (2404), 644 states have internal predecessors, (2404), 0 states have call successors, (0), 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 14:43:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2404 transitions. [2021-06-05 14:43:34,095 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2404 transitions. Word has length 16 [2021-06-05 14:43:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:34,095 INFO L482 AbstractCegarLoop]: Abstraction has 645 states and 2404 transitions. [2021-06-05 14:43:34,095 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 14:43:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2404 transitions. [2021-06-05 14:43:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:34,097 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:34,097 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:34,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 14:43:34,098 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1488759573, now seen corresponding path program 1 times [2021-06-05 14:43:34,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:34,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109327471] [2021-06-05 14:43:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:34,248 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 14:43:34,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:34,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109327471] [2021-06-05 14:43:34,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109327471] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:34,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:34,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:34,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342720066] [2021-06-05 14:43:34,248 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:34,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:34,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:34,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:34,249 INFO L87 Difference]: Start difference. First operand 645 states and 2404 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 14:43:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:34,475 INFO L93 Difference]: Finished difference Result 1001 states and 3467 transitions. [2021-06-05 14:43:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:34,476 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 14:43:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:34,481 INFO L225 Difference]: With dead ends: 1001 [2021-06-05 14:43:34,481 INFO L226 Difference]: Without dead ends: 978 [2021-06-05 14:43:34,481 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 174.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-06-05 14:43:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 653. [2021-06-05 14:43:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 3.723926380368098) internal successors, (2428), 652 states have internal predecessors, (2428), 0 states have call successors, (0), 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 14:43:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 2428 transitions. [2021-06-05 14:43:34,514 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 2428 transitions. Word has length 16 [2021-06-05 14:43:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:34,514 INFO L482 AbstractCegarLoop]: Abstraction has 653 states and 2428 transitions. [2021-06-05 14:43:34,515 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 14:43:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 2428 transitions. [2021-06-05 14:43:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:34,516 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:34,516 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:34,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 14:43:34,517 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash 185156587, now seen corresponding path program 1 times [2021-06-05 14:43:34,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:34,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492444731] [2021-06-05 14:43:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:34,626 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 14:43:34,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:34,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492444731] [2021-06-05 14:43:34,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492444731] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:34,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:34,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:34,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879761522] [2021-06-05 14:43:34,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:34,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:34,628 INFO L87 Difference]: Start difference. First operand 653 states and 2428 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 14:43:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:34,824 INFO L93 Difference]: Finished difference Result 972 states and 3352 transitions. [2021-06-05 14:43:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:34,825 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 14:43:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:34,830 INFO L225 Difference]: With dead ends: 972 [2021-06-05 14:43:34,830 INFO L226 Difference]: Without dead ends: 943 [2021-06-05 14:43:34,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 133.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-06-05 14:43:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 657. [2021-06-05 14:43:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.7195121951219514) internal successors, (2440), 656 states have internal predecessors, (2440), 0 states have call successors, (0), 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 14:43:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2440 transitions. [2021-06-05 14:43:34,848 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2440 transitions. Word has length 16 [2021-06-05 14:43:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:34,848 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2440 transitions. [2021-06-05 14:43:34,848 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 14:43:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2440 transitions. [2021-06-05 14:43:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:34,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:34,850 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:34,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 14:43:34,850 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:34,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1227931188, now seen corresponding path program 2 times [2021-06-05 14:43:34,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:34,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729270070] [2021-06-05 14:43:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:34,953 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 14:43:34,954 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:34,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729270070] [2021-06-05 14:43:34,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729270070] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:34,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:34,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:34,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275350432] [2021-06-05 14:43:34,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:34,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:34,955 INFO L87 Difference]: Start difference. First operand 657 states and 2440 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 14:43:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:35,130 INFO L93 Difference]: Finished difference Result 1111 states and 3792 transitions. [2021-06-05 14:43:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:35,131 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 14:43:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:35,136 INFO L225 Difference]: With dead ends: 1111 [2021-06-05 14:43:35,136 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 14:43:35,137 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 132.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 14:43:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 657. [2021-06-05 14:43:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.7195121951219514) internal successors, (2440), 656 states have internal predecessors, (2440), 0 states have call successors, (0), 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 14:43:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2440 transitions. [2021-06-05 14:43:35,156 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2440 transitions. Word has length 16 [2021-06-05 14:43:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:35,156 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2440 transitions. [2021-06-05 14:43:35,157 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 14:43:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2440 transitions. [2021-06-05 14:43:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:35,158 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:35,158 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:35,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 14:43:35,159 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1214418261, now seen corresponding path program 2 times [2021-06-05 14:43:35,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:35,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079966070] [2021-06-05 14:43:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:35,251 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 14:43:35,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:35,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079966070] [2021-06-05 14:43:35,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079966070] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:35,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:35,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:35,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481581925] [2021-06-05 14:43:35,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:35,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:35,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:35,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:35,255 INFO L87 Difference]: Start difference. First operand 657 states and 2440 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 14:43:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:35,421 INFO L93 Difference]: Finished difference Result 1170 states and 4048 transitions. [2021-06-05 14:43:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:43:35,421 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 14:43:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:35,426 INFO L225 Difference]: With dead ends: 1170 [2021-06-05 14:43:35,426 INFO L226 Difference]: Without dead ends: 1143 [2021-06-05 14:43:35,427 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 125.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2021-06-05 14:43:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 657. [2021-06-05 14:43:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.716463414634146) internal successors, (2438), 656 states have internal predecessors, (2438), 0 states have call successors, (0), 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 14:43:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2438 transitions. [2021-06-05 14:43:35,445 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2438 transitions. Word has length 16 [2021-06-05 14:43:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:35,445 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2438 transitions. [2021-06-05 14:43:35,445 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 14:43:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2438 transitions. [2021-06-05 14:43:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:35,447 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:35,447 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:35,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 14:43:35,447 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1866944204, now seen corresponding path program 2 times [2021-06-05 14:43:35,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:35,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146297614] [2021-06-05 14:43:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:35,528 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 14:43:35,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:35,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146297614] [2021-06-05 14:43:35,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146297614] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:35,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:35,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:35,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123636510] [2021-06-05 14:43:35,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:35,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:35,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:35,530 INFO L87 Difference]: Start difference. First operand 657 states and 2438 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 14:43:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:35,685 INFO L93 Difference]: Finished difference Result 1084 states and 3756 transitions. [2021-06-05 14:43:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:35,686 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 14:43:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:35,691 INFO L225 Difference]: With dead ends: 1084 [2021-06-05 14:43:35,691 INFO L226 Difference]: Without dead ends: 1055 [2021-06-05 14:43:35,691 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 98.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2021-06-05 14:43:35,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 657. [2021-06-05 14:43:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.716463414634146) internal successors, (2438), 656 states have internal predecessors, (2438), 0 states have call successors, (0), 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 14:43:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2438 transitions. [2021-06-05 14:43:35,712 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2438 transitions. Word has length 16 [2021-06-05 14:43:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:35,712 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2438 transitions. [2021-06-05 14:43:35,712 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 14:43:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2438 transitions. [2021-06-05 14:43:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:35,714 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:35,714 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:35,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 14:43:35,714 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1453708437, now seen corresponding path program 2 times [2021-06-05 14:43:35,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:35,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000276376] [2021-06-05 14:43:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:35,818 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 14:43:35,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:35,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000276376] [2021-06-05 14:43:35,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000276376] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:35,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:35,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:35,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258918465] [2021-06-05 14:43:35,819 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:35,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:35,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:35,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:35,819 INFO L87 Difference]: Start difference. First operand 657 states and 2438 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 14:43:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:35,999 INFO L93 Difference]: Finished difference Result 1088 states and 3765 transitions. [2021-06-05 14:43:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:35,999 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 14:43:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:36,002 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 14:43:36,002 INFO L226 Difference]: Without dead ends: 1048 [2021-06-05 14:43:36,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 147.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-06-05 14:43:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 657. [2021-06-05 14:43:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.7103658536585367) internal successors, (2434), 656 states have internal predecessors, (2434), 0 states have call successors, (0), 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 14:43:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2434 transitions. [2021-06-05 14:43:36,020 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2434 transitions. Word has length 16 [2021-06-05 14:43:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:36,020 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2434 transitions. [2021-06-05 14:43:36,020 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 14:43:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2434 transitions. [2021-06-05 14:43:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:36,022 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:36,022 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:36,022 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 14:43:36,022 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash 486403162, now seen corresponding path program 3 times [2021-06-05 14:43:36,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:36,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43613720] [2021-06-05 14:43:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:36,075 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 14:43:36,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:36,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43613720] [2021-06-05 14:43:36,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43613720] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:36,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:36,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:36,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301788318] [2021-06-05 14:43:36,076 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:36,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:36,077 INFO L87 Difference]: Start difference. First operand 657 states and 2434 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 14:43:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:36,155 INFO L93 Difference]: Finished difference Result 869 states and 2928 transitions. [2021-06-05 14:43:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:36,155 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 14:43:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:36,158 INFO L225 Difference]: With dead ends: 869 [2021-06-05 14:43:36,158 INFO L226 Difference]: Without dead ends: 846 [2021-06-05 14:43:36,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-06-05 14:43:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 634. [2021-06-05 14:43:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 3.654028436018957) internal successors, (2313), 633 states have internal predecessors, (2313), 0 states have call successors, (0), 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 14:43:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2313 transitions. [2021-06-05 14:43:36,174 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 2313 transitions. Word has length 16 [2021-06-05 14:43:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:36,174 INFO L482 AbstractCegarLoop]: Abstraction has 634 states and 2313 transitions. [2021-06-05 14:43:36,174 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 14:43:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 2313 transitions. [2021-06-05 14:43:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:36,175 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:36,175 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:36,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 14:43:36,176 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:36,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1119769510, now seen corresponding path program 4 times [2021-06-05 14:43:36,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:36,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122395193] [2021-06-05 14:43:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:36,214 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 14:43:36,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:36,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122395193] [2021-06-05 14:43:36,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122395193] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:36,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:36,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:36,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453182190] [2021-06-05 14:43:36,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:36,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:36,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:36,216 INFO L87 Difference]: Start difference. First operand 634 states and 2313 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 14:43:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:36,310 INFO L93 Difference]: Finished difference Result 825 states and 2808 transitions. [2021-06-05 14:43:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:36,310 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 14:43:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:36,313 INFO L225 Difference]: With dead ends: 825 [2021-06-05 14:43:36,313 INFO L226 Difference]: Without dead ends: 802 [2021-06-05 14:43:36,313 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-06-05 14:43:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 644. [2021-06-05 14:43:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 3.636080870917574) internal successors, (2338), 643 states have internal predecessors, (2338), 0 states have call successors, (0), 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 14:43:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 2338 transitions. [2021-06-05 14:43:36,327 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 2338 transitions. Word has length 16 [2021-06-05 14:43:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:36,327 INFO L482 AbstractCegarLoop]: Abstraction has 644 states and 2338 transitions. [2021-06-05 14:43:36,328 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 14:43:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 2338 transitions. [2021-06-05 14:43:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:36,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:36,329 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:36,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 14:43:36,329 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 423749436, now seen corresponding path program 3 times [2021-06-05 14:43:36,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:36,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020526378] [2021-06-05 14:43:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:36,381 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 14:43:36,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:36,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020526378] [2021-06-05 14:43:36,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020526378] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:36,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:36,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:36,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415142826] [2021-06-05 14:43:36,382 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:36,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:36,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:36,382 INFO L87 Difference]: Start difference. First operand 644 states and 2338 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 14:43:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:36,462 INFO L93 Difference]: Finished difference Result 815 states and 2725 transitions. [2021-06-05 14:43:36,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:36,462 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 14:43:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:36,464 INFO L225 Difference]: With dead ends: 815 [2021-06-05 14:43:36,464 INFO L226 Difference]: Without dead ends: 786 [2021-06-05 14:43:36,464 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-06-05 14:43:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 612. [2021-06-05 14:43:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.5810147299509003) internal successors, (2188), 611 states have internal predecessors, (2188), 0 states have call successors, (0), 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 14:43:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 2188 transitions. [2021-06-05 14:43:36,486 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 2188 transitions. Word has length 16 [2021-06-05 14:43:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:36,487 INFO L482 AbstractCegarLoop]: Abstraction has 612 states and 2188 transitions. [2021-06-05 14:43:36,487 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 14:43:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 2188 transitions. [2021-06-05 14:43:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:36,488 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:36,488 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:36,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 14:43:36,489 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 315557690, now seen corresponding path program 4 times [2021-06-05 14:43:36,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:36,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988348072] [2021-06-05 14:43:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:36,544 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 14:43:36,544 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:36,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988348072] [2021-06-05 14:43:36,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988348072] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:36,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:36,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:36,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586239482] [2021-06-05 14:43:36,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:36,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:36,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:36,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:36,545 INFO L87 Difference]: Start difference. First operand 612 states and 2188 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 14:43:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:36,635 INFO L93 Difference]: Finished difference Result 803 states and 2689 transitions. [2021-06-05 14:43:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:36,635 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 14:43:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:36,636 INFO L225 Difference]: With dead ends: 803 [2021-06-05 14:43:36,636 INFO L226 Difference]: Without dead ends: 774 [2021-06-05 14:43:36,637 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2021-06-05 14:43:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 618. [2021-06-05 14:43:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 3.5769854132901133) internal successors, (2207), 617 states have internal predecessors, (2207), 0 states have call successors, (0), 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 14:43:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2207 transitions. [2021-06-05 14:43:36,648 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2207 transitions. Word has length 16 [2021-06-05 14:43:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:36,648 INFO L482 AbstractCegarLoop]: Abstraction has 618 states and 2207 transitions. [2021-06-05 14:43:36,648 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 14:43:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2207 transitions. [2021-06-05 14:43:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:36,651 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:36,651 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:36,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 14:43:36,651 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2014690215, now seen corresponding path program 3 times [2021-06-05 14:43:36,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:36,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888955468] [2021-06-05 14:43:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:36,753 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 14:43:36,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:36,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888955468] [2021-06-05 14:43:36,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888955468] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:36,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:36,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:36,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541895793] [2021-06-05 14:43:36,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:36,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:36,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:36,755 INFO L87 Difference]: Start difference. First operand 618 states and 2207 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 14:43:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:36,958 INFO L93 Difference]: Finished difference Result 742 states and 2401 transitions. [2021-06-05 14:43:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:36,959 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 14:43:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:36,960 INFO L225 Difference]: With dead ends: 742 [2021-06-05 14:43:36,960 INFO L226 Difference]: Without dead ends: 719 [2021-06-05 14:43:36,960 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 193.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-06-05 14:43:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 555. [2021-06-05 14:43:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 3.487364620938628) internal successors, (1932), 554 states have internal predecessors, (1932), 0 states have call successors, (0), 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 14:43:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1932 transitions. [2021-06-05 14:43:36,971 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1932 transitions. Word has length 16 [2021-06-05 14:43:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:36,971 INFO L482 AbstractCegarLoop]: Abstraction has 555 states and 1932 transitions. [2021-06-05 14:43:36,971 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 14:43:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1932 transitions. [2021-06-05 14:43:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:36,973 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:36,973 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:36,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 14:43:36,973 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1307197767, now seen corresponding path program 4 times [2021-06-05 14:43:36,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:36,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130906591] [2021-06-05 14:43:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:37,036 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 14:43:37,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:37,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130906591] [2021-06-05 14:43:37,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130906591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:37,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:37,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:37,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705243968] [2021-06-05 14:43:37,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:37,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:37,038 INFO L87 Difference]: Start difference. First operand 555 states and 1932 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 14:43:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:37,208 INFO L93 Difference]: Finished difference Result 829 states and 2671 transitions. [2021-06-05 14:43:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:37,208 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 14:43:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:37,210 INFO L225 Difference]: With dead ends: 829 [2021-06-05 14:43:37,210 INFO L226 Difference]: Without dead ends: 806 [2021-06-05 14:43:37,210 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-06-05 14:43:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 565. [2021-06-05 14:43:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.469858156028369) internal successors, (1957), 564 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 14:43:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1957 transitions. [2021-06-05 14:43:37,224 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1957 transitions. Word has length 16 [2021-06-05 14:43:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:37,224 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 1957 transitions. [2021-06-05 14:43:37,224 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 14:43:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1957 transitions. [2021-06-05 14:43:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:37,226 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:37,226 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:37,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 14:43:37,226 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2145877403, now seen corresponding path program 3 times [2021-06-05 14:43:37,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:37,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041837621] [2021-06-05 14:43:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:37,296 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 14:43:37,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:37,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041837621] [2021-06-05 14:43:37,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041837621] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:37,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:37,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:37,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098603286] [2021-06-05 14:43:37,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:37,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:37,299 INFO L87 Difference]: Start difference. First operand 565 states and 1957 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 14:43:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:37,422 INFO L93 Difference]: Finished difference Result 670 states and 2109 transitions. [2021-06-05 14:43:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:37,422 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 14:43:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:37,423 INFO L225 Difference]: With dead ends: 670 [2021-06-05 14:43:37,423 INFO L226 Difference]: Without dead ends: 641 [2021-06-05 14:43:37,423 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 95.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-06-05 14:43:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 499. [2021-06-05 14:43:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 3.3493975903614457) internal successors, (1668), 498 states have internal predecessors, (1668), 0 states have call successors, (0), 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 14:43:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1668 transitions. [2021-06-05 14:43:37,433 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1668 transitions. Word has length 16 [2021-06-05 14:43:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:37,433 INFO L482 AbstractCegarLoop]: Abstraction has 499 states and 1668 transitions. [2021-06-05 14:43:37,434 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 14:43:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1668 transitions. [2021-06-05 14:43:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:37,435 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:37,435 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:37,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 14:43:37,435 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1820955431, now seen corresponding path program 4 times [2021-06-05 14:43:37,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:37,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677110012] [2021-06-05 14:43:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:37,500 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 14:43:37,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:37,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677110012] [2021-06-05 14:43:37,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677110012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:37,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:37,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:37,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770673040] [2021-06-05 14:43:37,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:37,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:37,502 INFO L87 Difference]: Start difference. First operand 499 states and 1668 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 14:43:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:37,687 INFO L93 Difference]: Finished difference Result 674 states and 2121 transitions. [2021-06-05 14:43:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:37,687 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 14:43:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:37,688 INFO L225 Difference]: With dead ends: 674 [2021-06-05 14:43:37,688 INFO L226 Difference]: Without dead ends: 645 [2021-06-05 14:43:37,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 158.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-06-05 14:43:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 505. [2021-06-05 14:43:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.3472222222222223) internal successors, (1687), 504 states have internal predecessors, (1687), 0 states have call successors, (0), 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 14:43:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1687 transitions. [2021-06-05 14:43:37,699 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1687 transitions. Word has length 16 [2021-06-05 14:43:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:37,700 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1687 transitions. [2021-06-05 14:43:37,700 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 14:43:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1687 transitions. [2021-06-05 14:43:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:37,701 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:37,701 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:37,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 14:43:37,701 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash 648487496, now seen corresponding path program 3 times [2021-06-05 14:43:37,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:37,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427370032] [2021-06-05 14:43:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:37,784 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 14:43:37,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:37,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427370032] [2021-06-05 14:43:37,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427370032] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:37,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:37,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:37,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955115053] [2021-06-05 14:43:37,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:37,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:37,786 INFO L87 Difference]: Start difference. First operand 505 states and 1687 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 14:43:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:37,964 INFO L93 Difference]: Finished difference Result 1060 states and 3246 transitions. [2021-06-05 14:43:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:43:37,964 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 14:43:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:37,966 INFO L225 Difference]: With dead ends: 1060 [2021-06-05 14:43:37,966 INFO L226 Difference]: Without dead ends: 1033 [2021-06-05 14:43:37,966 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 124.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:43:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2021-06-05 14:43:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 505. [2021-06-05 14:43:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.3472222222222223) internal successors, (1687), 504 states have internal predecessors, (1687), 0 states have call successors, (0), 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 14:43:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1687 transitions. [2021-06-05 14:43:37,995 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1687 transitions. Word has length 16 [2021-06-05 14:43:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:37,995 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1687 transitions. [2021-06-05 14:43:37,996 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 14:43:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1687 transitions. [2021-06-05 14:43:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:37,999 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:38,000 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:38,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 14:43:38,000 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 749508455, now seen corresponding path program 3 times [2021-06-05 14:43:38,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:38,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596121777] [2021-06-05 14:43:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:38,196 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 14:43:38,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:38,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596121777] [2021-06-05 14:43:38,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596121777] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:38,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:38,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:38,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044398956] [2021-06-05 14:43:38,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:38,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:38,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:38,198 INFO L87 Difference]: Start difference. First operand 505 states and 1687 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 14:43:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:38,325 INFO L93 Difference]: Finished difference Result 821 states and 2570 transitions. [2021-06-05 14:43:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:38,325 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 14:43:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:38,327 INFO L225 Difference]: With dead ends: 821 [2021-06-05 14:43:38,327 INFO L226 Difference]: Without dead ends: 794 [2021-06-05 14:43:38,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 176.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-06-05 14:43:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 505. [2021-06-05 14:43:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.3472222222222223) internal successors, (1687), 504 states have internal predecessors, (1687), 0 states have call successors, (0), 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 14:43:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1687 transitions. [2021-06-05 14:43:38,339 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1687 transitions. Word has length 16 [2021-06-05 14:43:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:38,339 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1687 transitions. [2021-06-05 14:43:38,339 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 14:43:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1687 transitions. [2021-06-05 14:43:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:38,340 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:38,341 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:38,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 14:43:38,341 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1222989368, now seen corresponding path program 5 times [2021-06-05 14:43:38,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:38,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561373653] [2021-06-05 14:43:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:38,394 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 14:43:38,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:38,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561373653] [2021-06-05 14:43:38,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561373653] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:38,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:38,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:38,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422635274] [2021-06-05 14:43:38,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:38,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:38,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:38,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:38,395 INFO L87 Difference]: Start difference. First operand 505 states and 1687 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 14:43:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:38,516 INFO L93 Difference]: Finished difference Result 891 states and 2762 transitions. [2021-06-05 14:43:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:38,517 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 14:43:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:38,518 INFO L225 Difference]: With dead ends: 891 [2021-06-05 14:43:38,518 INFO L226 Difference]: Without dead ends: 862 [2021-06-05 14:43:38,518 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-06-05 14:43:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 494. [2021-06-05 14:43:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.36105476673428) internal successors, (1657), 493 states have internal predecessors, (1657), 0 states have call successors, (0), 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 14:43:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1657 transitions. [2021-06-05 14:43:38,529 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1657 transitions. Word has length 16 [2021-06-05 14:43:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:38,530 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1657 transitions. [2021-06-05 14:43:38,530 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 14:43:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1657 transitions. [2021-06-05 14:43:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:38,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:38,531 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:38,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 14:43:38,531 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash -248674713, now seen corresponding path program 5 times [2021-06-05 14:43:38,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:38,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781070395] [2021-06-05 14:43:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:38,603 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 14:43:38,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:38,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781070395] [2021-06-05 14:43:38,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781070395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:38,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:38,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:38,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673203493] [2021-06-05 14:43:38,604 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:38,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:38,604 INFO L87 Difference]: Start difference. First operand 494 states and 1657 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 14:43:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:38,751 INFO L93 Difference]: Finished difference Result 868 states and 2732 transitions. [2021-06-05 14:43:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:38,751 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 14:43:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:38,754 INFO L225 Difference]: With dead ends: 868 [2021-06-05 14:43:38,754 INFO L226 Difference]: Without dead ends: 828 [2021-06-05 14:43:38,754 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-06-05 14:43:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 494. [2021-06-05 14:43:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 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 14:43:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-06-05 14:43:38,766 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-06-05 14:43:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:38,766 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-06-05 14:43:38,766 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 14:43:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-06-05 14:43:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:38,767 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:38,767 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:38,767 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 14:43:38,767 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1291259644, now seen corresponding path program 6 times [2021-06-05 14:43:38,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:38,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48686098] [2021-06-05 14:43:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:38,832 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 14:43:38,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:38,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48686098] [2021-06-05 14:43:38,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48686098] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:38,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:38,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:38,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401904424] [2021-06-05 14:43:38,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:38,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:38,833 INFO L87 Difference]: Start difference. First operand 494 states and 1652 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 14:43:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:38,958 INFO L93 Difference]: Finished difference Result 741 states and 2296 transitions. [2021-06-05 14:43:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:38,959 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 14:43:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:38,960 INFO L225 Difference]: With dead ends: 741 [2021-06-05 14:43:38,961 INFO L226 Difference]: Without dead ends: 712 [2021-06-05 14:43:38,961 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 99.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-06-05 14:43:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 494. [2021-06-05 14:43:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 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 14:43:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-06-05 14:43:38,974 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-06-05 14:43:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:38,974 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-06-05 14:43:38,974 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 14:43:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-06-05 14:43:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:38,975 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:38,975 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:38,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 14:43:38,975 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:38,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1392400701, now seen corresponding path program 6 times [2021-06-05 14:43:38,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:38,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390601061] [2021-06-05 14:43:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:39,138 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 14:43:39,138 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:39,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390601061] [2021-06-05 14:43:39,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390601061] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:39,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:39,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:39,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763415883] [2021-06-05 14:43:39,140 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:39,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:39,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:39,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:39,140 INFO L87 Difference]: Start difference. First operand 494 states and 1652 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 14:43:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:39,305 INFO L93 Difference]: Finished difference Result 773 states and 2416 transitions. [2021-06-05 14:43:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:39,305 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 14:43:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:39,307 INFO L225 Difference]: With dead ends: 773 [2021-06-05 14:43:39,307 INFO L226 Difference]: Without dead ends: 744 [2021-06-05 14:43:39,307 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 123.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-06-05 14:43:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 494. [2021-06-05 14:43:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 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 14:43:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-06-05 14:43:39,318 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-06-05 14:43:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:39,318 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-06-05 14:43:39,318 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 14:43:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-06-05 14:43:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:39,319 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:39,319 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:39,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 14:43:39,319 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:39,320 INFO L82 PathProgramCache]: Analyzing trace with hash 498850876, now seen corresponding path program 4 times [2021-06-05 14:43:39,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:39,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410431490] [2021-06-05 14:43:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:39,383 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 14:43:39,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:39,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410431490] [2021-06-05 14:43:39,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410431490] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:39,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:39,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:39,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687915279] [2021-06-05 14:43:39,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:39,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:39,384 INFO L87 Difference]: Start difference. First operand 494 states and 1652 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 14:43:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:39,480 INFO L93 Difference]: Finished difference Result 889 states and 2730 transitions. [2021-06-05 14:43:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:39,481 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 14:43:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:39,482 INFO L225 Difference]: With dead ends: 889 [2021-06-05 14:43:39,482 INFO L226 Difference]: Without dead ends: 862 [2021-06-05 14:43:39,482 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-06-05 14:43:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 494. [2021-06-05 14:43:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 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 14:43:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-06-05 14:43:39,494 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-06-05 14:43:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:39,494 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-06-05 14:43:39,494 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 14:43:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-06-05 14:43:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:39,495 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:39,495 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:39,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 14:43:39,496 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash 637834109, now seen corresponding path program 4 times [2021-06-05 14:43:39,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:39,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736468565] [2021-06-05 14:43:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:39,609 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 14:43:39,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:39,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736468565] [2021-06-05 14:43:39,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736468565] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:39,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:39,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:39,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316027443] [2021-06-05 14:43:39,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:39,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:39,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:39,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:39,611 INFO L87 Difference]: Start difference. First operand 494 states and 1652 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 14:43:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:39,787 INFO L93 Difference]: Finished difference Result 863 states and 2698 transitions. [2021-06-05 14:43:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:39,787 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 14:43:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:39,789 INFO L225 Difference]: With dead ends: 863 [2021-06-05 14:43:39,789 INFO L226 Difference]: Without dead ends: 830 [2021-06-05 14:43:39,789 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 164.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-06-05 14:43:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 494. [2021-06-05 14:43:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 0 states have call successors, (0), 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 14:43:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-06-05 14:43:39,801 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 16 [2021-06-05 14:43:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:39,801 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-06-05 14:43:39,801 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 14:43:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-06-05 14:43:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:39,802 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:39,802 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:39,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 14:43:39,802 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:39,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1681413370, now seen corresponding path program 5 times [2021-06-05 14:43:39,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:39,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399401214] [2021-06-05 14:43:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:39,836 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 14:43:39,837 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:39,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399401214] [2021-06-05 14:43:39,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399401214] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:39,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:39,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:39,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711316341] [2021-06-05 14:43:39,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:39,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:39,839 INFO L87 Difference]: Start difference. First operand 494 states and 1649 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 14:43:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:39,904 INFO L93 Difference]: Finished difference Result 731 states and 2291 transitions. [2021-06-05 14:43:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:39,904 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 14:43:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:39,905 INFO L225 Difference]: With dead ends: 731 [2021-06-05 14:43:39,906 INFO L226 Difference]: Without dead ends: 704 [2021-06-05 14:43:39,906 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-06-05 14:43:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 494. [2021-06-05 14:43:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 0 states have call successors, (0), 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 14:43:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-06-05 14:43:39,917 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 16 [2021-06-05 14:43:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:39,917 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-06-05 14:43:39,917 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 14:43:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-06-05 14:43:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:39,918 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:39,918 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:39,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 14:43:39,918 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1580392411, now seen corresponding path program 5 times [2021-06-05 14:43:39,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:39,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987001799] [2021-06-05 14:43:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:40,029 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 14:43:40,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:40,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987001799] [2021-06-05 14:43:40,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987001799] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:40,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:40,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:40,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144075295] [2021-06-05 14:43:40,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:40,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:40,030 INFO L87 Difference]: Start difference. First operand 494 states and 1649 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 14:43:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:40,254 INFO L93 Difference]: Finished difference Result 731 states and 2291 transitions. [2021-06-05 14:43:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:40,255 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 14:43:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:40,256 INFO L225 Difference]: With dead ends: 731 [2021-06-05 14:43:40,256 INFO L226 Difference]: Without dead ends: 704 [2021-06-05 14:43:40,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 218.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-06-05 14:43:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 494. [2021-06-05 14:43:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 0 states have call successors, (0), 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 14:43:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-06-05 14:43:40,267 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 16 [2021-06-05 14:43:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:40,267 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-06-05 14:43:40,267 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 14:43:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-06-05 14:43:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:40,268 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:40,268 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:40,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 14:43:40,269 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:40,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 784334086, now seen corresponding path program 5 times [2021-06-05 14:43:40,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:40,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784995887] [2021-06-05 14:43:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:40,324 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 14:43:40,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:40,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784995887] [2021-06-05 14:43:40,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784995887] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:40,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:40,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:40,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796210154] [2021-06-05 14:43:40,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:40,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:40,326 INFO L87 Difference]: Start difference. First operand 494 states and 1649 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 14:43:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:40,449 INFO L93 Difference]: Finished difference Result 793 states and 2506 transitions. [2021-06-05 14:43:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:40,450 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 14:43:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:40,451 INFO L225 Difference]: With dead ends: 793 [2021-06-05 14:43:40,451 INFO L226 Difference]: Without dead ends: 770 [2021-06-05 14:43:40,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.1ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-06-05 14:43:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 490. [2021-06-05 14:43:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.347648261758691) internal successors, (1637), 489 states have internal predecessors, (1637), 0 states have call successors, (0), 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 14:43:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1637 transitions. [2021-06-05 14:43:40,477 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1637 transitions. Word has length 16 [2021-06-05 14:43:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:40,477 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1637 transitions. [2021-06-05 14:43:40,477 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 14:43:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1637 transitions. [2021-06-05 14:43:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:40,478 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:40,478 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:40,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 14:43:40,478 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 797847013, now seen corresponding path program 5 times [2021-06-05 14:43:40,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:40,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882197528] [2021-06-05 14:43:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:40,618 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 14:43:40,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:40,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882197528] [2021-06-05 14:43:40,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882197528] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:40,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:40,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:40,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462628374] [2021-06-05 14:43:40,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:40,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:40,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:40,620 INFO L87 Difference]: Start difference. First operand 490 states and 1637 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 14:43:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:40,809 INFO L93 Difference]: Finished difference Result 803 states and 2527 transitions. [2021-06-05 14:43:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:40,809 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 14:43:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:40,810 INFO L225 Difference]: With dead ends: 803 [2021-06-05 14:43:40,810 INFO L226 Difference]: Without dead ends: 776 [2021-06-05 14:43:40,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 188.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2021-06-05 14:43:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 490. [2021-06-05 14:43:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.3435582822085887) internal successors, (1635), 489 states have internal predecessors, (1635), 0 states have call successors, (0), 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 14:43:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1635 transitions. [2021-06-05 14:43:40,822 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1635 transitions. Word has length 16 [2021-06-05 14:43:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:40,822 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1635 transitions. [2021-06-05 14:43:40,822 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 14:43:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1635 transitions. [2021-06-05 14:43:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:40,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:40,823 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:40,824 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 14:43:40,824 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1214532848, now seen corresponding path program 6 times [2021-06-05 14:43:40,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:40,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394227744] [2021-06-05 14:43:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:43:40,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:40,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394227744] [2021-06-05 14:43:40,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394227744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:40,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532672057] [2021-06-05 14:43:40,965 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 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 14:43:41,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 14:43:41,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:41,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:43:41,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:41,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 18 treesize of output 14 [2021-06-05 14:43:41,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,187 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 18 treesize of output 14 [2021-06-05 14:43:41,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,303 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-06-05 14:43:41,304 INFO L628 ElimStorePlain]: treesize reduction 133, result has 55.2 percent of original size [2021-06-05 14:43:41,307 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:43:41,308 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:311, output treesize:152 [2021-06-05 14:43:41,418 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 15 treesize of output 11 [2021-06-05 14:43:41,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,428 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 25 treesize of output 19 [2021-06-05 14:43:41,430 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,433 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 33 treesize of output 25 [2021-06-05 14:43:41,435 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,438 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 15 treesize of output 11 [2021-06-05 14:43:41,439 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,442 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 15 treesize of output 11 [2021-06-05 14:43:41,444 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,447 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 15 treesize of output 11 [2021-06-05 14:43:41,450 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,453 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 15 treesize of output 11 [2021-06-05 14:43:41,454 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,472 INFO L628 ElimStorePlain]: treesize reduction 100, result has 18.0 percent of original size [2021-06-05 14:43:41,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,473 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 1 variables, input treesize:275, output treesize:22 [2021-06-05 14:43:41,506 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 27 treesize of output 21 [2021-06-05 14:43:41,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:41,513 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 8 treesize of output 6 [2021-06-05 14:43:41,519 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:41,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:43:41,523 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:8 [2021-06-05 14:43:41,550 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 14:43:41,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532672057] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:41,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:41,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-06-05 14:43:41,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92997794] [2021-06-05 14:43:41,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:41,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:43:41,551 INFO L87 Difference]: Start difference. First operand 490 states and 1635 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 14:43:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:41,774 INFO L93 Difference]: Finished difference Result 671 states and 2073 transitions. [2021-06-05 14:43:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:41,775 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 14:43:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:41,777 INFO L225 Difference]: With dead ends: 671 [2021-06-05 14:43:41,777 INFO L226 Difference]: Without dead ends: 638 [2021-06-05 14:43:41,777 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 330.9ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:43:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-05 14:43:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 490. [2021-06-05 14:43:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.339468302658487) internal successors, (1633), 489 states have internal predecessors, (1633), 0 states have call successors, (0), 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 14:43:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1633 transitions. [2021-06-05 14:43:41,797 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1633 transitions. Word has length 16 [2021-06-05 14:43:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:41,797 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1633 transitions. [2021-06-05 14:43:41,797 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 14:43:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1633 transitions. [2021-06-05 14:43:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:41,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:41,798 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:42,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-06-05 14:43:42,021 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:42,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1154290151, now seen corresponding path program 6 times [2021-06-05 14:43:42,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:42,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760466956] [2021-06-05 14:43:42,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:42,193 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 14:43:42,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:42,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760466956] [2021-06-05 14:43:42,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760466956] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:42,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:42,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:42,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552169842] [2021-06-05 14:43:42,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:42,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:42,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:42,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:42,194 INFO L87 Difference]: Start difference. First operand 490 states and 1633 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 14:43:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:42,445 INFO L93 Difference]: Finished difference Result 708 states and 2212 transitions. [2021-06-05 14:43:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:42,445 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 14:43:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:42,447 INFO L225 Difference]: With dead ends: 708 [2021-06-05 14:43:42,447 INFO L226 Difference]: Without dead ends: 685 [2021-06-05 14:43:42,447 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 249.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-06-05 14:43:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 490. [2021-06-05 14:43:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.339468302658487) internal successors, (1633), 489 states have internal predecessors, (1633), 0 states have call successors, (0), 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 14:43:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1633 transitions. [2021-06-05 14:43:42,457 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1633 transitions. Word has length 16 [2021-06-05 14:43:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:42,457 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1633 transitions. [2021-06-05 14:43:42,457 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 14:43:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1633 transitions. [2021-06-05 14:43:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:42,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:42,458 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:42,459 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 14:43:42,459 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:42,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1810256696, now seen corresponding path program 6 times [2021-06-05 14:43:42,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:42,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084878842] [2021-06-05 14:43:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:42,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 14:43:42,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:42,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084878842] [2021-06-05 14:43:42,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084878842] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:42,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:42,535 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:42,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300204878] [2021-06-05 14:43:42,535 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:42,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:42,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:42,536 INFO L87 Difference]: Start difference. First operand 490 states and 1633 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 14:43:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:42,687 INFO L93 Difference]: Finished difference Result 775 states and 2446 transitions. [2021-06-05 14:43:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:42,687 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 14:43:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:42,689 INFO L225 Difference]: With dead ends: 775 [2021-06-05 14:43:42,689 INFO L226 Difference]: Without dead ends: 748 [2021-06-05 14:43:42,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-06-05 14:43:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 484. [2021-06-05 14:43:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.341614906832298) internal successors, (1614), 483 states have internal predecessors, (1614), 0 states have call successors, (0), 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 14:43:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1614 transitions. [2021-06-05 14:43:42,708 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1614 transitions. Word has length 16 [2021-06-05 14:43:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:42,709 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1614 transitions. [2021-06-05 14:43:42,709 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 14:43:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1614 transitions. [2021-06-05 14:43:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:43:42,710 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:42,710 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:42,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 14:43:42,710 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1796743769, now seen corresponding path program 6 times [2021-06-05 14:43:42,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:42,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893025683] [2021-06-05 14:43:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:42,824 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 14:43:42,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:42,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893025683] [2021-06-05 14:43:42,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893025683] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:42,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:42,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:42,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530901359] [2021-06-05 14:43:42,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:42,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:42,825 INFO L87 Difference]: Start difference. First operand 484 states and 1614 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 14:43:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:43,011 INFO L93 Difference]: Finished difference Result 789 states and 2475 transitions. [2021-06-05 14:43:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:43,012 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 14:43:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:43,014 INFO L225 Difference]: With dead ends: 789 [2021-06-05 14:43:43,014 INFO L226 Difference]: Without dead ends: 756 [2021-06-05 14:43:43,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 167.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-06-05 14:43:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 484. [2021-06-05 14:43:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.3374741200828155) internal successors, (1612), 483 states have internal predecessors, (1612), 0 states have call successors, (0), 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 14:43:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1612 transitions. [2021-06-05 14:43:43,026 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1612 transitions. Word has length 16 [2021-06-05 14:43:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:43,026 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1612 transitions. [2021-06-05 14:43:43,026 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 14:43:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1612 transitions. [2021-06-05 14:43:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:43,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:43,028 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:43,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 14:43:43,028 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1318202505, now seen corresponding path program 1 times [2021-06-05 14:43:43,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:43,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509163729] [2021-06-05 14:43:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:43,050 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 14:43:43,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:43,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509163729] [2021-06-05 14:43:43,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509163729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:43,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:43,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:43:43,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012722926] [2021-06-05 14:43:43,051 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:43,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:43,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:43,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:43:43,052 INFO L87 Difference]: Start difference. First operand 484 states and 1612 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 14:43:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:43,100 INFO L93 Difference]: Finished difference Result 671 states and 2053 transitions. [2021-06-05 14:43:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:43,101 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 14:43:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:43,102 INFO L225 Difference]: With dead ends: 671 [2021-06-05 14:43:43,102 INFO L226 Difference]: Without dead ends: 671 [2021-06-05 14:43:43,103 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-06-05 14:43:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 484. [2021-06-05 14:43:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.3374741200828155) internal successors, (1612), 483 states have internal predecessors, (1612), 0 states have call successors, (0), 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 14:43:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1612 transitions. [2021-06-05 14:43:43,112 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1612 transitions. Word has length 18 [2021-06-05 14:43:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:43,113 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1612 transitions. [2021-06-05 14:43:43,113 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 14:43:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1612 transitions. [2021-06-05 14:43:43,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:43,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:43,114 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:43,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 14:43:43,114 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1664376435, now seen corresponding path program 2 times [2021-06-05 14:43:43,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:43,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135141689] [2021-06-05 14:43:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:43:43,249 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:43,250 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135141689] [2021-06-05 14:43:43,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135141689] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:43,250 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518336832] [2021-06-05 14:43:43,250 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 14:43:43,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 14:43:43,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:43,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 14:43:43,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:43,363 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 15 treesize of output 11 [2021-06-05 14:43:43,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:43,367 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 16 treesize of output 12 [2021-06-05 14:43:43,369 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:43,370 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 24 treesize of output 18 [2021-06-05 14:43:43,372 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:43,383 INFO L628 ElimStorePlain]: treesize reduction 34, result has 29.2 percent of original size [2021-06-05 14:43:43,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:43:43,383 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:71, output treesize:16 [2021-06-05 14:43:43,408 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 14:43:43,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518336832] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:43,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:43,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2021-06-05 14:43:43,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690756097] [2021-06-05 14:43:43,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:43,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:43,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:43,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:43:43,410 INFO L87 Difference]: Start difference. First operand 484 states and 1612 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 14:43:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:43,475 INFO L93 Difference]: Finished difference Result 732 states and 2204 transitions. [2021-06-05 14:43:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:43,476 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 14:43:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:43,477 INFO L225 Difference]: With dead ends: 732 [2021-06-05 14:43:43,477 INFO L226 Difference]: Without dead ends: 703 [2021-06-05 14:43:43,477 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 103.4ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:43:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-06-05 14:43:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 484. [2021-06-05 14:43:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.3022774327122155) internal successors, (1595), 483 states have internal predecessors, (1595), 0 states have call successors, (0), 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 14:43:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1595 transitions. [2021-06-05 14:43:43,487 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1595 transitions. Word has length 18 [2021-06-05 14:43:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:43,488 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1595 transitions. [2021-06-05 14:43:43,488 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 14:43:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1595 transitions. [2021-06-05 14:43:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:43,489 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:43,489 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:43,704 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:43:43,705 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1681246645, now seen corresponding path program 1 times [2021-06-05 14:43:43,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:43,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469848918] [2021-06-05 14:43:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:43,756 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 14:43:43,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:43,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469848918] [2021-06-05 14:43:43,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469848918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:43,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:43,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:43,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862266189] [2021-06-05 14:43:43,757 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:43,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:43,758 INFO L87 Difference]: Start difference. First operand 484 states and 1595 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 14:43:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:43,863 INFO L93 Difference]: Finished difference Result 671 states and 2072 transitions. [2021-06-05 14:43:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:43,864 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 14:43:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:43,865 INFO L225 Difference]: With dead ends: 671 [2021-06-05 14:43:43,865 INFO L226 Difference]: Without dead ends: 671 [2021-06-05 14:43:43,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-06-05 14:43:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 492. [2021-06-05 14:43:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 3.3136456211812626) internal successors, (1627), 491 states have internal predecessors, (1627), 0 states have call successors, (0), 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 14:43:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1627 transitions. [2021-06-05 14:43:43,876 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1627 transitions. Word has length 18 [2021-06-05 14:43:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:43,876 INFO L482 AbstractCegarLoop]: Abstraction has 492 states and 1627 transitions. [2021-06-05 14:43:43,876 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 14:43:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1627 transitions. [2021-06-05 14:43:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:43,878 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:43,878 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:43,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 14:43:43,878 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -7330485, now seen corresponding path program 1 times [2021-06-05 14:43:43,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:43,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17784818] [2021-06-05 14:43:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:43,945 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 14:43:43,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:43,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17784818] [2021-06-05 14:43:43,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17784818] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:43,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:43,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:43,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013706306] [2021-06-05 14:43:43,945 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:43,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:43,946 INFO L87 Difference]: Start difference. First operand 492 states and 1627 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,066 INFO L93 Difference]: Finished difference Result 750 states and 2306 transitions. [2021-06-05 14:43:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,068 INFO L225 Difference]: With dead ends: 750 [2021-06-05 14:43:44,068 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 14:43:44,068 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 14:43:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 496. [2021-06-05 14:43:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.319191919191919) internal successors, (1643), 495 states have internal predecessors, (1643), 0 states have call successors, (0), 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 14:43:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1643 transitions. [2021-06-05 14:43:44,077 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1643 transitions. Word has length 18 [2021-06-05 14:43:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:44,077 INFO L482 AbstractCegarLoop]: Abstraction has 496 states and 1643 transitions. [2021-06-05 14:43:44,077 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1643 transitions. [2021-06-05 14:43:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:44,078 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:44,078 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:44,078 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 14:43:44,079 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1406905333, now seen corresponding path program 2 times [2021-06-05 14:43:44,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:44,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122647616] [2021-06-05 14:43:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:44,131 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 14:43:44,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:44,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122647616] [2021-06-05 14:43:44,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122647616] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:44,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:44,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:44,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820402890] [2021-06-05 14:43:44,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:44,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:44,133 INFO L87 Difference]: Start difference. First operand 496 states and 1643 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 14:43:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,260 INFO L93 Difference]: Finished difference Result 747 states and 2285 transitions. [2021-06-05 14:43:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:44,261 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 14:43:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,262 INFO L225 Difference]: With dead ends: 747 [2021-06-05 14:43:44,262 INFO L226 Difference]: Without dead ends: 696 [2021-06-05 14:43:44,262 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-06-05 14:43:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 496. [2021-06-05 14:43:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.311111111111111) internal successors, (1639), 495 states have internal predecessors, (1639), 0 states have call successors, (0), 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 14:43:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1639 transitions. [2021-06-05 14:43:44,273 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1639 transitions. Word has length 18 [2021-06-05 14:43:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:44,273 INFO L482 AbstractCegarLoop]: Abstraction has 496 states and 1639 transitions. [2021-06-05 14:43:44,273 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 14:43:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1639 transitions. [2021-06-05 14:43:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:44,274 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:44,274 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:44,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 14:43:44,274 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1646195509, now seen corresponding path program 2 times [2021-06-05 14:43:44,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:44,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936028832] [2021-06-05 14:43:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:44,306 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 14:43:44,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:44,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936028832] [2021-06-05 14:43:44,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936028832] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:44,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:44,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:44,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506672838] [2021-06-05 14:43:44,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:44,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:44,307 INFO L87 Difference]: Start difference. First operand 496 states and 1639 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 14:43:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,427 INFO L93 Difference]: Finished difference Result 806 states and 2466 transitions. [2021-06-05 14:43:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:44,428 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 14:43:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,429 INFO L225 Difference]: With dead ends: 806 [2021-06-05 14:43:44,429 INFO L226 Difference]: Without dead ends: 732 [2021-06-05 14:43:44,430 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-06-05 14:43:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 496. [2021-06-05 14:43:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.294949494949495) internal successors, (1631), 495 states have internal predecessors, (1631), 0 states have call successors, (0), 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 14:43:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1631 transitions. [2021-06-05 14:43:44,439 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1631 transitions. Word has length 18 [2021-06-05 14:43:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:44,439 INFO L482 AbstractCegarLoop]: Abstraction has 496 states and 1631 transitions. [2021-06-05 14:43:44,439 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 14:43:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1631 transitions. [2021-06-05 14:43:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:44,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:44,441 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:44,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 14:43:44,441 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1677620215, now seen corresponding path program 1 times [2021-06-05 14:43:44,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:44,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079193347] [2021-06-05 14:43:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:44,486 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 14:43:44,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:44,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079193347] [2021-06-05 14:43:44,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079193347] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:44,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:44,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:44,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162026201] [2021-06-05 14:43:44,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:44,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:44,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:44,488 INFO L87 Difference]: Start difference. First operand 496 states and 1631 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 14:43:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,554 INFO L93 Difference]: Finished difference Result 771 states and 2360 transitions. [2021-06-05 14:43:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:44,554 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 14:43:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,556 INFO L225 Difference]: With dead ends: 771 [2021-06-05 14:43:44,556 INFO L226 Difference]: Without dead ends: 707 [2021-06-05 14:43:44,556 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-06-05 14:43:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 496. [2021-06-05 14:43:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.286868686868687) internal successors, (1627), 495 states have internal predecessors, (1627), 0 states have call successors, (0), 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 14:43:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1627 transitions. [2021-06-05 14:43:44,565 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1627 transitions. Word has length 18 [2021-06-05 14:43:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:44,566 INFO L482 AbstractCegarLoop]: Abstraction has 496 states and 1627 transitions. [2021-06-05 14:43:44,566 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 14:43:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1627 transitions. [2021-06-05 14:43:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:44,567 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:44,567 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:44,567 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 14:43:44,567 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash -787184105, now seen corresponding path program 2 times [2021-06-05 14:43:44,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:44,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078199367] [2021-06-05 14:43:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:44,592 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 14:43:44,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:44,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078199367] [2021-06-05 14:43:44,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078199367] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:44,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:44,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:44,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572368640] [2021-06-05 14:43:44,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:44,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:44,593 INFO L87 Difference]: Start difference. First operand 496 states and 1627 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 14:43:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,671 INFO L93 Difference]: Finished difference Result 908 states and 2716 transitions. [2021-06-05 14:43:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:44,671 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 14:43:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,673 INFO L225 Difference]: With dead ends: 908 [2021-06-05 14:43:44,673 INFO L226 Difference]: Without dead ends: 855 [2021-06-05 14:43:44,673 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.1ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-06-05 14:43:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 492. [2021-06-05 14:43:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 3.2892057026476578) internal successors, (1615), 491 states have internal predecessors, (1615), 0 states have call successors, (0), 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 14:43:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1615 transitions. [2021-06-05 14:43:44,683 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1615 transitions. Word has length 18 [2021-06-05 14:43:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:44,683 INFO L482 AbstractCegarLoop]: Abstraction has 492 states and 1615 transitions. [2021-06-05 14:43:44,683 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 14:43:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1615 transitions. [2021-06-05 14:43:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:44,684 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:44,684 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:44,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 14:43:44,684 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1399083479, now seen corresponding path program 1 times [2021-06-05 14:43:44,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:44,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489507759] [2021-06-05 14:43:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:44,758 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 14:43:44,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:44,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489507759] [2021-06-05 14:43:44,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489507759] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:44,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:44,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:44,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688958472] [2021-06-05 14:43:44,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:44,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:44,760 INFO L87 Difference]: Start difference. First operand 492 states and 1615 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,841 INFO L93 Difference]: Finished difference Result 839 states and 2564 transitions. [2021-06-05 14:43:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,843 INFO L225 Difference]: With dead ends: 839 [2021-06-05 14:43:44,843 INFO L226 Difference]: Without dead ends: 775 [2021-06-05 14:43:44,843 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-06-05 14:43:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 496. [2021-06-05 14:43:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.2747474747474747) internal successors, (1621), 495 states have internal predecessors, (1621), 0 states have call successors, (0), 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 14:43:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1621 transitions. [2021-06-05 14:43:44,853 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1621 transitions. Word has length 18 [2021-06-05 14:43:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:44,854 INFO L482 AbstractCegarLoop]: Abstraction has 496 states and 1621 transitions. [2021-06-05 14:43:44,854 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1621 transitions. [2021-06-05 14:43:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:44,855 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:44,855 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:44,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 14:43:44,855 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:44,855 INFO L82 PathProgramCache]: Analyzing trace with hash 506049385, now seen corresponding path program 2 times [2021-06-05 14:43:44,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:44,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827174727] [2021-06-05 14:43:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:44,900 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 14:43:44,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:44,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827174727] [2021-06-05 14:43:44,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827174727] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:44,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:44,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:44,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903036541] [2021-06-05 14:43:44,901 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:44,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:44,902 INFO L87 Difference]: Start difference. First operand 496 states and 1621 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:44,990 INFO L93 Difference]: Finished difference Result 841 states and 2567 transitions. [2021-06-05 14:43:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:44,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:44,992 INFO L225 Difference]: With dead ends: 841 [2021-06-05 14:43:44,993 INFO L226 Difference]: Without dead ends: 784 [2021-06-05 14:43:44,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-06-05 14:43:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 492. [2021-06-05 14:43:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 3.285132382892057) internal successors, (1613), 491 states have internal predecessors, (1613), 0 states have call successors, (0), 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 14:43:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1613 transitions. [2021-06-05 14:43:45,002 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1613 transitions. Word has length 18 [2021-06-05 14:43:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,003 INFO L482 AbstractCegarLoop]: Abstraction has 492 states and 1613 transitions. [2021-06-05 14:43:45,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1613 transitions. [2021-06-05 14:43:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,004 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:45,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 14:43:45,004 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1415879781, now seen corresponding path program 3 times [2021-06-05 14:43:45,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:45,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675221392] [2021-06-05 14:43:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:45,022 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 14:43:45,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:45,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675221392] [2021-06-05 14:43:45,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675221392] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:45,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:45,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:43:45,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212321361] [2021-06-05 14:43:45,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:45,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:43:45,023 INFO L87 Difference]: Start difference. First operand 492 states and 1613 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 14:43:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:45,067 INFO L93 Difference]: Finished difference Result 600 states and 1829 transitions. [2021-06-05 14:43:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:45,068 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 14:43:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:45,069 INFO L225 Difference]: With dead ends: 600 [2021-06-05 14:43:45,069 INFO L226 Difference]: Without dead ends: 600 [2021-06-05 14:43:45,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-06-05 14:43:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 435. [2021-06-05 14:43:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.230414746543779) internal successors, (1402), 434 states have internal predecessors, (1402), 0 states have call successors, (0), 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 14:43:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1402 transitions. [2021-06-05 14:43:45,077 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1402 transitions. Word has length 18 [2021-06-05 14:43:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,077 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1402 transitions. [2021-06-05 14:43:45,077 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 14:43:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1402 transitions. [2021-06-05 14:43:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,078 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,078 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:45,079 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 14:43:45,079 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2075176037, now seen corresponding path program 3 times [2021-06-05 14:43:45,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:45,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703292652] [2021-06-05 14:43:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:45,101 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 14:43:45,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:45,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703292652] [2021-06-05 14:43:45,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703292652] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:45,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:45,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:45,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730412415] [2021-06-05 14:43:45,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:45,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:45,102 INFO L87 Difference]: Start difference. First operand 435 states and 1402 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 14:43:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:45,162 INFO L93 Difference]: Finished difference Result 586 states and 1779 transitions. [2021-06-05 14:43:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:45,163 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 14:43:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:45,164 INFO L225 Difference]: With dead ends: 586 [2021-06-05 14:43:45,164 INFO L226 Difference]: Without dead ends: 522 [2021-06-05 14:43:45,164 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-06-05 14:43:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 435. [2021-06-05 14:43:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.2096774193548385) internal successors, (1393), 434 states have internal predecessors, (1393), 0 states have call successors, (0), 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 14:43:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1393 transitions. [2021-06-05 14:43:45,171 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1393 transitions. Word has length 18 [2021-06-05 14:43:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,172 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1393 transitions. [2021-06-05 14:43:45,172 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 14:43:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1393 transitions. [2021-06-05 14:43:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,173 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,173 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:45,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 14:43:45,173 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash -567012709, now seen corresponding path program 4 times [2021-06-05 14:43:45,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:45,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785535827] [2021-06-05 14:43:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:45,195 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 14:43:45,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:45,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785535827] [2021-06-05 14:43:45,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785535827] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:45,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:45,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:43:45,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136881688] [2021-06-05 14:43:45,196 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:45,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:43:45,196 INFO L87 Difference]: Start difference. First operand 435 states and 1393 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 14:43:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:45,226 INFO L93 Difference]: Finished difference Result 512 states and 1579 transitions. [2021-06-05 14:43:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:43:45,227 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 14:43:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:45,228 INFO L225 Difference]: With dead ends: 512 [2021-06-05 14:43:45,228 INFO L226 Difference]: Without dead ends: 502 [2021-06-05 14:43:45,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 14:43:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-06-05 14:43:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 435. [2021-06-05 14:43:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.19815668202765) internal successors, (1388), 434 states have internal predecessors, (1388), 0 states have call successors, (0), 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 14:43:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1388 transitions. [2021-06-05 14:43:45,235 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1388 transitions. Word has length 18 [2021-06-05 14:43:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,235 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1388 transitions. [2021-06-05 14:43:45,235 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 14:43:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1388 transitions. [2021-06-05 14:43:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,236 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,236 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:45,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-05 14:43:45,236 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1494507077, now seen corresponding path program 4 times [2021-06-05 14:43:45,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:45,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067680761] [2021-06-05 14:43:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:45,264 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 14:43:45,264 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:45,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067680761] [2021-06-05 14:43:45,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067680761] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:45,264 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:45,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:45,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136970429] [2021-06-05 14:43:45,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:45,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:45,265 INFO L87 Difference]: Start difference. First operand 435 states and 1388 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 14:43:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:45,322 INFO L93 Difference]: Finished difference Result 565 states and 1707 transitions. [2021-06-05 14:43:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:45,323 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 14:43:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:45,324 INFO L225 Difference]: With dead ends: 565 [2021-06-05 14:43:45,324 INFO L226 Difference]: Without dead ends: 512 [2021-06-05 14:43:45,324 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-06-05 14:43:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 435. [2021-06-05 14:43:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.1889400921658986) internal successors, (1384), 434 states have internal predecessors, (1384), 0 states have call successors, (0), 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 14:43:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1384 transitions. [2021-06-05 14:43:45,332 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1384 transitions. Word has length 18 [2021-06-05 14:43:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,332 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1384 transitions. [2021-06-05 14:43:45,332 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 14:43:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1384 transitions. [2021-06-05 14:43:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,333 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,333 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:45,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-05 14:43:45,334 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1398789765, now seen corresponding path program 1 times [2021-06-05 14:43:45,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:45,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551580498] [2021-06-05 14:43:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:45,358 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 14:43:45,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:45,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551580498] [2021-06-05 14:43:45,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551580498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:45,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:45,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:45,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326587307] [2021-06-05 14:43:45,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:45,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:45,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:45,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:45,361 INFO L87 Difference]: Start difference. First operand 435 states and 1384 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 14:43:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:45,424 INFO L93 Difference]: Finished difference Result 553 states and 1679 transitions. [2021-06-05 14:43:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:45,425 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 14:43:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:45,426 INFO L225 Difference]: With dead ends: 553 [2021-06-05 14:43:45,426 INFO L226 Difference]: Without dead ends: 488 [2021-06-05 14:43:45,426 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-06-05 14:43:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 435. [2021-06-05 14:43:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.1797235023041477) internal successors, (1380), 434 states have internal predecessors, (1380), 0 states have call successors, (0), 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 14:43:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1380 transitions. [2021-06-05 14:43:45,433 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1380 transitions. Word has length 18 [2021-06-05 14:43:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,433 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1380 transitions. [2021-06-05 14:43:45,433 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 14:43:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1380 transitions. [2021-06-05 14:43:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,434 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,434 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:45,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 14:43:45,435 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash -840014107, now seen corresponding path program 3 times [2021-06-05 14:43:45,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:45,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893320332] [2021-06-05 14:43:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:43:45,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:45,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893320332] [2021-06-05 14:43:45,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893320332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:45,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201664732] [2021-06-05 14:43:45,560 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 14:43:45,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 14:43:45,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:45,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 14:43:45,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:45,631 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 15 treesize of output 11 [2021-06-05 14:43:45,632 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:45,636 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 15 treesize of output 11 [2021-06-05 14:43:45,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:45,640 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 15 treesize of output 11 [2021-06-05 14:43:45,641 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:45,644 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 15 treesize of output 11 [2021-06-05 14:43:45,646 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:45,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:45,691 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:43:45,691 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:189, output treesize:161 [2021-06-05 14:43:45,810 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 14:43:45,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201664732] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:45,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:45,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2021-06-05 14:43:45,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136406945] [2021-06-05 14:43:45,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:45,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:45,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:45,813 INFO L87 Difference]: Start difference. First operand 435 states and 1380 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 14:43:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:45,970 INFO L93 Difference]: Finished difference Result 587 states and 1717 transitions. [2021-06-05 14:43:45,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:45,970 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 14:43:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:45,971 INFO L225 Difference]: With dead ends: 587 [2021-06-05 14:43:45,971 INFO L226 Difference]: Without dead ends: 587 [2021-06-05 14:43:45,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 252.4ms TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:43:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-06-05 14:43:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 398. [2021-06-05 14:43:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.146095717884131) internal successors, (1249), 397 states have internal predecessors, (1249), 0 states have call successors, (0), 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 14:43:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1249 transitions. [2021-06-05 14:43:45,977 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1249 transitions. Word has length 18 [2021-06-05 14:43:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:45,978 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1249 transitions. [2021-06-05 14:43:45,978 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 14:43:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1249 transitions. [2021-06-05 14:43:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:45,979 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:45,979 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:46,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:43:46,201 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1838197275, now seen corresponding path program 3 times [2021-06-05 14:43:46,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:46,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446850963] [2021-06-05 14:43:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:46,235 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 14:43:46,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:46,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446850963] [2021-06-05 14:43:46,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446850963] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:46,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:46,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:46,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049710635] [2021-06-05 14:43:46,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:46,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:46,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:46,236 INFO L87 Difference]: Start difference. First operand 398 states and 1249 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 14:43:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:46,335 INFO L93 Difference]: Finished difference Result 670 states and 1949 transitions. [2021-06-05 14:43:46,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:46,335 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 14:43:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:46,336 INFO L225 Difference]: With dead ends: 670 [2021-06-05 14:43:46,336 INFO L226 Difference]: Without dead ends: 606 [2021-06-05 14:43:46,337 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-06-05 14:43:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 398. [2021-06-05 14:43:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.123425692695214) internal successors, (1240), 397 states have internal predecessors, (1240), 0 states have call successors, (0), 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 14:43:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1240 transitions. [2021-06-05 14:43:46,344 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1240 transitions. Word has length 18 [2021-06-05 14:43:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:46,344 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1240 transitions. [2021-06-05 14:43:46,344 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 14:43:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1240 transitions. [2021-06-05 14:43:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:46,345 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:46,345 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:46,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 14:43:46,345 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -197121861, now seen corresponding path program 4 times [2021-06-05 14:43:46,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:46,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567664090] [2021-06-05 14:43:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:46,372 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 14:43:46,372 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:46,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567664090] [2021-06-05 14:43:46,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567664090] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:46,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:46,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:46,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767748376] [2021-06-05 14:43:46,373 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:46,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:46,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:46,374 INFO L87 Difference]: Start difference. First operand 398 states and 1240 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 14:43:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:46,476 INFO L93 Difference]: Finished difference Result 625 states and 1812 transitions. [2021-06-05 14:43:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:46,476 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 14:43:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:46,477 INFO L225 Difference]: With dead ends: 625 [2021-06-05 14:43:46,477 INFO L226 Difference]: Without dead ends: 580 [2021-06-05 14:43:46,477 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-06-05 14:43:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 402. [2021-06-05 14:43:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.1321695760598502) internal successors, (1256), 401 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 14:43:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1256 transitions. [2021-06-05 14:43:46,484 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1256 transitions. Word has length 18 [2021-06-05 14:43:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:46,484 INFO L482 AbstractCegarLoop]: Abstraction has 402 states and 1256 transitions. [2021-06-05 14:43:46,484 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 14:43:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1256 transitions. [2021-06-05 14:43:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:46,485 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:46,485 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:46,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 14:43:46,485 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash -951688453, now seen corresponding path program 4 times [2021-06-05 14:43:46,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:46,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845889629] [2021-06-05 14:43:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:43:46,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:46,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845889629] [2021-06-05 14:43:46,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845889629] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:46,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429962041] [2021-06-05 14:43:46,548 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 14:43:46,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:43:46,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:46,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 14:43:46,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:46,679 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 16 treesize of output 12 [2021-06-05 14:43:46,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:46,723 INFO L628 ElimStorePlain]: treesize reduction 68, result has 51.4 percent of original size [2021-06-05 14:43:46,726 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 7 treesize of output 5 [2021-06-05 14:43:46,728 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:46,731 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 7 treesize of output 5 [2021-06-05 14:43:46,732 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:46,734 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 16 treesize of output 12 [2021-06-05 14:43:46,736 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:46,738 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 7 treesize of output 5 [2021-06-05 14:43:46,740 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:46,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:46,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:43:46,757 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:42 [2021-06-05 14:43:46,793 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 14:43:46,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429962041] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:46,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:46,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2021-06-05 14:43:46,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77448517] [2021-06-05 14:43:46,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:46,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:46,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:46,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:46,794 INFO L87 Difference]: Start difference. First operand 402 states and 1256 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 14:43:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:46,874 INFO L93 Difference]: Finished difference Result 517 states and 1522 transitions. [2021-06-05 14:43:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:46,874 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 14:43:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:46,875 INFO L225 Difference]: With dead ends: 517 [2021-06-05 14:43:46,875 INFO L226 Difference]: Without dead ends: 507 [2021-06-05 14:43:46,875 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 88.9ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:43:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-06-05 14:43:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 402. [2021-06-05 14:43:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.119700748129676) internal successors, (1251), 401 states have internal predecessors, (1251), 0 states have call successors, (0), 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 14:43:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1251 transitions. [2021-06-05 14:43:46,882 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1251 transitions. Word has length 18 [2021-06-05 14:43:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:46,882 INFO L482 AbstractCegarLoop]: Abstraction has 402 states and 1251 transitions. [2021-06-05 14:43:46,882 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 14:43:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1251 transitions. [2021-06-05 14:43:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:46,883 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:46,883 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:47,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:43:47,085 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -22925917, now seen corresponding path program 3 times [2021-06-05 14:43:47,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:47,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592110497] [2021-06-05 14:43:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:47,123 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 14:43:47,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:47,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592110497] [2021-06-05 14:43:47,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592110497] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:47,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:47,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:47,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571938974] [2021-06-05 14:43:47,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:47,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:47,124 INFO L87 Difference]: Start difference. First operand 402 states and 1251 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 14:43:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:47,228 INFO L93 Difference]: Finished difference Result 660 states and 1900 transitions. [2021-06-05 14:43:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:47,228 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 14:43:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:47,229 INFO L225 Difference]: With dead ends: 660 [2021-06-05 14:43:47,229 INFO L226 Difference]: Without dead ends: 607 [2021-06-05 14:43:47,230 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-06-05 14:43:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 386. [2021-06-05 14:43:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.083116883116883) internal successors, (1187), 385 states have internal predecessors, (1187), 0 states have call successors, (0), 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 14:43:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1187 transitions. [2021-06-05 14:43:47,236 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1187 transitions. Word has length 18 [2021-06-05 14:43:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:47,236 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1187 transitions. [2021-06-05 14:43:47,237 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 14:43:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1187 transitions. [2021-06-05 14:43:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:47,237 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:47,238 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:47,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-05 14:43:47,238 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1939653789, now seen corresponding path program 5 times [2021-06-05 14:43:47,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:47,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451925259] [2021-06-05 14:43:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:47,268 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 14:43:47,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:47,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451925259] [2021-06-05 14:43:47,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451925259] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:47,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:47,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:47,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287005916] [2021-06-05 14:43:47,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:47,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:47,270 INFO L87 Difference]: Start difference. First operand 386 states and 1187 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 14:43:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:47,370 INFO L93 Difference]: Finished difference Result 656 states and 1884 transitions. [2021-06-05 14:43:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:47,370 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 14:43:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:47,371 INFO L225 Difference]: With dead ends: 656 [2021-06-05 14:43:47,372 INFO L226 Difference]: Without dead ends: 603 [2021-06-05 14:43:47,372 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-06-05 14:43:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2021-06-05 14:43:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.0727272727272728) internal successors, (1183), 385 states have internal predecessors, (1183), 0 states have call successors, (0), 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 14:43:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1183 transitions. [2021-06-05 14:43:47,379 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1183 transitions. Word has length 18 [2021-06-05 14:43:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:47,380 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1183 transitions. [2021-06-05 14:43:47,380 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 14:43:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1183 transitions. [2021-06-05 14:43:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:47,381 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:47,381 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:47,381 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-05 14:43:47,381 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:47,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:47,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1583210651, now seen corresponding path program 6 times [2021-06-05 14:43:47,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:47,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196116351] [2021-06-05 14:43:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:47,432 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 14:43:47,432 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:47,432 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196116351] [2021-06-05 14:43:47,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196116351] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:47,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:47,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:47,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466255101] [2021-06-05 14:43:47,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:47,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:47,433 INFO L87 Difference]: Start difference. First operand 386 states and 1183 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:47,582 INFO L93 Difference]: Finished difference Result 614 states and 1768 transitions. [2021-06-05 14:43:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:43:47,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:47,583 INFO L225 Difference]: With dead ends: 614 [2021-06-05 14:43:47,583 INFO L226 Difference]: Without dead ends: 569 [2021-06-05 14:43:47,583 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 80.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:43:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-06-05 14:43:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 366. [2021-06-05 14:43:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.021917808219178) internal successors, (1103), 365 states have internal predecessors, (1103), 0 states have call successors, (0), 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 14:43:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1103 transitions. [2021-06-05 14:43:47,589 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1103 transitions. Word has length 18 [2021-06-05 14:43:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:47,589 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1103 transitions. [2021-06-05 14:43:47,589 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1103 transitions. [2021-06-05 14:43:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:47,590 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:47,590 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:47,590 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-05 14:43:47,590 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash -239277275, now seen corresponding path program 4 times [2021-06-05 14:43:47,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:47,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944452972] [2021-06-05 14:43:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:47,623 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 14:43:47,623 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:47,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944452972] [2021-06-05 14:43:47,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944452972] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:47,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:47,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:43:47,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232001510] [2021-06-05 14:43:47,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:43:47,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:47,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:43:47,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:43:47,624 INFO L87 Difference]: Start difference. First operand 366 states and 1103 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 14:43:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:47,736 INFO L93 Difference]: Finished difference Result 594 states and 1712 transitions. [2021-06-05 14:43:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:47,737 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 14:43:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:47,738 INFO L225 Difference]: With dead ends: 594 [2021-06-05 14:43:47,738 INFO L226 Difference]: Without dead ends: 529 [2021-06-05 14:43:47,738 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-06-05 14:43:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 366. [2021-06-05 14:43:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.010958904109589) internal successors, (1099), 365 states have internal predecessors, (1099), 0 states have call successors, (0), 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 14:43:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1099 transitions. [2021-06-05 14:43:47,744 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1099 transitions. Word has length 18 [2021-06-05 14:43:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:47,744 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1099 transitions. [2021-06-05 14:43:47,744 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 14:43:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1099 transitions. [2021-06-05 14:43:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:47,745 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:47,745 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:47,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-05 14:43:47,745 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2092843429, now seen corresponding path program 5 times [2021-06-05 14:43:47,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:47,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89194889] [2021-06-05 14:43:47,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:47,796 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 14:43:47,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:47,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89194889] [2021-06-05 14:43:47,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89194889] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:47,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:47,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:47,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249255435] [2021-06-05 14:43:47,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:47,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:47,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:47,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:47,797 INFO L87 Difference]: Start difference. First operand 366 states and 1099 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:47,876 INFO L93 Difference]: Finished difference Result 697 states and 2027 transitions. [2021-06-05 14:43:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:47,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:47,878 INFO L225 Difference]: With dead ends: 697 [2021-06-05 14:43:47,878 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 14:43:47,878 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 14:43:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 366. [2021-06-05 14:43:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.9972602739726026) internal successors, (1094), 365 states have internal predecessors, (1094), 0 states have call successors, (0), 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 14:43:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1094 transitions. [2021-06-05 14:43:47,885 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1094 transitions. Word has length 18 [2021-06-05 14:43:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:47,885 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1094 transitions. [2021-06-05 14:43:47,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1094 transitions. [2021-06-05 14:43:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:47,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:47,886 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:47,886 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-05 14:43:47,886 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1216302301, now seen corresponding path program 2 times [2021-06-05 14:43:47,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:47,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770533956] [2021-06-05 14:43:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:47,964 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 14:43:47,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:47,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770533956] [2021-06-05 14:43:47,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770533956] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:47,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:47,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:43:47,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806423060] [2021-06-05 14:43:47,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:43:47,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:43:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:43:47,966 INFO L87 Difference]: Start difference. First operand 366 states and 1094 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 14:43:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:48,049 INFO L93 Difference]: Finished difference Result 719 states and 2083 transitions. [2021-06-05 14:43:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:43:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 14:43:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:48,051 INFO L225 Difference]: With dead ends: 719 [2021-06-05 14:43:48,051 INFO L226 Difference]: Without dead ends: 654 [2021-06-05 14:43:48,051 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.2ms TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:43:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-06-05 14:43:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 366. [2021-06-05 14:43:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.989041095890411) internal successors, (1091), 365 states have internal predecessors, (1091), 0 states have call successors, (0), 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 14:43:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1091 transitions. [2021-06-05 14:43:48,058 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1091 transitions. Word has length 18 [2021-06-05 14:43:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:48,058 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1091 transitions. [2021-06-05 14:43:48,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 14:43:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1091 transitions. [2021-06-05 14:43:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:48,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:48,058 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:48,059 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-05 14:43:48,059 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -797807489, now seen corresponding path program 6 times [2021-06-05 14:43:48,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:48,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513052890] [2021-06-05 14:43:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:48,116 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 14:43:48,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:48,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513052890] [2021-06-05 14:43:48,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513052890] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:48,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:43:48,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 14:43:48,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139745958] [2021-06-05 14:43:48,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 14:43:48,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 14:43:48,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:48,118 INFO L87 Difference]: Start difference. First operand 366 states and 1091 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:48,178 INFO L93 Difference]: Finished difference Result 639 states and 1854 transitions. [2021-06-05 14:43:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:43:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:48,179 INFO L225 Difference]: With dead ends: 639 [2021-06-05 14:43:48,180 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 14:43:48,180 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.6ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-05 14:43:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 14:43:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 359. [2021-06-05 14:43:48,185 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 14:43:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1077 transitions. [2021-06-05 14:43:48,186 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1077 transitions. Word has length 18 [2021-06-05 14:43:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:48,186 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1077 transitions. [2021-06-05 14:43:48,186 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 14:43:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1077 transitions. [2021-06-05 14:43:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:48,187 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:48,187 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:48,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-05 14:43:48,187 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2015137509, now seen corresponding path program 5 times [2021-06-05 14:43:48,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:48,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400230692] [2021-06-05 14:43:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:43:48,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:48,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400230692] [2021-06-05 14:43:48,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400230692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:48,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200013366] [2021-06-05 14:43:48,248 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 14:43:48,278 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:43:48,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:48,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 14:43:48,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:48,341 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 16 treesize of output 12 [2021-06-05 14:43:48,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,344 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 15 treesize of output 11 [2021-06-05 14:43:48,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:48,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:43:48,348 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:16 [2021-06-05 14:43:48,373 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 14:43:48,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200013366] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:48,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:48,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-06-05 14:43:48,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475587109] [2021-06-05 14:43:48,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:48,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:43:48,375 INFO L87 Difference]: Start difference. First operand 359 states and 1077 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 14:43:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:48,405 INFO L93 Difference]: Finished difference Result 384 states and 1115 transitions. [2021-06-05 14:43:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:43:48,405 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 14:43:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:48,406 INFO L225 Difference]: With dead ends: 384 [2021-06-05 14:43:48,406 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 14:43:48,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 77.2ms TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:43:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 14:43:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2021-06-05 14:43:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.00561797752809) internal successors, (1070), 356 states have internal predecessors, (1070), 0 states have call successors, (0), 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 14:43:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1070 transitions. [2021-06-05 14:43:48,411 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1070 transitions. Word has length 18 [2021-06-05 14:43:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:48,411 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1070 transitions. [2021-06-05 14:43:48,411 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 14:43:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1070 transitions. [2021-06-05 14:43:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:48,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:48,412 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:48,613 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2021-06-05 14:43:48,614 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 325544227, now seen corresponding path program 5 times [2021-06-05 14:43:48,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:48,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691595384] [2021-06-05 14:43:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:43:48,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:48,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691595384] [2021-06-05 14:43:48,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691595384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:48,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001794285] [2021-06-05 14:43:48,681 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 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 14:43:48,729 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:43:48,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:48,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:43:48,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:48,877 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-06-05 14:43:48,943 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 7 treesize of output 5 [2021-06-05 14:43:48,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,947 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 7 treesize of output 5 [2021-06-05 14:43:48,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,950 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 7 treesize of output 5 [2021-06-05 14:43:48,952 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,955 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 25 treesize of output 19 [2021-06-05 14:43:48,956 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,958 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 25 treesize of output 19 [2021-06-05 14:43:48,959 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:48,988 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:48,991 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 25 treesize of output 19 [2021-06-05 14:43:49,001 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:49,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:49,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:43:49,036 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:178, output treesize:130 [2021-06-05 14:43:49,117 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 17 treesize of output 13 [2021-06-05 14:43:49,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:49,123 INFO L628 ElimStorePlain]: treesize reduction 13, result has 7.1 percent of original size [2021-06-05 14:43:49,123 INFO L518 ElimStorePlain]: Eliminatee last_index_of_7 vanished before elimination [2021-06-05 14:43:49,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:43:49,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2021-06-05 14:43:49,132 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 14:43:49,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001794285] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:49,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:49,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-06-05 14:43:49,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667703453] [2021-06-05 14:43:49,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:49,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:49,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:43:49,133 INFO L87 Difference]: Start difference. First operand 357 states and 1070 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 14:43:49,339 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-06-05 14:43:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:49,372 INFO L93 Difference]: Finished difference Result 422 states and 1218 transitions. [2021-06-05 14:43:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:43:49,372 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 14:43:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:49,373 INFO L225 Difference]: With dead ends: 422 [2021-06-05 14:43:49,373 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:43:49,373 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 388.8ms TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:43:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:43:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 359. [2021-06-05 14:43:49,379 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 14:43:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1073 transitions. [2021-06-05 14:43:49,380 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1073 transitions. Word has length 18 [2021-06-05 14:43:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:49,380 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1073 transitions. [2021-06-05 14:43:49,380 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 14:43:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1073 transitions. [2021-06-05 14:43:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:43:49,381 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:49,381 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:43:49,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:43:49,601 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash -954484251, now seen corresponding path program 6 times [2021-06-05 14:43:49,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:49,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564359699] [2021-06-05 14:43:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:43:49,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:49,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564359699] [2021-06-05 14:43:49,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564359699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:49,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412031891] [2021-06-05 14:43:49,679 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 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 14:43:49,714 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 14:43:49,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:49,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:43:49,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:49,889 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-06-05 14:43:49,986 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 25 treesize of output 19 [2021-06-05 14:43:49,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:50,033 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 25 treesize of output 19 [2021-06-05 14:43:50,034 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,038 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 7 treesize of output 5 [2021-06-05 14:43:50,039 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,043 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 7 treesize of output 5 [2021-06-05 14:43:50,044 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,047 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 7 treesize of output 5 [2021-06-05 14:43:50,048 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,050 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 25 treesize of output 19 [2021-06-05 14:43:50,051 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:43:50,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:43:50,085 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:174, output treesize:119 [2021-06-05 14:43:50,197 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 17 treesize of output 13 [2021-06-05 14:43:50,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,200 INFO L628 ElimStorePlain]: treesize reduction 36, result has 2.7 percent of original size [2021-06-05 14:43:50,201 INFO L518 ElimStorePlain]: Eliminatee index_of_8 vanished before elimination [2021-06-05 14:43:50,201 INFO L518 ElimStorePlain]: Eliminatee last_index_of_7 vanished before elimination [2021-06-05 14:43:50,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:43:50,201 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:1 [2021-06-05 14:43:50,208 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 14:43:50,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412031891] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:43:50,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 14:43:50,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-06-05 14:43:50,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810324839] [2021-06-05 14:43:50,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:43:50,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:43:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:43:50,209 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 14:43:50,410 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 14:43:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:50,421 INFO L93 Difference]: Finished difference Result 369 states and 1088 transitions. [2021-06-05 14:43:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:43:50,421 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 14:43:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:50,422 INFO L225 Difference]: With dead ends: 369 [2021-06-05 14:43:50,422 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 14:43:50,422 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 439.1ms TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:43:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 14:43:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-06-05 14:43:50,426 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 14:43:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1069 transitions. [2021-06-05 14:43:50,427 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1069 transitions. Word has length 18 [2021-06-05 14:43:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:50,427 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1069 transitions. [2021-06-05 14:43:50,427 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 14:43:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1069 transitions. [2021-06-05 14:43:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:43:50,427 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:50,427 INFO L521 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 14:43:50,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-06-05 14:43:50,628 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1134434440, now seen corresponding path program 1 times [2021-06-05 14:43:50,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:50,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9574297] [2021-06-05 14:43:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:43:50,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:50,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9574297] [2021-06-05 14:43:50,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9574297] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:50,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542149995] [2021-06-05 14:43:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:43:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:50,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:43:50,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:43:50,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542149995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:50,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:43:50,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:43:50,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887388106] [2021-06-05 14:43:50,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:43:50,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:43:50,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:43:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:43:50,920 INFO L87 Difference]: Start difference. First operand 357 states and 1069 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:43:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:43:51,583 INFO L93 Difference]: Finished difference Result 674 states and 1943 transitions. [2021-06-05 14:43:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 14:43:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:43:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:43:51,584 INFO L225 Difference]: With dead ends: 674 [2021-06-05 14:43:51,584 INFO L226 Difference]: Without dead ends: 559 [2021-06-05 14:43:51,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 554.1ms TimeCoverageRelationStatistics Valid=205, Invalid=787, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:43:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-06-05 14:43:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 425. [2021-06-05 14:43:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.0377358490566038) internal successors, (1288), 424 states have internal predecessors, (1288), 0 states have call successors, (0), 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 14:43:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1288 transitions. [2021-06-05 14:43:51,589 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1288 transitions. Word has length 20 [2021-06-05 14:43:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:43:51,589 INFO L482 AbstractCegarLoop]: Abstraction has 425 states and 1288 transitions. [2021-06-05 14:43:51,589 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:43:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1288 transitions. [2021-06-05 14:43:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:43:51,590 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:43:51,590 INFO L521 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 14:43:51,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2021-06-05 14:43:51,798 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:43:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:43:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1560950788, now seen corresponding path program 2 times [2021-06-05 14:43:51,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:43:51,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512916534] [2021-06-05 14:43:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:43:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:43:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:43:51,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:43:51,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512916534] [2021-06-05 14:43:51,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512916534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:43:51,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734929524] [2021-06-05 14:43:51,882 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 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 14:43:51,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:43:51,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:43:51,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:43:51,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:43:55,082 WARN L205 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2021-06-05 14:43:55,280 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 14:44:11,342 WARN L205 SmtUtils]: Spent 16.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 64 [2021-06-05 14:44:59,447 WARN L205 SmtUtils]: Spent 47.71 s on a formula simplification. DAG size of input: 46 DAG size of output: 57 [2021-06-05 14:44:59,722 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:44:59,870 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:45:00,122 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:45:01,061 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:45:01,732 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:45:53,181 WARN L205 SmtUtils]: Spent 51.45 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-06-05 14:47:13,400 WARN L205 SmtUtils]: Spent 1.33 m on a formula simplification. DAG size of input: 67 DAG size of output: 68 [2021-06-05 14:47:13,891 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:47:14,074 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:47:14,233 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:47:15,000 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:47:15,198 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:47:15,616 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:47:16,587 WARN L205 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:47:16,878 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:47:22,540 WARN L205 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 57 DAG size of output: 69 [2021-06-05 14:47:22,894 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 14:47:23,104 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:47:23,492 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:47:23,924 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-06-05 14:47:49,592 WARN L205 SmtUtils]: Spent 25.64 s on a formula simplification. DAG size of input: 46 DAG size of output: 50 [2021-06-05 14:47:49,984 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 14:47:51,272 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:47:52,165 WARN L205 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:47:52,347 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:47:52,490 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 14:47:53,050 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:48:06,893 WARN L205 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 54 DAG size of output: 57 [2021-06-05 14:53:37,827 WARN L205 SmtUtils]: Spent 5.51 m on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2021-06-05 14:53:38,460 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:53:39,090 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:53:40,283 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:53:40,743 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2021-06-05 14:53:43,888 WARN L205 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:54:49,988 WARN L205 SmtUtils]: Spent 1.10 m on a formula simplification. DAG size of input: 62 DAG size of output: 69 [2021-06-05 14:54:50,665 WARN L205 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 14:54:50,863 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:54:51,268 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:54:51,684 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 14:54:53,118 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 14:54:53,555 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:54:55,103 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:54:59,060 WARN L205 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:00,199 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:01,096 WARN L205 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:01,387 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:01,667 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:55:02,475 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 14:55:02,733 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:55:02,864 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 14:55:03,628 WARN L205 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 14:55:04,219 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:04,352 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-06-05 14:55:04,704 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:55:04,867 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:05,135 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:55:05,245 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:55:05,644 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:55:06,349 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:55:07,068 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:55:17,527 WARN L205 SmtUtils]: Spent 10.46 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-06-05 14:55:17,747 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 14:55:18,536 WARN L205 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:19,868 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:55:20,850 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:21,786 WARN L205 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:22,096 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:22,462 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:33,690 WARN L205 SmtUtils]: Spent 11.23 s on a formula simplification. DAG size of input: 51 DAG size of output: 62 [2021-06-05 14:55:33,844 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 14:55:34,169 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:55:34,521 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:34,809 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:55:35,157 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:36,015 WARN L205 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:36,410 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:36,709 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2021-06-05 14:55:37,424 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:55:37,532 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:55:37,816 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:55:38,551 WARN L205 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2021-06-05 14:55:39,387 WARN L205 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 14:55:40,528 WARN L205 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:41,097 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2021-06-05 14:55:42,372 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:55:43,115 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:43,487 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:55:43,998 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:55:44,629 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2021-06-05 14:55:45,361 WARN L205 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-06-05 14:55:45,714 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:55:45,850 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:56:19,194 WARN L205 SmtUtils]: Spent 33.34 s on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2021-06-05 14:56:19,892 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2021-06-05 14:56:24,515 WARN L205 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2021-06-05 14:56:24,835 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 14:56:25,348 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 14:56:25,683 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 14:56:25,716 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1, char_at_5], 1=[char_at_1]} [2021-06-05 14:56:25,724 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,732 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 14:56:25,733 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,741 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,741 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,747 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,748 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,754 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,754 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,760 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,761 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,768 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,768 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,775 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,776 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,784 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,791 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,799 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 14:56:25,800 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,813 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 14:56:25,814 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,821 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,821 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,829 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,830 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,838 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,839 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,846 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,847 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,853 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,854 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,862 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,863 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,870 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,871 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,878 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,879 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,884 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,885 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,892 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,893 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,901 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 14:56:25,902 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,908 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,909 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,916 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,917 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,923 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,923 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,931 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,932 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,939 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,945 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,945 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,951 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 14:56:25,952 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,957 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,958 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,964 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,965 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,974 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,975 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,982 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 14:56:25,983 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,989 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:25,990 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:25,997 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 11 treesize of output 7 [2021-06-05 14:56:25,998 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,004 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,005 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,012 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,013 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,020 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,027 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,034 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,041 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,042 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,048 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,048 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,055 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,055 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,062 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,063 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,069 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,070 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,076 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,076 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,083 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,084 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,091 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,091 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,096 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,096 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,102 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,103 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,108 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,109 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,113 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,114 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,119 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,120 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,127 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,127 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,132 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,133 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,137 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,137 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,142 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,142 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,146 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,147 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,151 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,151 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,156 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,156 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,160 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,161 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,165 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,168 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,169 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,173 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,173 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,178 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 14:56:26,179 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,183 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,184 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,200 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,201 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,206 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,207 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,212 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,218 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,226 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,231 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,232 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,236 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,237 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,241 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,244 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,245 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,249 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,249 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,253 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,254 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,259 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,264 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,264 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,269 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,270 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,405 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-06-05 14:56:26,405 INFO L628 ElimStorePlain]: treesize reduction 199, result has 48.3 percent of original size [2021-06-05 14:56:26,408 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 14:56:26,409 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:26,470 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 14:56:26,471 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,485 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,488 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 14:56:26,489 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,491 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:26,492 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,494 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 14:56:26,495 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:26,539 INFO L628 ElimStorePlain]: treesize reduction 48, result has 55.1 percent of original size [2021-06-05 14:56:26,541 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:56:26,541 INFO L247 ElimStorePlain]: Needed 88 recursive calls to eliminate 4 variables, input treesize:3329, output treesize:35 [2021-06-05 14:56:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:26,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734929524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:26,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:26,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:56:26,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114741119] [2021-06-05 14:56:26,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:56:26,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:56:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:56:26,656 INFO L87 Difference]: Start difference. First operand 425 states and 1288 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 14:56:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:27,133 INFO L93 Difference]: Finished difference Result 589 states and 1766 transitions. [2021-06-05 14:56:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:56:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 14:56:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:27,134 INFO L225 Difference]: With dead ends: 589 [2021-06-05 14:56:27,134 INFO L226 Difference]: Without dead ends: 556 [2021-06-05 14:56:27,134 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 536.1ms TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-06-05 14:56:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 431. [2021-06-05 14:56:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.067441860465116) internal successors, (1319), 430 states have internal predecessors, (1319), 0 states have call successors, (0), 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 14:56:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1319 transitions. [2021-06-05 14:56:27,141 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1319 transitions. Word has length 20 [2021-06-05 14:56:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:27,141 INFO L482 AbstractCegarLoop]: Abstraction has 431 states and 1319 transitions. [2021-06-05 14:56:27,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 14:56:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1319 transitions. [2021-06-05 14:56:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:27,142 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:27,142 INFO L521 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 14:56:27,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:27,359 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1861118922, now seen corresponding path program 3 times [2021-06-05 14:56:27,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:27,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453465907] [2021-06-05 14:56:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:27,682 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 14:56:27,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:27,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453465907] [2021-06-05 14:56:27,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453465907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:27,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396075837] [2021-06-05 14:56:27,682 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 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 14:56:27,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:56:27,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:27,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:56:27,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:27,906 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 11 treesize of output 7 [2021-06-05 14:56:27,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,912 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 14:56:27,913 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,916 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,917 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,920 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 14:56:27,921 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,924 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,925 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,927 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,928 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,931 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 14:56:27,932 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,936 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,939 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,942 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,942 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,945 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 14:56:27,947 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,954 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 14:56:27,955 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,959 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 11 treesize of output 7 [2021-06-05 14:56:27,960 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,963 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,964 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,966 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,967 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,970 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 14:56:27,971 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,973 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,974 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,978 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,978 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,982 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,985 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,985 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:27,987 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:27,988 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:28,080 INFO L628 ElimStorePlain]: treesize reduction 60, result has 63.6 percent of original size [2021-06-05 14:56:28,084 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2021-06-05 14:56:28,084 INFO L247 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:738, output treesize:102 [2021-06-05 14:56:28,220 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:28,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:28,260 INFO L628 ElimStorePlain]: treesize reduction 70, result has 37.5 percent of original size [2021-06-05 14:56:28,260 INFO L518 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2021-06-05 14:56:28,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 14:56:28,262 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:138, output treesize:42 [2021-06-05 14:56:29,240 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9, v_prenex_6], 1=[char_at_5]} [2021-06-05 14:56:29,246 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 14:56:29,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,252 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,253 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,259 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,263 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,263 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,269 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 14:56:29,270 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,275 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,281 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,287 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,292 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 14:56:29,293 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,298 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,299 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,304 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,305 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,309 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,310 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,315 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,316 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,320 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,320 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,325 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,326 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,331 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 14:56:29,332 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,337 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,337 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,342 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,343 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,347 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,348 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,352 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,353 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,358 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,362 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,363 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,367 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,368 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,372 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,372 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,376 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,377 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,381 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,381 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,385 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,385 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,389 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,390 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,395 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,399 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,400 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,403 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,404 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,407 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,408 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,412 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,412 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,416 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,417 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,419 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,420 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,422 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,423 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,426 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,426 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,429 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,429 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,545 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:56:29,545 INFO L628 ElimStorePlain]: treesize reduction 24, result has 88.8 percent of original size [2021-06-05 14:56:29,548 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 14:56:29,550 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,552 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 14:56:29,553 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,617 INFO L628 ElimStorePlain]: treesize reduction 61, result has 63.5 percent of original size [2021-06-05 14:56:29,620 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 14:56:29,621 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,623 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:29,623 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,625 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 14:56:29,626 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:29,653 INFO L628 ElimStorePlain]: treesize reduction 22, result has 66.2 percent of original size [2021-06-05 14:56:29,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:56:29,654 INFO L247 ElimStorePlain]: Needed 44 recursive calls to eliminate 5 variables, input treesize:1615, output treesize:20 [2021-06-05 14:56:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:29,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396075837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:29,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:29,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2021-06-05 14:56:29,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526973389] [2021-06-05 14:56:29,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:56:29,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:56:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:56:29,710 INFO L87 Difference]: Start difference. First operand 431 states and 1319 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 14:56:30,277 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2021-06-05 14:56:30,551 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-06-05 14:56:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:30,879 INFO L93 Difference]: Finished difference Result 693 states and 2055 transitions. [2021-06-05 14:56:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:56:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 14:56:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:30,880 INFO L225 Difference]: With dead ends: 693 [2021-06-05 14:56:30,880 INFO L226 Difference]: Without dead ends: 617 [2021-06-05 14:56:30,881 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1147.8ms TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:56:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-06-05 14:56:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 463. [2021-06-05 14:56:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 3.069264069264069) internal successors, (1418), 462 states have internal predecessors, (1418), 0 states have call successors, (0), 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 14:56:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1418 transitions. [2021-06-05 14:56:30,886 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1418 transitions. Word has length 20 [2021-06-05 14:56:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:30,886 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1418 transitions. [2021-06-05 14:56:30,886 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 14:56:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1418 transitions. [2021-06-05 14:56:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:30,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:30,886 INFO L521 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 14:56:31,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:31,087 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1982079440, now seen corresponding path program 4 times [2021-06-05 14:56:31,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:31,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635705503] [2021-06-05 14:56:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:31,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:31,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635705503] [2021-06-05 14:56:31,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635705503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:31,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472374065] [2021-06-05 14:56:31,188 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 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 14:56:31,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:56:31,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:31,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:56:31,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:31,382 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 14:56:31,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472374065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:31,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:31,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:56:31,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892951847] [2021-06-05 14:56:31,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:56:31,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:56:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:56:31,383 INFO L87 Difference]: Start difference. First operand 463 states and 1418 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:32,587 INFO L93 Difference]: Finished difference Result 1066 states and 3143 transitions. [2021-06-05 14:56:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 14:56:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:32,589 INFO L225 Difference]: With dead ends: 1066 [2021-06-05 14:56:32,589 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 14:56:32,589 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1030.5ms TimeCoverageRelationStatistics Valid=301, Invalid=1505, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 14:56:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 14:56:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 505. [2021-06-05 14:56:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.1011904761904763) internal successors, (1563), 504 states have internal predecessors, (1563), 0 states have call successors, (0), 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 14:56:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1563 transitions. [2021-06-05 14:56:32,596 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1563 transitions. Word has length 20 [2021-06-05 14:56:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:32,597 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1563 transitions. [2021-06-05 14:56:32,597 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1563 transitions. [2021-06-05 14:56:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:32,598 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:32,598 INFO L521 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 14:56:32,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable715 [2021-06-05 14:56:32,818 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1695565943, now seen corresponding path program 1 times [2021-06-05 14:56:32,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:32,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529804365] [2021-06-05 14:56:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:32,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:32,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529804365] [2021-06-05 14:56:32,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529804365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:32,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319222744] [2021-06-05 14:56:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 14:56:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:32,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:32,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:32,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:32,989 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:32,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:32,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:32,996 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 14:56:32,997 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:32,999 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,003 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,007 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,008 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,011 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,015 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,018 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,018 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,021 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,021 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,023 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,024 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,026 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,028 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,029 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,031 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,031 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,033 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,035 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,036 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,039 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,041 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,042 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,044 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,044 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,096 INFO L628 ElimStorePlain]: treesize reduction 25, result has 73.4 percent of original size [2021-06-05 14:56:33,097 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:33,097 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:595, output treesize:69 [2021-06-05 14:56:33,496 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_1]} [2021-06-05 14:56:33,501 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,502 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,505 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,506 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,511 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,511 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,515 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,516 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,521 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,521 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,526 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,529 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,530 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,534 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,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, 1 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 14:56:33,539 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,542 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,542 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,545 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,546 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,549 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,550 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,554 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,558 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 14:56:33,559 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,562 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,562 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,566 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,566 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,569 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,570 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,573 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,574 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,577 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,577 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,580 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,581 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,585 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,585 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,590 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,594 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,597 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,597 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,601 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 14:56:33,601 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,604 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,607 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,610 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,614 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,621 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,625 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,625 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,628 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,629 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,632 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,632 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,635 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,638 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,638 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,640 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,641 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,644 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,644 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,647 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,647 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,649 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,650 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,751 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2021-06-05 14:56:33,751 INFO L628 ElimStorePlain]: treesize reduction 201, result has 34.1 percent of original size [2021-06-05 14:56:33,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:33,755 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:33,758 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,759 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:33,760 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,762 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 14:56:33,763 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,793 INFO L628 ElimStorePlain]: treesize reduction 1, result has 98.0 percent of original size [2021-06-05 14:56:33,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:56:33,794 INFO L247 ElimStorePlain]: Needed 43 recursive calls to eliminate 2 variables, input treesize:1759, output treesize:50 [2021-06-05 14:56:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:33,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319222744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:33,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:33,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:56:33,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047490774] [2021-06-05 14:56:33,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:56:33,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:33,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:56:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:56:33,846 INFO L87 Difference]: Start difference. First operand 505 states and 1563 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:56:34,603 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2021-06-05 14:56:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:34,626 INFO L93 Difference]: Finished difference Result 608 states and 1820 transitions. [2021-06-05 14:56:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:56:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:56:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:34,627 INFO L225 Difference]: With dead ends: 608 [2021-06-05 14:56:34,627 INFO L226 Difference]: Without dead ends: 515 [2021-06-05 14:56:34,627 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 810.5ms TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:56:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-06-05 14:56:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 477. [2021-06-05 14:56:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.1134453781512605) internal successors, (1482), 476 states have internal predecessors, (1482), 0 states have call successors, (0), 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 14:56:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1482 transitions. [2021-06-05 14:56:34,632 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1482 transitions. Word has length 20 [2021-06-05 14:56:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:34,632 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1482 transitions. [2021-06-05 14:56:34,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:56:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1482 transitions. [2021-06-05 14:56:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:34,633 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:34,633 INFO L521 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 14:56:34,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:34,834 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:34,834 INFO L82 PathProgramCache]: Analyzing trace with hash 544548431, now seen corresponding path program 2 times [2021-06-05 14:56:34,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:34,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563923447] [2021-06-05 14:56:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:34,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:34,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563923447] [2021-06-05 14:56:34,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563923447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:34,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791348305] [2021-06-05 14:56:34,950 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 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 14:56:34,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:56:34,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:34,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:34,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:35,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,076 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,078 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 14:56:35,079 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,098 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,101 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,102 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,104 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,105 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,107 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,108 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,112 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,114 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,115 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,118 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,120 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,120 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,123 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,125 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,125 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,127 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,128 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,130 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,130 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,132 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,133 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,135 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,135 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,137 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,137 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,139 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,140 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,183 INFO L628 ElimStorePlain]: treesize reduction 25, result has 73.4 percent of original size [2021-06-05 14:56:35,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:35,184 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:595, output treesize:69 [2021-06-05 14:56:35,675 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_1]} [2021-06-05 14:56:35,679 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,680 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,683 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,684 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,688 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,688 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,695 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,698 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,699 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,703 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,704 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,707 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,708 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,713 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,717 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,718 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,723 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,727 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,727 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,732 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,736 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,740 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,741 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,744 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,745 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,749 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 14:56:35,750 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,754 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,755 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,758 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,759 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,762 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,763 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,766 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,766 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,769 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,771 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,776 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,781 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,785 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,785 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,789 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,790 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,793 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 14:56:35,794 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,798 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,798 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,802 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,802 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,806 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,809 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,810 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,812 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,813 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,815 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,816 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,818 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,819 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,821 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,822 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,824 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,824 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,827 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,827 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,910 INFO L628 ElimStorePlain]: treesize reduction 201, result has 34.1 percent of original size [2021-06-05 14:56:35,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:35,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:35,914 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:35,916 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,918 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:35,919 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,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 13 treesize of output 9 [2021-06-05 14:56:35,922 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,952 INFO L628 ElimStorePlain]: treesize reduction 1, result has 98.0 percent of original size [2021-06-05 14:56:35,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:56:35,953 INFO L247 ElimStorePlain]: Needed 41 recursive calls to eliminate 2 variables, input treesize:1663, output treesize:50 [2021-06-05 14:56:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:36,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791348305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:36,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:36,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:56:36,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451853179] [2021-06-05 14:56:36,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:56:36,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:56:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:56:36,006 INFO L87 Difference]: Start difference. First operand 477 states and 1482 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:56:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:36,696 INFO L93 Difference]: Finished difference Result 628 states and 1884 transitions. [2021-06-05 14:56:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:56:36,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:56:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:36,697 INFO L225 Difference]: With dead ends: 628 [2021-06-05 14:56:36,697 INFO L226 Difference]: Without dead ends: 530 [2021-06-05 14:56:36,698 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 778.5ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:56:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-05 14:56:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 487. [2021-06-05 14:56:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 3.1316872427983538) internal successors, (1522), 486 states have internal predecessors, (1522), 0 states have call successors, (0), 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 14:56:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1522 transitions. [2021-06-05 14:56:36,703 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1522 transitions. Word has length 20 [2021-06-05 14:56:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:36,703 INFO L482 AbstractCegarLoop]: Abstraction has 487 states and 1522 transitions. [2021-06-05 14:56:36,703 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 14:56:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1522 transitions. [2021-06-05 14:56:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:36,704 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:36,704 INFO L521 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 14:56:36,904 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable799 [2021-06-05 14:56:36,905 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -540273895, now seen corresponding path program 3 times [2021-06-05 14:56:36,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:36,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526744755] [2021-06-05 14:56:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:37,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:37,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526744755] [2021-06-05 14:56:37,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526744755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:37,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651305004] [2021-06-05 14:56:37,021 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 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 14:56:37,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:56:37,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:37,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:37,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:37,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,185 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,189 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,193 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,193 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,197 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,198 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,201 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,201 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,204 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,204 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,207 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,208 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,210 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,211 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,218 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,221 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,222 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,225 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,227 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,228 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,230 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,231 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,234 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 14:56:37,235 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,237 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,238 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,240 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,250 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,253 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,253 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,256 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,257 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,259 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,259 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,340 INFO L628 ElimStorePlain]: treesize reduction 54, result has 67.3 percent of original size [2021-06-05 14:56:37,341 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:56:37,341 INFO L247 ElimStorePlain]: Needed 21 recursive calls to eliminate 1 variables, input treesize:786, output treesize:111 [2021-06-05 14:56:37,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,578 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,578 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,582 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,582 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,587 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,591 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,591 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,595 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,596 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:37,601 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,606 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,612 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,617 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:37,621 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,624 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,625 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,630 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,633 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,633 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,638 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,641 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,642 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,645 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,646 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,649 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,650 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,653 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,654 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,658 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,662 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,662 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,665 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,666 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,668 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,669 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,672 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,672 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,675 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,675 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,680 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,682 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,683 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,686 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,686 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,690 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,795 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-06-05 14:56:37,795 INFO L628 ElimStorePlain]: treesize reduction 64, result has 68.8 percent of original size [2021-06-05 14:56:37,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,799 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,801 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:37,804 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,807 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,808 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:37,809 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:37,843 INFO L628 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2021-06-05 14:56:37,844 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:56:37,844 INFO L247 ElimStorePlain]: Needed 35 recursive calls to eliminate 2 variables, input treesize:1077, output treesize:51 [2021-06-05 14:56:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:37,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651305004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:37,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:37,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:56:37,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163795335] [2021-06-05 14:56:37,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:56:37,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:56:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:56:37,897 INFO L87 Difference]: Start difference. First operand 487 states and 1522 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:56:38,180 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2021-06-05 14:56:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:38,387 INFO L93 Difference]: Finished difference Result 629 states and 1892 transitions. [2021-06-05 14:56:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:56:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:56:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:38,388 INFO L225 Difference]: With dead ends: 629 [2021-06-05 14:56:38,388 INFO L226 Difference]: Without dead ends: 533 [2021-06-05 14:56:38,388 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 583.4ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:56:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-06-05 14:56:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 497. [2021-06-05 14:56:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 3.129032258064516) internal successors, (1552), 496 states have internal predecessors, (1552), 0 states have call successors, (0), 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 14:56:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1552 transitions. [2021-06-05 14:56:38,393 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1552 transitions. Word has length 20 [2021-06-05 14:56:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:38,393 INFO L482 AbstractCegarLoop]: Abstraction has 497 states and 1552 transitions. [2021-06-05 14:56:38,393 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:56:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1552 transitions. [2021-06-05 14:56:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:38,394 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:38,394 INFO L521 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 14:56:38,594 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:38,594 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2035077431, now seen corresponding path program 4 times [2021-06-05 14:56:38,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:38,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048382463] [2021-06-05 14:56:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:38,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:38,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048382463] [2021-06-05 14:56:38,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048382463] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:38,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887759388] [2021-06-05 14:56:38,690 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 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 14:56:38,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:56:38,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:38,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:38,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:38,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:38,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:38,788 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:38,793 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,797 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,801 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,801 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,804 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,805 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,824 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,825 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,828 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,829 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:38,833 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,836 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,837 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,840 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,841 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,844 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,844 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,847 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,848 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,851 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,851 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,854 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 14:56:38,855 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,858 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,859 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,861 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,862 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,872 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,873 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,875 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:38,876 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:38,983 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2021-06-05 14:56:38,983 INFO L628 ElimStorePlain]: treesize reduction 54, result has 67.3 percent of original size [2021-06-05 14:56:38,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:56:38,985 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:746, output treesize:111 [2021-06-05 14:56:39,381 INFO L446 ElimStorePlain]: Different costs {0=[char_at_5], 1=[char_at_1]} [2021-06-05 14:56:39,393 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,393 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:39,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,417 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,417 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,427 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 14:56:39,428 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,442 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,443 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,452 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,452 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,462 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,462 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,471 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,472 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,480 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,481 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,489 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,490 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,501 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,502 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:39,513 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,522 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,523 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,533 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,534 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,545 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,546 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,558 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,568 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,569 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,580 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,581 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,590 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,591 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,602 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,612 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,613 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,623 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,633 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,634 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,643 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,644 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,652 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,653 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,664 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,664 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,674 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,675 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,684 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,685 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:39,696 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,706 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,707 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,714 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,714 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,720 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,720 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,728 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,729 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,735 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,736 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,742 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,742 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,749 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,757 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,757 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,763 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,764 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,770 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,770 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,777 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,777 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,785 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,794 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,795 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:39,805 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,811 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,812 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,818 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,818 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,825 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,825 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,832 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,833 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,843 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,843 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,850 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,851 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,857 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,858 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,863 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,864 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,870 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,871 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,878 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,879 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,884 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,885 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,892 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,893 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,899 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,900 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,907 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,908 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,914 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,914 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,921 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,922 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,928 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,929 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,936 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,941 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,942 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,948 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,949 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,955 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,955 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,962 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,968 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,969 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,975 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,975 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,982 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,988 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,988 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:39,994 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:39,995 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,001 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,002 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,008 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,008 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,017 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,027 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,028 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,039 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,040 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,049 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,050 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,083 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,084 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,088 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,094 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 14:56:40,095 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,099 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,100 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,105 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,105 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,109 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,110 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,114 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,114 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,119 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,120 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,124 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,125 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,129 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,129 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,143 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,144 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,148 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,149 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,153 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,154 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,158 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,158 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,162 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,163 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,167 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,167 INFO L550 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,172 INFO L550 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,177 INFO L550 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:40,182 INFO L550 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,186 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,187 INFO L550 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,191 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,191 INFO L550 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,195 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,196 INFO L550 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,200 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,200 INFO L550 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,204 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,205 INFO L550 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,209 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,209 INFO L550 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,213 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,213 INFO L550 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,217 INFO L550 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,221 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,221 INFO L550 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,225 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,225 INFO L550 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,228 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,229 INFO L550 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,232 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,233 INFO L550 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,236 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,236 INFO L550 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,240 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,240 INFO L550 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,244 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,244 INFO L550 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,247 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,248 INFO L550 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,251 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,251 INFO L550 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,254 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,255 INFO L550 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,258 INFO L550 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,261 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,262 INFO L550 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,265 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,266 INFO L550 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,270 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,270 INFO L550 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,273 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,274 INFO L550 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,276 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,277 INFO L550 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,446 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2021-06-05 14:56:40,447 INFO L628 ElimStorePlain]: treesize reduction 208, result has 47.3 percent of original size [2021-06-05 14:56:40,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:40,451 INFO L550 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,453 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 14:56:40,455 INFO L550 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,457 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:40,457 INFO L550 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,460 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 14:56:40,461 INFO L550 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,463 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 14:56:40,464 INFO L550 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,466 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 14:56:40,467 INFO L550 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:40,529 INFO L628 ElimStorePlain]: treesize reduction 17, result has 84.0 percent of original size [2021-06-05 14:56:40,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:56:40,531 INFO L247 ElimStorePlain]: Needed 126 recursive calls to eliminate 2 variables, input treesize:5999, output treesize:89 [2021-06-05 14:56:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:40,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887759388] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:40,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:40,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:56:40,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527154284] [2021-06-05 14:56:40,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:56:40,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:56:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:56:40,635 INFO L87 Difference]: Start difference. First operand 497 states and 1552 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:56:41,333 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2021-06-05 14:56:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:41,405 INFO L93 Difference]: Finished difference Result 755 states and 2246 transitions. [2021-06-05 14:56:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:56:41,406 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:56:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:41,406 INFO L225 Difference]: With dead ends: 755 [2021-06-05 14:56:41,406 INFO L226 Difference]: Without dead ends: 689 [2021-06-05 14:56:41,407 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 862.8ms TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:56:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-06-05 14:56:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 502. [2021-06-05 14:56:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.147704590818363) internal successors, (1577), 501 states have internal predecessors, (1577), 0 states have call successors, (0), 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 14:56:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1577 transitions. [2021-06-05 14:56:41,413 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1577 transitions. Word has length 20 [2021-06-05 14:56:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:41,413 INFO L482 AbstractCegarLoop]: Abstraction has 502 states and 1577 transitions. [2021-06-05 14:56:41,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 14:56:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1577 transitions. [2021-06-05 14:56:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:41,414 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:41,414 INFO L521 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 14:56:41,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable932 [2021-06-05 14:56:41,614 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1065415511, now seen corresponding path program 5 times [2021-06-05 14:56:41,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:41,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584040885] [2021-06-05 14:56:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:41,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:41,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584040885] [2021-06-05 14:56:41,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584040885] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:41,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315413549] [2021-06-05 14:56:41,730 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 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 14:56:41,767 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:56:41,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:41,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:41,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:41,840 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 14:56:41,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,843 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,844 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,846 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,847 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,849 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,850 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:41,853 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,856 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,856 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:41,860 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:41,864 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:41,868 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,871 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,871 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,874 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,875 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,877 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,877 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,880 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,880 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:41,884 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,886 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,887 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,889 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,890 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,892 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,893 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,895 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,896 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,898 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:41,898 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:41,944 INFO L628 ElimStorePlain]: treesize reduction 46, result has 60.0 percent of original size [2021-06-05 14:56:41,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:41,945 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:582, output treesize:69 [2021-06-05 14:56:42,158 INFO L446 ElimStorePlain]: Different costs {0=[char_at_1], 1=[char_at_5]} [2021-06-05 14:56:42,163 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:42,171 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,175 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,176 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,180 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,180 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,185 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 14:56:42,186 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,190 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,191 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,195 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,196 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:42,202 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,206 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,207 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,211 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,216 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,216 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,220 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,220 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,225 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,229 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,229 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,233 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,234 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,238 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 14:56:42,239 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,243 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,244 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,247 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,248 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,251 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,251 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,254 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,255 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,258 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,261 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,261 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,264 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,264 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,267 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,268 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,271 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,271 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,274 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,277 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,277 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,279 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,280 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:42,284 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,287 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,287 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,289 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,290 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,292 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,293 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,295 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,295 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,298 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,298 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,387 INFO L628 ElimStorePlain]: treesize reduction 72, result has 66.0 percent of original size [2021-06-05 14:56:42,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:42,391 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 14:56:42,392 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:42,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:42,395 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:42,398 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,400 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:42,400 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,437 INFO L628 ElimStorePlain]: treesize reduction 21, result has 74.7 percent of original size [2021-06-05 14:56:42,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:56:42,438 INFO L247 ElimStorePlain]: Needed 39 recursive calls to eliminate 2 variables, input treesize:1585, output treesize:62 [2021-06-05 14:56:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:56:42,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315413549] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:42,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:42,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:56:42,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315977024] [2021-06-05 14:56:42,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:56:42,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:42,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:56:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:56:42,496 INFO L87 Difference]: Start difference. First operand 502 states and 1577 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:43,870 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 14:56:44,302 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 14:56:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:45,048 INFO L93 Difference]: Finished difference Result 743 states and 2200 transitions. [2021-06-05 14:56:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 14:56:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:45,049 INFO L225 Difference]: With dead ends: 743 [2021-06-05 14:56:45,049 INFO L226 Difference]: Without dead ends: 576 [2021-06-05 14:56:45,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2455.0ms TimeCoverageRelationStatistics Valid=572, Invalid=2080, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 14:56:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-06-05 14:56:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 492. [2021-06-05 14:56:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 3.1568228105906315) internal successors, (1550), 491 states have internal predecessors, (1550), 0 states have call successors, (0), 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 14:56:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1550 transitions. [2021-06-05 14:56:45,055 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1550 transitions. Word has length 20 [2021-06-05 14:56:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:45,055 INFO L482 AbstractCegarLoop]: Abstraction has 492 states and 1550 transitions. [2021-06-05 14:56:45,055 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1550 transitions. [2021-06-05 14:56:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:45,056 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:45,056 INFO L521 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 14:56:45,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:45,259 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1999997275, now seen corresponding path program 6 times [2021-06-05 14:56:45,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:45,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385072868] [2021-06-05 14:56:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:45,434 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 14:56:45,435 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:45,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385072868] [2021-06-05 14:56:45,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385072868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:45,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275143942] [2021-06-05 14:56:45,435 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 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 14:56:45,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:56:45,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:45,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:45,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:45,556 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,561 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,564 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,565 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,569 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,572 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 14:56:45,573 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,575 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,576 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,581 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,584 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,587 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,587 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,590 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,591 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,594 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,595 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,597 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,598 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,600 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,600 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,603 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,603 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,606 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,608 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,609 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,611 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,614 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,616 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,668 INFO L628 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2021-06-05 14:56:45,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:45,669 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:655, output treesize:81 [2021-06-05 14:56:45,919 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_1]} [2021-06-05 14:56:45,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,927 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,928 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,931 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,931 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,936 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,939 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,940 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,943 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,943 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,948 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,951 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,952 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,955 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,955 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,958 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,959 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,963 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,966 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,967 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,970 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,970 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,974 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,977 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,978 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,981 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,985 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,988 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,989 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:45,993 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:45,996 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:45,997 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,000 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,000 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,003 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,006 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,007 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,010 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,014 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,017 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,020 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,020 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,023 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,024 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,027 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,027 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,030 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,030 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,033 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,036 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 14:56:46,037 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,040 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,040 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,043 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 14:56:46,043 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,046 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,047 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,049 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,049 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,135 INFO L628 ElimStorePlain]: treesize reduction 193, result has 35.0 percent of original size [2021-06-05 14:56:46,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:46,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, 1 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 14:56:46,138 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:46,149 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,150 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:46,151 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,153 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 14:56:46,154 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,183 INFO L628 ElimStorePlain]: treesize reduction 1, result has 98.0 percent of original size [2021-06-05 14:56:46,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:56:46,184 INFO L247 ElimStorePlain]: Needed 41 recursive calls to eliminate 2 variables, input treesize:1769, output treesize:50 [2021-06-05 14:56:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:56:46,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275143942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:46,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:46,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 14:56:46,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932361435] [2021-06-05 14:56:46,240 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:56:46,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:56:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:56:46,240 INFO L87 Difference]: Start difference. First operand 492 states and 1550 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 14:56:46,851 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-06-05 14:56:47,254 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2021-06-05 14:56:47,860 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2021-06-05 14:56:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:48,776 INFO L93 Difference]: Finished difference Result 911 states and 2668 transitions. [2021-06-05 14:56:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 14:56:48,776 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 14:56:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:48,777 INFO L225 Difference]: With dead ends: 911 [2021-06-05 14:56:48,777 INFO L226 Difference]: Without dead ends: 765 [2021-06-05 14:56:48,777 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2430.9ms TimeCoverageRelationStatistics Valid=580, Invalid=1772, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 14:56:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-06-05 14:56:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 539. [2021-06-05 14:56:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 3.174721189591078) internal successors, (1708), 538 states have internal predecessors, (1708), 0 states have call successors, (0), 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 14:56:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1708 transitions. [2021-06-05 14:56:48,784 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1708 transitions. Word has length 20 [2021-06-05 14:56:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:48,785 INFO L482 AbstractCegarLoop]: Abstraction has 539 states and 1708 transitions. [2021-06-05 14:56:48,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 14:56:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1708 transitions. [2021-06-05 14:56:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:48,786 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:48,786 INFO L521 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 14:56:48,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:48,998 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1351621415, now seen corresponding path program 7 times [2021-06-05 14:56:48,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:48,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452771051] [2021-06-05 14:56:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:56:49,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:49,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452771051] [2021-06-05 14:56:49,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452771051] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:49,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418554557] [2021-06-05 14:56:49,084 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 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 14:56:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:49,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:49,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:49,228 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 14:56:49,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,232 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,232 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,235 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,235 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,238 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,238 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:49,242 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,244 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,245 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:49,248 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:49,252 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:49,256 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,259 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,262 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,262 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,264 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,265 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,267 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,267 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:49,271 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,273 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,274 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,276 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,277 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,279 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,280 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,282 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,282 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,284 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:49,285 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:49,334 INFO L628 ElimStorePlain]: treesize reduction 46, result has 60.0 percent of original size [2021-06-05 14:56:49,335 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:49,335 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:582, output treesize:69 [2021-06-05 14:56:50,068 INFO L446 ElimStorePlain]: Different costs {0=[char_at_1], 1=[char_at_5]} [2021-06-05 14:56:50,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,084 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,085 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,092 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,093 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,100 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,101 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,109 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,116 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,117 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,124 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,125 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,132 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,141 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:50,149 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,157 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,158 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,165 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,166 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,174 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,175 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,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, 1 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 14:56:50,182 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,192 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,200 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,207 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,208 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,216 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,216 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,225 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,231 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,231 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,238 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,239 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,248 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,256 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,257 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,265 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,265 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,272 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,273 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,281 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,282 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,289 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,290 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,298 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,299 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,306 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,307 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,315 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,321 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,321 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,329 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 14:56:50,330 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,337 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,337 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,344 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,345 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,352 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,358 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,364 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,368 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,369 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,374 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 14:56:50,375 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,381 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,386 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,391 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,392 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,397 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,397 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,402 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,407 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,407 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,412 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,412 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,417 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,418 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,422 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,422 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,427 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,427 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,431 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,432 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,436 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,437 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,441 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,445 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,446 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,449 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,450 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,454 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,455 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,459 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,460 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,464 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,464 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,468 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,469 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,473 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,474 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,479 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,483 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,487 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,487 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,491 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,491 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,496 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,500 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,500 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,504 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,505 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,508 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,509 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,512 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,513 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,517 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,517 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,521 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,521 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,525 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,529 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,529 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,533 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,533 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,537 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,540 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,541 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,544 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,545 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,753 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2021-06-05 14:56:50,753 INFO L628 ElimStorePlain]: treesize reduction 273, result has 51.7 percent of original size [2021-06-05 14:56:50,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,758 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:50,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:50,762 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,765 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,765 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:50,769 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:50,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:50,774 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:50,777 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 14:56:50,778 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:50,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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 14:56:50,782 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:50,784 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:50,870 INFO L628 ElimStorePlain]: treesize reduction 47, result has 72.8 percent of original size [2021-06-05 14:56:50,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:56:50,871 INFO L247 ElimStorePlain]: Needed 85 recursive calls to eliminate 2 variables, input treesize:3641, output treesize:126 [2021-06-05 14:56:51,012 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 14:56:51,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418554557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:51,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:51,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:56:51,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83295258] [2021-06-05 14:56:51,012 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:56:51,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:56:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:56:51,013 INFO L87 Difference]: Start difference. First operand 539 states and 1708 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:51,748 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 14:56:51,909 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-06-05 14:56:52,225 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-06-05 14:56:52,611 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 14:56:52,998 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-06-05 14:56:53,137 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2021-06-05 14:56:53,383 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2021-06-05 14:56:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:53,581 INFO L93 Difference]: Finished difference Result 973 states and 2801 transitions. [2021-06-05 14:56:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 14:56:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:53,583 INFO L225 Difference]: With dead ends: 973 [2021-06-05 14:56:53,583 INFO L226 Difference]: Without dead ends: 766 [2021-06-05 14:56:53,583 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2472.8ms TimeCoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 14:56:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-06-05 14:56:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 587. [2021-06-05 14:56:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 3.2320819112627985) internal successors, (1894), 586 states have internal predecessors, (1894), 0 states have call successors, (0), 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 14:56:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1894 transitions. [2021-06-05 14:56:53,592 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1894 transitions. Word has length 20 [2021-06-05 14:56:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:53,592 INFO L482 AbstractCegarLoop]: Abstraction has 587 states and 1894 transitions. [2021-06-05 14:56:53,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:56:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1894 transitions. [2021-06-05 14:56:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:53,593 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:53,593 INFO L521 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 14:56:53,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1116 [2021-06-05 14:56:53,815 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1848321991, now seen corresponding path program 8 times [2021-06-05 14:56:53,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:53,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036677185] [2021-06-05 14:56:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:56:53,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:53,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036677185] [2021-06-05 14:56:53,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036677185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:53,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126830821] [2021-06-05 14:56:53,891 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 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 14:56:53,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:56:53,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:53,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:53,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:53,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:53,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:53,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:53,989 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:53,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:53,993 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:53,996 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:53,996 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:53,999 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:53,999 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,002 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,002 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,005 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,005 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,008 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,008 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,011 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,014 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,017 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,020 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,022 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,022 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,025 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,025 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,027 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,028 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,030 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 14:56:54,031 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,034 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,036 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,036 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,039 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,101 INFO L628 ElimStorePlain]: treesize reduction 30, result has 74.8 percent of original size [2021-06-05 14:56:54,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:54,102 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:695, output treesize:89 [2021-06-05 14:56:54,689 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_1]} [2021-06-05 14:56:54,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:54,698 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:54,706 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,713 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,713 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,722 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,729 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,730 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,737 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,745 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,745 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,753 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,753 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,761 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,762 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,769 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,770 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,776 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,776 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,781 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,782 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,787 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,788 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,793 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,793 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,800 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,801 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,808 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,809 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,817 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,818 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,826 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,827 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,833 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,834 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,840 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,840 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,845 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,846 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,852 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,853 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,860 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,861 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,867 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,868 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,874 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,874 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,880 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,880 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,886 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 14:56:54,887 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,894 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 14:56:54,895 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,900 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,901 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,907 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,907 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,912 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,913 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,918 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,918 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,923 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,924 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,929 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,930 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,936 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,936 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,942 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,942 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,947 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,947 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,953 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,954 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,959 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,959 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,964 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,965 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,970 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,971 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,975 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,976 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,982 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,987 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,993 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:54,998 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:54,999 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,004 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,004 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:55,011 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,016 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,022 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,022 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,027 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,028 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,032 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,033 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,037 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,038 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,042 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,042 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,047 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,047 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:55,053 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,057 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,058 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,062 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,062 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:55,068 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,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, 1 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 14:56:55,074 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,078 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,079 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,083 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,084 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,089 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,093 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,094 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,099 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,104 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,104 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,109 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,109 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,113 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,114 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,118 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,118 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,123 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,127 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,127 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,132 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,132 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,136 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,137 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,141 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,141 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,145 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,146 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,149 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,150 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,154 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,155 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,159 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 14:56:55,160 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,165 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,169 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,169 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,173 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,174 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,178 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,178 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,182 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,183 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,187 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,187 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,191 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,191 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,196 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,197 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,202 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,203 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,208 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,209 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,213 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,213 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,217 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:55,222 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,225 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,226 INFO L550 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,229 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,230 INFO L550 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,233 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,234 INFO L550 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,388 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2021-06-05 14:56:55,389 INFO L628 ElimStorePlain]: treesize reduction 257, result has 42.4 percent of original size [2021-06-05 14:56:55,392 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 14:56:55,393 INFO L550 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,396 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 14:56:55,397 INFO L550 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:55,400 INFO L550 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:55,403 INFO L550 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:55,407 INFO L550 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,409 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:55,409 INFO L550 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:55,473 INFO L628 ElimStorePlain]: treesize reduction 19, result has 82.4 percent of original size [2021-06-05 14:56:55,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:56:55,474 INFO L247 ElimStorePlain]: Needed 101 recursive calls to eliminate 2 variables, input treesize:4656, output treesize:89 [2021-06-05 14:56:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:56:55,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126830821] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:55,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:55,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:56:55,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182972170] [2021-06-05 14:56:55,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:56:55,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:56:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:56:55,582 INFO L87 Difference]: Start difference. First operand 587 states and 1894 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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 14:56:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:56,086 INFO L93 Difference]: Finished difference Result 827 states and 2499 transitions. [2021-06-05 14:56:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:56:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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 14:56:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:56,087 INFO L225 Difference]: With dead ends: 827 [2021-06-05 14:56:56,087 INFO L226 Difference]: Without dead ends: 612 [2021-06-05 14:56:56,087 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 609.5ms TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:56:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-06-05 14:56:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 565. [2021-06-05 14:56:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.1968085106382977) internal successors, (1803), 564 states have internal predecessors, (1803), 0 states have call successors, (0), 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 14:56:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1803 transitions. [2021-06-05 14:56:56,093 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1803 transitions. Word has length 20 [2021-06-05 14:56:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:56,093 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 1803 transitions. [2021-06-05 14:56:56,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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 14:56:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1803 transitions. [2021-06-05 14:56:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:56,094 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:56,094 INFO L521 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 14:56:56,295 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1304 [2021-06-05 14:56:56,295 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1551384113, now seen corresponding path program 9 times [2021-06-05 14:56:56,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:56,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142020645] [2021-06-05 14:56:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:56,465 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 14:56:56,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:56,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142020645] [2021-06-05 14:56:56,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142020645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:56,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930412087] [2021-06-05 14:56:56,466 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 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 14:56:56,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:56:56,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:56,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:56:56,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:56,580 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 14:56:56,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,584 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,587 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,587 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,591 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:56,595 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,597 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,598 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,601 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,605 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,607 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,608 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,611 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,611 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,614 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,617 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,620 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,623 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,625 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,626 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,628 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,629 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,631 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,632 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,634 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,635 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,637 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,637 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,639 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,640 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,688 INFO L628 ElimStorePlain]: treesize reduction 46, result has 60.0 percent of original size [2021-06-05 14:56:56,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:56:56,689 INFO L247 ElimStorePlain]: Needed 21 recursive calls to eliminate 1 variables, input treesize:615, output treesize:69 [2021-06-05 14:56:56,910 INFO L446 ElimStorePlain]: Different costs {0=[char_at_1], 1=[char_at_5]} [2021-06-05 14:56:56,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,922 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,922 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,928 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,928 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,933 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,934 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,940 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,945 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,946 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,951 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,952 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,963 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:56:56,970 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,975 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:56,976 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,982 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,988 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:56,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:56,997 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,003 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,009 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,009 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,014 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,014 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,020 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,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, 1 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 14:56:57,026 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,032 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,032 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,038 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,043 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,044 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,049 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,050 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,055 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,055 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,061 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,066 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,067 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:57,072 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,077 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,077 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,084 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 14:56:57,085 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,089 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,090 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,094 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,095 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,099 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,100 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,104 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,105 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,110 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,110 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,115 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,116 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,120 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,120 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,126 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 14:56:57,127 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,132 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:57,137 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,142 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,142 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,147 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,148 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,152 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,152 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,156 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,157 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,161 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,162 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,166 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,167 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,172 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,177 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,181 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,181 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,185 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,186 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,190 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,191 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,194 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,195 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,199 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,200 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,203 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,204 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,208 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,209 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,212 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,213 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,218 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,222 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,222 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:57,227 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,231 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,231 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,235 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,236 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,239 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,240 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:57,244 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,248 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,248 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,252 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,253 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,256 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,257 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,260 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,261 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,264 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,265 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,269 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,269 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,272 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,273 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,276 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,277 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,280 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,487 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2021-06-05 14:56:57,488 INFO L628 ElimStorePlain]: treesize reduction 273, result has 51.7 percent of original size [2021-06-05 14:56:57,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:57,492 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:57,497 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,499 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,500 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:56:57,503 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:56:57,509 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,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 13 treesize of output 9 [2021-06-05 14:56:57,515 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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 14:56:57,521 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:56:57,525 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,627 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-05 14:56:57,628 INFO L628 ElimStorePlain]: treesize reduction 47, result has 72.8 percent of original size [2021-06-05 14:56:57,629 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:56:57,629 INFO L247 ElimStorePlain]: Needed 79 recursive calls to eliminate 2 variables, input treesize:3371, output treesize:126 [2021-06-05 14:56:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:56:57,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930412087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:57,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:57,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 14:56:57,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671807459] [2021-06-05 14:56:57,757 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:56:57,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:57,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:56:57,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:56:57,757 INFO L87 Difference]: Start difference. First operand 565 states and 1803 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 14:56:58,211 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2021-06-05 14:56:59,157 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2021-06-05 14:56:59,871 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-06-05 14:57:00,554 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-06-05 14:57:00,701 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2021-06-05 14:57:00,832 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 14:57:01,101 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2021-06-05 14:57:01,233 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2021-06-05 14:57:01,399 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2021-06-05 14:57:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:01,414 INFO L93 Difference]: Finished difference Result 1067 states and 3286 transitions. [2021-06-05 14:57:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 14:57:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 14:57:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:01,415 INFO L225 Difference]: With dead ends: 1067 [2021-06-05 14:57:01,416 INFO L226 Difference]: Without dead ends: 855 [2021-06-05 14:57:01,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 3542.6ms TimeCoverageRelationStatistics Valid=620, Invalid=2802, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 14:57:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-06-05 14:57:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 568. [2021-06-05 14:57:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.1693121693121693) internal successors, (1797), 567 states have internal predecessors, (1797), 0 states have call successors, (0), 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 14:57:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1797 transitions. [2021-06-05 14:57:01,422 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1797 transitions. Word has length 20 [2021-06-05 14:57:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:01,423 INFO L482 AbstractCegarLoop]: Abstraction has 568 states and 1797 transitions. [2021-06-05 14:57:01,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 14:57:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1797 transitions. [2021-06-05 14:57:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:01,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:01,423 INFO L521 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 14:57:01,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1448 [2021-06-05 14:57:01,624 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1169299993, now seen corresponding path program 10 times [2021-06-05 14:57:01,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:01,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623121429] [2021-06-05 14:57:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:01,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:01,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623121429] [2021-06-05 14:57:01,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623121429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:01,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260058564] [2021-06-05 14:57:01,767 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 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 14:57:01,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:57:01,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:01,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:57:01,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:01,955 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,956 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:01,960 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,963 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,964 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,967 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,967 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,971 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 14:57:01,972 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,974 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,975 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:01,979 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,982 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,986 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:01,990 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:01,995 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:01,997 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:01,998 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,000 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,001 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,005 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,007 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,008 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,011 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,014 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,017 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,020 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,113 INFO L628 ElimStorePlain]: treesize reduction 60, result has 64.5 percent of original size [2021-06-05 14:57:02,114 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:57:02,114 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:691, output treesize:109 [2021-06-05 14:57:02,502 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_5]} [2021-06-05 14:57:02,508 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:02,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,519 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,519 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:02,524 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,528 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,529 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,534 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,534 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,539 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,539 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:02,544 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,548 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,549 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,552 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,553 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,558 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,563 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,567 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,567 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,572 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,576 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,577 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,580 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,581 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,584 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,588 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,589 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,593 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,593 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,596 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,597 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,601 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,605 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:02,610 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,614 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,618 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,623 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,628 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 14:57:02,629 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,634 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,635 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,640 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,641 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,646 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,647 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,651 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,651 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,654 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,655 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:02,659 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,662 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,663 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,666 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,667 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,670 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,670 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,674 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,677 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,680 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,680 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,685 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:02,688 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,692 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,695 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,696 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,702 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,706 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,706 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,711 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,714 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,714 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,717 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,717 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,720 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,721 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,723 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,724 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,727 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,727 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,730 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,730 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,733 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,733 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,816 INFO L628 ElimStorePlain]: treesize reduction 163, result has 40.7 percent of original size [2021-06-05 14:57:02,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,819 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,821 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:02,821 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,823 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 14:57:02,828 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:02,831 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:02,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:02,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:57:02,852 INFO L247 ElimStorePlain]: Needed 58 recursive calls to eliminate 2 variables, input treesize:2148, output treesize:61 [2021-06-05 14:57:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:02,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260058564] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:02,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:02,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:57:02,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062523928] [2021-06-05 14:57:02,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:57:02,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:57:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:57:02,922 INFO L87 Difference]: Start difference. First operand 568 states and 1797 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:04,097 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 14:57:04,224 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2021-06-05 14:57:04,662 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-06-05 14:57:04,794 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2021-06-05 14:57:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:06,040 INFO L93 Difference]: Finished difference Result 1167 states and 3497 transitions. [2021-06-05 14:57:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-06-05 14:57:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:06,041 INFO L225 Difference]: With dead ends: 1167 [2021-06-05 14:57:06,041 INFO L226 Difference]: Without dead ends: 833 [2021-06-05 14:57:06,042 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2915.2ms TimeCoverageRelationStatistics Valid=593, Invalid=3439, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 14:57:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-06-05 14:57:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 615. [2021-06-05 14:57:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 3.1530944625407167) internal successors, (1936), 614 states have internal predecessors, (1936), 0 states have call successors, (0), 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 14:57:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1936 transitions. [2021-06-05 14:57:06,048 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1936 transitions. Word has length 20 [2021-06-05 14:57:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:06,048 INFO L482 AbstractCegarLoop]: Abstraction has 615 states and 1936 transitions. [2021-06-05 14:57:06,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1936 transitions. [2021-06-05 14:57:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:06,049 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:06,049 INFO L521 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 14:57:06,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1504,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:06,250 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1379623715, now seen corresponding path program 11 times [2021-06-05 14:57:06,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:06,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880430845] [2021-06-05 14:57:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:06,349 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 14:57:06,350 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:06,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880430845] [2021-06-05 14:57:06,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880430845] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:06,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819508615] [2021-06-05 14:57:06,350 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 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 14:57:06,399 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:57:06,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:06,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:57:06,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:06,512 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 14:57:06,513 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,517 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:06,521 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,523 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,524 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:06,528 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,530 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,531 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:06,534 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,537 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,539 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,539 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,542 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,542 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,545 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,545 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:06,548 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,551 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,555 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,558 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:06,561 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,564 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,564 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,566 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,567 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,569 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,569 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,571 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:06,572 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,638 INFO L628 ElimStorePlain]: treesize reduction 34, result has 74.4 percent of original size [2021-06-05 14:57:06,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:57:06,639 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:651, output treesize:99 [2021-06-05 14:57:06,997 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_5]} [2021-06-05 14:57:07,006 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,012 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,013 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:07,024 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,031 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,032 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,038 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,045 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,046 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,053 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,054 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,063 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,070 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,071 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,078 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,078 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,086 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,086 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,093 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,094 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,102 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,109 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,110 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,118 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,126 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,132 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,133 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,140 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,148 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 14:57:07,149 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,156 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,157 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,164 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,171 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:07,179 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,185 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,186 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,192 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,193 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,198 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,199 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,206 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,207 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,214 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,215 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,223 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,230 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,231 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,237 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,241 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:07,249 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,256 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,257 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,263 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,263 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,271 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,278 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,279 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,287 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,293 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,294 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,301 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,302 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,308 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,309 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,316 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,317 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,323 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,324 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,330 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,336 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,336 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,342 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,343 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,349 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,350 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,355 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,355 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,361 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,361 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,368 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,368 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,375 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,375 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,381 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,387 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,388 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,396 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,403 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,408 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,409 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,415 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,415 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,421 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,422 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,428 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,428 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,435 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,435 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,441 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,442 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,449 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,449 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,456 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,462 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,463 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,469 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,470 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,477 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,477 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,485 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,485 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,492 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,493 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,498 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,499 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,504 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,505 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,510 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,511 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,517 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,521 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,522 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,527 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,528 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,533 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,534 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,540 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,541 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,546 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 14:57:07,547 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,553 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,553 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,559 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,564 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,565 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,569 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,570 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,575 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,576 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,581 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,581 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,587 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,587 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,596 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,597 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,604 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,604 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,611 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,617 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,623 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,623 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,628 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,629 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,634 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,634 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,640 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,640 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,645 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,646 INFO L550 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,650 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,651 INFO L550 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,655 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,656 INFO L550 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,660 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,661 INFO L550 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,905 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2021-06-05 14:57:07,906 INFO L628 ElimStorePlain]: treesize reduction 244, result has 54.5 percent of original size [2021-06-05 14:57:07,910 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 14:57:07,911 INFO L550 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:07,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:57:07,915 INFO L550 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,919 INFO L550 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,923 INFO L550 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,926 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,926 INFO L550 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:07,930 INFO L550 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:07,933 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 14:57:07,934 INFO L550 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:07,937 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:07,937 INFO L550 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:08,023 INFO L628 ElimStorePlain]: treesize reduction 47, result has 72.8 percent of original size [2021-06-05 14:57:08,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:57:08,025 INFO L247 ElimStorePlain]: Needed 104 recursive calls to eliminate 2 variables, input treesize:4766, output treesize:126 [2021-06-05 14:57:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:57:08,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819508615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:08,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:08,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:57:08,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808772450] [2021-06-05 14:57:08,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:57:08,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:08,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:57:08,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:57:08,149 INFO L87 Difference]: Start difference. First operand 615 states and 1936 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:08,551 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-06-05 14:57:08,922 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 14:57:09,319 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2021-06-05 14:57:09,721 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2021-06-05 14:57:09,880 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-06-05 14:57:10,165 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 14:57:10,286 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-05 14:57:10,516 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2021-06-05 14:57:10,688 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 14:57:10,844 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2021-06-05 14:57:10,990 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-06-05 14:57:11,115 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2021-06-05 14:57:11,514 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2021-06-05 14:57:11,678 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-06-05 14:57:11,840 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-06-05 14:57:11,988 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2021-06-05 14:57:12,144 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-06-05 14:57:12,334 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-06-05 14:57:12,514 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-06-05 14:57:12,685 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2021-06-05 14:57:12,845 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2021-06-05 14:57:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:13,123 INFO L93 Difference]: Finished difference Result 1743 states and 4973 transitions. [2021-06-05 14:57:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-06-05 14:57:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:13,125 INFO L225 Difference]: With dead ends: 1743 [2021-06-05 14:57:13,125 INFO L226 Difference]: Without dead ends: 1384 [2021-06-05 14:57:13,125 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 4700.9ms TimeCoverageRelationStatistics Valid=953, Invalid=3079, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 14:57:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-06-05 14:57:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 670. [2021-06-05 14:57:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.1913303437967113) internal successors, (2135), 669 states have internal predecessors, (2135), 0 states have call successors, (0), 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 14:57:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2135 transitions. [2021-06-05 14:57:13,137 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2135 transitions. Word has length 20 [2021-06-05 14:57:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:13,137 INFO L482 AbstractCegarLoop]: Abstraction has 670 states and 2135 transitions. [2021-06-05 14:57:13,137 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2135 transitions. [2021-06-05 14:57:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:13,138 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:13,138 INFO L521 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 14:57:13,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1600,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:13,361 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:13,361 INFO L82 PathProgramCache]: Analyzing trace with hash 969949795, now seen corresponding path program 12 times [2021-06-05 14:57:13,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:13,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139448087] [2021-06-05 14:57:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:13,439 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:13,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139448087] [2021-06-05 14:57:13,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139448087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:13,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968587648] [2021-06-05 14:57:13,440 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 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 14:57:13,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 14:57:13,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:13,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:57:13,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:13,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:13,531 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,533 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,534 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:13,538 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,540 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,541 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,543 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,544 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,547 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,549 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,550 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,557 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 14:57:13,558 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,560 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,561 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,564 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,567 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,567 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,570 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,570 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:13,574 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,577 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,577 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,580 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,580 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,583 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,583 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:13,587 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,589 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,590 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,592 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,593 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,595 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:13,595 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,669 INFO L628 ElimStorePlain]: treesize reduction 31, result has 73.5 percent of original size [2021-06-05 14:57:13,670 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:57:13,670 INFO L247 ElimStorePlain]: Needed 21 recursive calls to eliminate 1 variables, input treesize:605, output treesize:86 [2021-06-05 14:57:14,219 INFO L446 ElimStorePlain]: Different costs {0=[char_at_5], 1=[char_at_1]} [2021-06-05 14:57:14,227 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,234 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,235 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,242 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,250 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,251 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,258 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,265 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,265 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,273 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,273 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,280 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,287 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,294 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,295 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,303 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,308 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,309 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,314 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,314 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,320 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 14:57:14,321 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,326 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,327 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,333 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,338 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,339 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,346 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,351 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,357 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,363 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,369 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,369 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,374 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,375 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,380 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,385 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,386 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:14,392 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,397 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,397 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,403 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,403 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,408 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,408 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,414 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,420 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,425 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,426 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,431 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,431 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:14,437 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,442 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,443 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,447 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,448 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,453 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,453 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,458 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,459 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,464 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,465 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,471 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,476 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,476 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,481 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,481 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,486 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,487 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,491 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,492 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,497 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,497 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,503 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,507 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,508 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,514 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,518 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,518 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,523 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,524 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,528 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,529 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,533 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,533 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,538 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,539 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,543 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,544 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,548 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,549 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,553 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,554 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,559 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,562 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,563 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,567 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,567 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,571 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,572 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,575 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,576 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:14,581 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,585 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,586 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,590 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,590 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,594 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,595 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,599 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,599 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,604 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,604 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,608 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,608 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,612 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,612 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,617 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,617 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,621 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,622 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,626 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,626 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,630 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,630 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,634 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,635 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,638 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,639 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,642 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,643 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,646 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,646 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,650 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,651 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,655 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,656 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,659 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,660 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,663 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 14:57:14,664 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,667 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,668 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,671 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,672 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,675 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,675 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,678 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,678 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,829 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-06-05 14:57:14,830 INFO L628 ElimStorePlain]: treesize reduction 287, result has 39.7 percent of original size [2021-06-05 14:57:14,833 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 14:57:14,834 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,837 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 14:57:14,838 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,840 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 14:57:14,841 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,844 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 14:57:14,844 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,847 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 14:57:14,848 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,850 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:14,850 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:14,913 INFO L628 ElimStorePlain]: treesize reduction 19, result has 82.4 percent of original size [2021-06-05 14:57:14,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:57:14,915 INFO L247 ElimStorePlain]: Needed 92 recursive calls to eliminate 2 variables, input treesize:4081, output treesize:89 [2021-06-05 14:57:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:15,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968587648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:15,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:15,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:57:15,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456455736] [2021-06-05 14:57:15,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:57:15,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:57:15,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:57:15,025 INFO L87 Difference]: Start difference. First operand 670 states and 2135 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 14:57:15,565 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2021-06-05 14:57:15,745 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-06-05 14:57:15,904 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 14:57:16,048 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2021-06-05 14:57:16,161 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2021-06-05 14:57:16,394 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2021-06-05 14:57:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:16,548 INFO L93 Difference]: Finished difference Result 1015 states and 3043 transitions. [2021-06-05 14:57:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:57:16,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 14:57:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:16,550 INFO L225 Difference]: With dead ends: 1015 [2021-06-05 14:57:16,550 INFO L226 Difference]: Without dead ends: 855 [2021-06-05 14:57:16,550 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1586.5ms TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:57:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-06-05 14:57:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 681. [2021-06-05 14:57:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 3.1926470588235296) internal successors, (2171), 680 states have internal predecessors, (2171), 0 states have call successors, (0), 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 14:57:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 2171 transitions. [2021-06-05 14:57:16,558 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 2171 transitions. Word has length 20 [2021-06-05 14:57:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:16,558 INFO L482 AbstractCegarLoop]: Abstraction has 681 states and 2171 transitions. [2021-06-05 14:57:16,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 14:57:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 2171 transitions. [2021-06-05 14:57:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:16,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:16,560 INFO L521 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 14:57:16,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1690,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:16,760 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -641941827, now seen corresponding path program 13 times [2021-06-05 14:57:16,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:16,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021898603] [2021-06-05 14:57:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:16,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:16,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021898603] [2021-06-05 14:57:16,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021898603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:16,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203931065] [2021-06-05 14:57:16,881 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 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 14:57:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:16,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:57:16,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:16,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:16,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,977 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:16,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,980 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:16,981 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,984 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:16,984 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:16,987 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,990 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 14:57:16,990 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:16,994 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,996 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:16,997 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:16,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,000 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,003 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,006 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,007 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,010 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,012 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,013 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,015 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,015 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,018 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,020 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,021 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,023 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,023 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,103 INFO L628 ElimStorePlain]: treesize reduction 60, result has 64.5 percent of original size [2021-06-05 14:57:17,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:57:17,104 INFO L247 ElimStorePlain]: Needed 18 recursive calls to eliminate 1 variables, input treesize:619, output treesize:109 [2021-06-05 14:57:17,481 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_5]} [2021-06-05 14:57:17,487 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,494 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:17,502 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,509 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,516 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,530 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,531 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,537 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,545 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,552 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,552 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,559 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,565 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,566 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,572 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,573 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,580 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,587 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,587 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,594 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,594 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:17,601 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,608 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,608 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,615 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,623 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,630 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,636 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,643 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,649 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,649 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:17,657 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,664 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,664 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,670 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,671 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,678 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 14:57:17,679 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,686 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,693 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,700 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,700 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,707 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,707 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,714 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,715 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,721 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:17,730 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,737 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,743 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,744 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,750 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,755 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,755 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,764 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,765 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,770 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,771 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,777 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,778 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,785 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,790 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,797 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,797 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,804 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,804 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,810 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,810 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,817 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,818 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,824 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,825 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,831 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,831 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,837 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,838 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,843 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,844 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,849 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,850 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,855 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,856 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,861 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,862 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,867 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 14:57:17,868 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,875 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,879 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,880 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,885 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,885 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,891 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,896 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,896 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,901 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,902 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,907 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,907 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,912 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,913 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,917 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,917 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,922 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,923 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,928 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,928 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,933 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,933 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,943 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,949 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,950 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:17,957 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,962 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,966 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,967 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,971 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,972 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,976 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,977 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,982 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,986 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,991 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,995 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:17,996 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,000 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,001 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,004 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,005 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,009 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,009 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,013 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,018 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,022 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,022 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,027 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,030 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,031 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,035 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,035 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,039 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,039 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,042 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,043 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,258 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-06-05 14:57:18,259 INFO L628 ElimStorePlain]: treesize reduction 275, result has 51.5 percent of original size [2021-06-05 14:57:18,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:18,263 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,266 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 14:57:18,267 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:18,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 14:57:18,271 INFO L550 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:18,275 INFO L550 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,277 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,278 INFO L550 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:18,281 INFO L550 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:18,284 INFO L550 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,287 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 14:57:18,288 INFO L550 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,387 INFO L628 ElimStorePlain]: treesize reduction 47, result has 72.8 percent of original size [2021-06-05 14:57:18,388 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:57:18,388 INFO L247 ElimStorePlain]: Needed 98 recursive calls to eliminate 2 variables, input treesize:4459, output treesize:126 [2021-06-05 14:57:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:18,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203931065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:18,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:18,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:57:18,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077350434] [2021-06-05 14:57:18,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:57:18,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:57:18,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:57:18,504 INFO L87 Difference]: Start difference. First operand 681 states and 2171 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:18,754 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2021-06-05 14:57:19,470 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-06-05 14:57:19,679 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2021-06-05 14:57:19,820 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-06-05 14:57:19,939 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2021-06-05 14:57:20,192 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-06-05 14:57:20,308 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 14:57:20,427 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2021-06-05 14:57:20,658 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 14:57:20,852 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2021-06-05 14:57:20,976 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2021-06-05 14:57:21,497 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-06-05 14:57:21,907 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2021-06-05 14:57:22,365 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2021-06-05 14:57:22,502 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2021-06-05 14:57:22,654 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2021-06-05 14:57:22,848 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-06-05 14:57:23,220 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-06-05 14:57:23,347 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2021-06-05 14:57:23,502 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-06-05 14:57:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:23,921 INFO L93 Difference]: Finished difference Result 1326 states and 3910 transitions. [2021-06-05 14:57:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 14:57:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:23,923 INFO L225 Difference]: With dead ends: 1326 [2021-06-05 14:57:23,923 INFO L226 Difference]: Without dead ends: 1107 [2021-06-05 14:57:23,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 5198.5ms TimeCoverageRelationStatistics Valid=799, Invalid=4031, Unknown=0, NotChecked=0, Total=4830 [2021-06-05 14:57:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-06-05 14:57:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 724. [2021-06-05 14:57:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.211618257261411) internal successors, (2322), 723 states have internal predecessors, (2322), 0 states have call successors, (0), 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 14:57:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2322 transitions. [2021-06-05 14:57:23,932 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 2322 transitions. Word has length 20 [2021-06-05 14:57:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:23,932 INFO L482 AbstractCegarLoop]: Abstraction has 724 states and 2322 transitions. [2021-06-05 14:57:23,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 14:57:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 2322 transitions. [2021-06-05 14:57:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:23,933 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:23,933 INFO L521 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 14:57:24,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1852,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:24,134 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 719407490, now seen corresponding path program 5 times [2021-06-05 14:57:24,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:24,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336456038] [2021-06-05 14:57:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:24,274 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 14:57:24,275 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:24,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336456038] [2021-06-05 14:57:24,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336456038] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:24,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122796541] [2021-06-05 14:57:24,275 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 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 14:57:24,305 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:57:24,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:24,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:24,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:24,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122796541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:24,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:24,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 14:57:24,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214894179] [2021-06-05 14:57:24,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:57:24,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:57:24,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:57:24,479 INFO L87 Difference]: Start difference. First operand 724 states and 2322 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:25,582 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-06-05 14:57:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:25,603 INFO L93 Difference]: Finished difference Result 970 states and 2991 transitions. [2021-06-05 14:57:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:57:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:25,604 INFO L225 Difference]: With dead ends: 970 [2021-06-05 14:57:25,604 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 14:57:25,604 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1063.7ms TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:57:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 14:57:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 707. [2021-06-05 14:57:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 3.1997167138810196) internal successors, (2259), 706 states have internal predecessors, (2259), 0 states have call successors, (0), 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 14:57:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 2259 transitions. [2021-06-05 14:57:25,612 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 2259 transitions. Word has length 20 [2021-06-05 14:57:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:25,612 INFO L482 AbstractCegarLoop]: Abstraction has 707 states and 2259 transitions. [2021-06-05 14:57:25,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 2259 transitions. [2021-06-05 14:57:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:25,613 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:25,613 INFO L521 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 14:57:25,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1966 [2021-06-05 14:57:25,813 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:25,813 INFO L82 PathProgramCache]: Analyzing trace with hash 254005020, now seen corresponding path program 6 times [2021-06-05 14:57:25,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:25,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220646720] [2021-06-05 14:57:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:25,892 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:25,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220646720] [2021-06-05 14:57:25,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220646720] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:25,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460903475] [2021-06-05 14:57:25,892 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 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 14:57:25,938 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:57:25,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:25,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:25,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:26,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460903475] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:26,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:26,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:57:26,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973850311] [2021-06-05 14:57:26,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:57:26,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:57:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:57:26,075 INFO L87 Difference]: Start difference. First operand 707 states and 2259 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 14:57:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:26,928 INFO L93 Difference]: Finished difference Result 1230 states and 3723 transitions. [2021-06-05 14:57:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:57:26,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 14:57:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:26,930 INFO L225 Difference]: With dead ends: 1230 [2021-06-05 14:57:26,930 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 14:57:26,930 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 748.2ms TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:57:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 14:57:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 721. [2021-06-05 14:57:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.2263888888888888) internal successors, (2323), 720 states have internal predecessors, (2323), 0 states have call successors, (0), 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 14:57:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2323 transitions. [2021-06-05 14:57:26,938 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2323 transitions. Word has length 20 [2021-06-05 14:57:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:26,939 INFO L482 AbstractCegarLoop]: Abstraction has 721 states and 2323 transitions. [2021-06-05 14:57:26,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 14:57:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2323 transitions. [2021-06-05 14:57:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:26,940 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:26,940 INFO L521 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 14:57:27,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1974 [2021-06-05 14:57:27,141 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:27,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1325415994, now seen corresponding path program 7 times [2021-06-05 14:57:27,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:27,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624884090] [2021-06-05 14:57:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:27,330 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 14:57:27,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:27,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624884090] [2021-06-05 14:57:27,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624884090] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:27,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801684209] [2021-06-05 14:57:27,330 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 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 14:57:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:27,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:27,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:27,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801684209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:27,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:27,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 14:57:27,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530951946] [2021-06-05 14:57:27,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:57:27,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:57:27,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:57:27,529 INFO L87 Difference]: Start difference. First operand 721 states and 2323 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:28,571 INFO L93 Difference]: Finished difference Result 1151 states and 3531 transitions. [2021-06-05 14:57:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 14:57:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:28,572 INFO L225 Difference]: With dead ends: 1151 [2021-06-05 14:57:28,572 INFO L226 Difference]: Without dead ends: 1024 [2021-06-05 14:57:28,572 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1000.1ms TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 14:57:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-06-05 14:57:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 767. [2021-06-05 14:57:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 3.1971279373368144) internal successors, (2449), 766 states have internal predecessors, (2449), 0 states have call successors, (0), 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 14:57:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2449 transitions. [2021-06-05 14:57:28,581 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2449 transitions. Word has length 20 [2021-06-05 14:57:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:28,581 INFO L482 AbstractCegarLoop]: Abstraction has 767 states and 2449 transitions. [2021-06-05 14:57:28,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2449 transitions. [2021-06-05 14:57:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:28,582 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:28,582 INFO L521 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 14:57:28,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1986 [2021-06-05 14:57:28,785 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash -347274408, now seen corresponding path program 8 times [2021-06-05 14:57:28,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:28,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11698450] [2021-06-05 14:57:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:28,907 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 14:57:28,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:28,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11698450] [2021-06-05 14:57:28,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11698450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:28,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877074236] [2021-06-05 14:57:28,908 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 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 14:57:28,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:57:28,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:28,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:28,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:29,100 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 14:57:29,101 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,103 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 14:57:29,104 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,107 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 14:57:29,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,111 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,111 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,114 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,114 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,117 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,120 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 11 treesize of output 7 [2021-06-05 14:57:29,121 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,123 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,124 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,126 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,127 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,129 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,130 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,132 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 14:57:29,133 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,135 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,136 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,138 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 14:57:29,139 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,142 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 14:57:29,142 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,145 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,145 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,147 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,148 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,150 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,151 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,153 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,153 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,156 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 11 treesize of output 7 [2021-06-05 14:57:29,156 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,159 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 14:57:29,159 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,161 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:29,162 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,232 INFO L628 ElimStorePlain]: treesize reduction 83, result has 53.9 percent of original size [2021-06-05 14:57:29,235 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2021-06-05 14:57:29,235 INFO L247 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:710, output treesize:89 [2021-06-05 14:57:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:29,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877074236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:29,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:29,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2021-06-05 14:57:29,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224519423] [2021-06-05 14:57:29,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:57:29,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:57:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:57:29,616 INFO L87 Difference]: Start difference. First operand 767 states and 2449 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 14:57:30,080 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-06-05 14:57:30,238 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2021-06-05 14:57:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:30,510 INFO L93 Difference]: Finished difference Result 980 states and 3009 transitions. [2021-06-05 14:57:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:57:30,510 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 14:57:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:30,511 INFO L225 Difference]: With dead ends: 980 [2021-06-05 14:57:30,511 INFO L226 Difference]: Without dead ends: 902 [2021-06-05 14:57:30,512 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 831.8ms TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:57:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-06-05 14:57:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 775. [2021-06-05 14:57:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 3.202842377260982) internal successors, (2479), 774 states have internal predecessors, (2479), 0 states have call successors, (0), 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 14:57:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 2479 transitions. [2021-06-05 14:57:30,519 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 2479 transitions. Word has length 20 [2021-06-05 14:57:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:30,519 INFO L482 AbstractCegarLoop]: Abstraction has 775 states and 2479 transitions. [2021-06-05 14:57:30,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 14:57:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 2479 transitions. [2021-06-05 14:57:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:30,521 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:30,521 INFO L521 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 14:57:30,721 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2000,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:30,721 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1175816270, now seen corresponding path program 9 times [2021-06-05 14:57:30,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:30,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49782359] [2021-06-05 14:57:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:30,852 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 14:57:30,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:30,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49782359] [2021-06-05 14:57:30,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49782359] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:30,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749216237] [2021-06-05 14:57:30,852 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 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 14:57:30,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:57:30,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:30,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:30,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:31,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749216237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:31,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:31,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 14:57:31,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292343914] [2021-06-05 14:57:31,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:57:31,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:57:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:57:31,072 INFO L87 Difference]: Start difference. First operand 775 states and 2479 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:32,578 INFO L93 Difference]: Finished difference Result 1120 states and 3470 transitions. [2021-06-05 14:57:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 14:57:32,578 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:32,579 INFO L225 Difference]: With dead ends: 1120 [2021-06-05 14:57:32,579 INFO L226 Difference]: Without dead ends: 1036 [2021-06-05 14:57:32,579 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1395.7ms TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 14:57:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-06-05 14:57:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 769. [2021-06-05 14:57:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 3.1953125) internal successors, (2454), 768 states have internal predecessors, (2454), 0 states have call successors, (0), 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 14:57:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 2454 transitions. [2021-06-05 14:57:32,588 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 2454 transitions. Word has length 20 [2021-06-05 14:57:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:32,588 INFO L482 AbstractCegarLoop]: Abstraction has 769 states and 2454 transitions. [2021-06-05 14:57:32,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 14:57:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 2454 transitions. [2021-06-05 14:57:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:32,589 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:32,589 INFO L521 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 14:57:32,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2119 [2021-06-05 14:57:32,793 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:32,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1333148950, now seen corresponding path program 10 times [2021-06-05 14:57:32,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:32,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910836989] [2021-06-05 14:57:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:32,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:32,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910836989] [2021-06-05 14:57:32,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910836989] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:32,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046522459] [2021-06-05 14:57:32,863 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 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 14:57:32,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:57:32,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:32,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:32,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:33,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046522459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:33,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:33,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:57:33,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911559822] [2021-06-05 14:57:33,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:57:33,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:57:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:57:33,035 INFO L87 Difference]: Start difference. First operand 769 states and 2454 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 14:57:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:34,172 INFO L93 Difference]: Finished difference Result 1254 states and 3819 transitions. [2021-06-05 14:57:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 14:57:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 14:57:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:34,174 INFO L225 Difference]: With dead ends: 1254 [2021-06-05 14:57:34,174 INFO L226 Difference]: Without dead ends: 1107 [2021-06-05 14:57:34,174 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 973.4ms TimeCoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 14:57:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-06-05 14:57:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 758. [2021-06-05 14:57:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 3.1875825627476884) internal successors, (2413), 757 states have internal predecessors, (2413), 0 states have call successors, (0), 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 14:57:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2413 transitions. [2021-06-05 14:57:34,183 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2413 transitions. Word has length 20 [2021-06-05 14:57:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:34,183 INFO L482 AbstractCegarLoop]: Abstraction has 758 states and 2413 transitions. [2021-06-05 14:57:34,183 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 14:57:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2413 transitions. [2021-06-05 14:57:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:34,184 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:34,184 INFO L521 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 14:57:34,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2133 [2021-06-05 14:57:34,384 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1937783866, now seen corresponding path program 11 times [2021-06-05 14:57:34,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:34,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823517603] [2021-06-05 14:57:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:34,462 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:34,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823517603] [2021-06-05 14:57:34,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823517603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:34,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167894786] [2021-06-05 14:57:34,462 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:34,501 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:57:34,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:34,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 14:57:34,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:34,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167894786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:34,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:34,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 14:57:34,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388296628] [2021-06-05 14:57:34,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:57:34,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:34,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:57:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:57:34,716 INFO L87 Difference]: Start difference. First operand 758 states and 2413 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 14:57:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:34,947 INFO L93 Difference]: Finished difference Result 962 states and 2957 transitions. [2021-06-05 14:57:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:57:34,947 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 14:57:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:34,948 INFO L225 Difference]: With dead ends: 962 [2021-06-05 14:57:34,949 INFO L226 Difference]: Without dead ends: 915 [2021-06-05 14:57:34,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 317.3ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:57:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-06-05 14:57:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 744. [2021-06-05 14:57:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 3.1601615074024227) internal successors, (2348), 743 states have internal predecessors, (2348), 0 states have call successors, (0), 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 14:57:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2348 transitions. [2021-06-05 14:57:34,957 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2348 transitions. Word has length 20 [2021-06-05 14:57:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:34,957 INFO L482 AbstractCegarLoop]: Abstraction has 744 states and 2348 transitions. [2021-06-05 14:57:34,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 14:57:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2348 transitions. [2021-06-05 14:57:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:34,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:34,958 INFO L521 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 14:57:35,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2147 [2021-06-05 14:57:35,158 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1895698515, now seen corresponding path program 14 times [2021-06-05 14:57:35,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:35,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261223995] [2021-06-05 14:57:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:35,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:35,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261223995] [2021-06-05 14:57:35,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261223995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:35,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531743062] [2021-06-05 14:57:35,269 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:35,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:57:35,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:35,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 14:57:35,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:35,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,385 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,388 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 14:57:35,389 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,391 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,392 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:35,396 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,398 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,399 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,402 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,406 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,409 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,409 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,425 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,428 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,429 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,431 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,432 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,435 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,435 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,438 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,439 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,441 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,442 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,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, 1 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 14:57:35,446 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,449 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,450 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,452 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,453 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,455 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,455 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,524 INFO L628 ElimStorePlain]: treesize reduction 50, result has 62.7 percent of original size [2021-06-05 14:57:35,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:57:35,525 INFO L247 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:595, output treesize:84 [2021-06-05 14:57:35,800 INFO L446 ElimStorePlain]: Different costs {0=[char_at_9], 1=[char_at_5]} [2021-06-05 14:57:35,805 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,809 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,814 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:35,820 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,824 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,824 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,829 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,833 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,834 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,838 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,839 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,843 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,843 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,848 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,852 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,853 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,857 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,857 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,861 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,861 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,865 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,865 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:35,870 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,873 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,874 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,878 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 14:57:35,879 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,883 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,888 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,888 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,893 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,897 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,898 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:35,902 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,906 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,907 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,911 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,911 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,915 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,916 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,919 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,920 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,924 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,924 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,928 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,928 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,932 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,933 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,936 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,937 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,940 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,941 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,944 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,944 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,948 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,948 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,951 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,951 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,955 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,955 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:35,961 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,965 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,965 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,969 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,969 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,972 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,973 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,975 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,976 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,979 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,980 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,983 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,986 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,990 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,990 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,993 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,994 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,997 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:35,997 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:57:36,001 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,004 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,004 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,007 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,008 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,011 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:36,015 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,018 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,021 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,021 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,024 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,025 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,027 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,028 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,030 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,031 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,034 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,112 INFO L628 ElimStorePlain]: treesize reduction 109, result has 50.7 percent of original size [2021-06-05 14:57:36,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:36,116 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,118 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:36,119 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,121 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 14:57:36,122 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 14:57:36,125 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:36,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:57:36,146 INFO L247 ElimStorePlain]: Needed 62 recursive calls to eliminate 2 variables, input treesize:2152, output treesize:61 [2021-06-05 14:57:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:57:36,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531743062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:36,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:36,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:57:36,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876311195] [2021-06-05 14:57:36,206 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:57:36,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:36,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:57:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:57:36,207 INFO L87 Difference]: Start difference. First operand 744 states and 2348 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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) Received shutdown request... [2021-06-05 14:57:36,280 WARN L222 SmtUtils]: Removed 2 from assertion stack [2021-06-05 14:57:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:57:36,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2160 [2021-06-05 14:57:36,485 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 14:57:36,492 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 14:57:36,494 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 14:57:36,495 INFO L202 PluginConnector]: Adding new model poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 02:57:36 BasicIcfg [2021-06-05 14:57:36,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 14:57:36,495 INFO L168 Benchmark]: Toolchain (without parser) took 849774.63 ms. Allocated memory was 350.2 MB in the beginning and 931.1 MB in the end (delta: 580.9 MB). Free memory was 328.3 MB in the beginning and 896.9 MB in the end (delta: -568.6 MB). Peak memory consumption was 561.1 MB. Max. memory is 16.0 GB. [2021-06-05 14:57:36,495 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 350.2 MB. Free memory was 330.8 MB in the beginning and 330.7 MB in the end (delta: 76.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 14:57:36,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.60 ms. Allocated memory is still 350.2 MB. Free memory was 328.2 MB in the beginning and 326.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 14:57:36,496 INFO L168 Benchmark]: Boogie Preprocessor took 32.67 ms. Allocated memory is still 350.2 MB. Free memory was 326.5 MB in the beginning and 324.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 14:57:36,496 INFO L168 Benchmark]: RCFGBuilder took 926.35 ms. Allocated memory is still 350.2 MB. Free memory was 324.5 MB in the beginning and 279.0 MB in the end (delta: 45.4 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.0 GB. [2021-06-05 14:57:36,496 INFO L168 Benchmark]: TraceAbstraction took 848766.72 ms. Allocated memory was 350.2 MB in the beginning and 931.1 MB in the end (delta: 580.9 MB). Free memory was 278.0 MB in the beginning and 896.9 MB in the end (delta: -618.9 MB). Peak memory consumption was 509.4 MB. Max. memory is 16.0 GB. [2021-06-05 14:57:36,496 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 350.2 MB. Free memory was 330.8 MB in the beginning and 330.7 MB in the end (delta: 76.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.60 ms. Allocated memory is still 350.2 MB. Free memory was 328.2 MB in the beginning and 326.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.67 ms. Allocated memory is still 350.2 MB. Free memory was 326.5 MB in the beginning and 324.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 926.35 ms. Allocated memory is still 350.2 MB. Free memory was 324.5 MB in the beginning and 279.0 MB in the end (delta: 45.4 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 848766.72 ms. Allocated memory was 350.2 MB in the beginning and 931.1 MB in the end (delta: 580.9 MB). Free memory was 278.0 MB in the beginning and 896.9 MB in the end (delta: -618.9 MB). Peak memory consumption was 509.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 293]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (744states) and FLOYD_HOARE automaton (currently 4 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 56ms.. - TimeoutResultAtElement [Line: 292]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (744states) and FLOYD_HOARE automaton (currently 4 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 56ms.. - TimeoutResultAtElement [Line: 289]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (744states) and FLOYD_HOARE automaton (currently 4 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 56ms.. - TimeoutResultAtElement [Line: 299]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (744states) and FLOYD_HOARE automaton (currently 4 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 56ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 44 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 848686.4ms, OverallIterations: 102, TraceHistogramMax: 1, EmptinessCheckTime: 127.7ms, AutomataDifference: 50716.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5557 SDtfs, 7072 SDslu, 17734 SDs, 0 SdLazy, 16542 SolverSat, 1419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9656.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2115 GetRequests, 879 SyntacticMatches, 10 SemanticMatches, 1225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8987 ImplicationChecksByTransitivity, 47679.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=98, InterpolantAutomatonStates: 1078, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1195.2ms AutomataMinimizationTime, 101 MinimizatonAttempts, 20527 StatesRemovedByMinimization, 96 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 274.8ms SsaConstructionTime, 834.8ms SatisfiabilityAnalysisTime, 787596.8ms InterpolantComputationTime, 2396 NumberOfCodeBlocks, 2384 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 2262 ConstructedInterpolants, 6 QuantifiedInterpolants, 43530 SizeOfPredicates, 303 NumberOfNonLiveVariables, 2560 ConjunctsInSsa, 493 ConjunctsInUnsatCore, 134 InterpolantComputations, 77 PerfectInterpolantSequences, 137/257 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown