/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 19:11:42,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 19:11:42,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 19:11:42,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 19:11:42,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 19:11:42,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 19:11:42,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 19:11:42,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 19:11:42,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 19:11:42,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 19:11:42,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 19:11:42,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 19:11:42,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 19:11:42,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 19:11:42,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 19:11:42,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 19:11:42,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 19:11:42,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 19:11:42,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 19:11:42,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 19:11:42,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 19:11:42,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 19:11:42,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 19:11:42,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 19:11:42,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 19:11:42,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 19:11:42,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 19:11:42,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 19:11:42,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 19:11:42,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 19:11:42,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 19:11:42,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 19:11:42,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 19:11:42,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 19:11:42,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 19:11:42,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 19:11:42,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 19:11:42,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 19:11:42,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 19:11:42,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 19:11:42,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 19:11:42,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-12 19:11:42,215 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 19:11:42,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 19:11:42,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 19:11:42,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 19:11:42,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 19:11:42,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 19:11:42,218 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 19:11:42,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 19:11:42,219 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 19:11:42,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 19:11:42,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 19:11:42,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 19:11:42,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 19:11:42,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 19:11:42,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 19:11:42,221 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 19:11:42,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 19:11:42,221 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 19:11:42,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 19:11:42,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 19:11:42,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 19:11:42,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 19:11:42,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 19:11:42,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 19:11:42,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 19:11:42,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 19:11:42,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 19:11:42,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 19:11:42,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 19:11:42,223 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 19:11:42,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 19:11:42,223 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-12 19:11:42,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 19:11:42,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 19:11:42,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 19:11:42,546 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-12 19:11:42,553 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-12 19:11:42,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl [2021-06-12 19:11:42,554 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl' [2021-06-12 19:11:42,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 19:11:42,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-12 19:11:42,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 19:11:42,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 19:11:42,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 19:11:42,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 19:11:42,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 19:11:42,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 19:11:42,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 19:11:42,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/1) ... [2021-06-12 19:11:42,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 19:11:42,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 19:11:42,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 19:11:42,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 19:11:42,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (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-12 19:11:42,705 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2021-06-12 19:11:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2021-06-12 19:11:42,706 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2021-06-12 19:11:42,706 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2021-06-12 19:11:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2021-06-12 19:11:42,706 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2021-06-12 19:11:42,706 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2021-06-12 19:11:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2021-06-12 19:11:42,707 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2021-06-12 19:11:42,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2021-06-12 19:11:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2021-06-12 19:11:42,707 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2021-06-12 19:11:42,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-12 19:11:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 19:11:42,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 19:11:42,709 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 19:11:42,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 19:11:42,854 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-12 19:11:42,858 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 07:11:42 BoogieIcfgContainer [2021-06-12 19:11:42,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 19:11:42,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 19:11:42,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 19:11:42,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 19:11:42,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 07:11:42" (1/2) ... [2021-06-12 19:11:42,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b64748 and model type example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 07:11:42, skipping insertion in model container [2021-06-12 19:11:42,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 07:11:42" (2/2) ... [2021-06-12 19:11:42,866 INFO L111 eAbstractionObserver]: Analyzing ICFG example_4.bpl [2021-06-12 19:11:42,875 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 19:11:42,875 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 19:11:42,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-12 19:11:42,877 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 19:11:42,950 INFO L149 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2021-06-12 19:11:42,989 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-12 19:11:43,005 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 19:11:43,005 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 19:11:43,005 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 19:11:43,005 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 19:11:43,005 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 19:11:43,005 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 19:11:43,005 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 19:11:43,006 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 19:11:43,014 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 35 transitions, 138 flow [2021-06-12 19:11:43,071 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 299 states, 297 states have (on average 2.95959595959596) internal successors, (879), 298 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 297 states have (on average 2.95959595959596) internal successors, (879), 298 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:43,087 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:43,088 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:43,088 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1503386291, now seen corresponding path program 1 times [2021-06-12 19:11:43,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:43,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578180744] [2021-06-12 19:11:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:43,217 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-12 19:11:43,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:43,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578180744] [2021-06-12 19:11:43,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578180744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:43,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:43,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 19:11:43,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995153748] [2021-06-12 19:11:43,249 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 19:11:43,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 19:11:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 19:11:43,264 INFO L87 Difference]: Start difference. First operand has 299 states, 297 states have (on average 2.95959595959596) internal successors, (879), 298 states have internal predecessors, (879), 0 states have call successors, (0), 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:43,308 INFO L93 Difference]: Finished difference Result 272 states and 771 transitions. [2021-06-12 19:11:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 19:11:43,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:43,327 INFO L225 Difference]: With dead ends: 272 [2021-06-12 19:11:43,327 INFO L226 Difference]: Without dead ends: 270 [2021-06-12 19:11:43,329 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 19:11:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-12 19:11:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-06-12 19:11:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 2.858736059479554) internal successors, (769), 269 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 769 transitions. [2021-06-12 19:11:43,403 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 769 transitions. Word has length 17 [2021-06-12 19:11:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:43,404 INFO L482 AbstractCegarLoop]: Abstraction has 270 states and 769 transitions. [2021-06-12 19:11:43,404 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 769 transitions. [2021-06-12 19:11:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:43,414 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:43,414 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:43,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 19:11:43,415 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash 591735021, now seen corresponding path program 1 times [2021-06-12 19:11:43,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:43,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956851119] [2021-06-12 19:11:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:43,455 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-12 19:11:43,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:43,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956851119] [2021-06-12 19:11:43,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956851119] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:43,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:43,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 19:11:43,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602386724] [2021-06-12 19:11:43,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 19:11:43,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 19:11:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 19:11:43,465 INFO L87 Difference]: Start difference. First operand 270 states and 769 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:43,480 INFO L93 Difference]: Finished difference Result 216 states and 589 transitions. [2021-06-12 19:11:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 19:11:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:43,483 INFO L225 Difference]: With dead ends: 216 [2021-06-12 19:11:43,483 INFO L226 Difference]: Without dead ends: 216 [2021-06-12 19:11:43,485 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 19:11:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-06-12 19:11:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-06-12 19:11:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.73953488372093) internal successors, (589), 215 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 589 transitions. [2021-06-12 19:11:43,506 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 589 transitions. Word has length 17 [2021-06-12 19:11:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:43,506 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 589 transitions. [2021-06-12 19:11:43,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 589 transitions. [2021-06-12 19:11:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:43,508 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:43,509 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:43,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 19:11:43,510 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash -345548245, now seen corresponding path program 1 times [2021-06-12 19:11:43,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:43,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105562121] [2021-06-12 19:11:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:43,555 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-12 19:11:43,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:43,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105562121] [2021-06-12 19:11:43,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105562121] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:43,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:43,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 19:11:43,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276007555] [2021-06-12 19:11:43,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 19:11:43,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:43,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 19:11:43,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 19:11:43,558 INFO L87 Difference]: Start difference. First operand 216 states and 589 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:43,573 INFO L93 Difference]: Finished difference Result 162 states and 433 transitions. [2021-06-12 19:11:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 19:11:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:43,575 INFO L225 Difference]: With dead ends: 162 [2021-06-12 19:11:43,575 INFO L226 Difference]: Without dead ends: 162 [2021-06-12 19:11:43,576 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 19:11:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-06-12 19:11:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-06-12 19:11:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.68944099378882) internal successors, (433), 161 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 433 transitions. [2021-06-12 19:11:43,581 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 433 transitions. Word has length 17 [2021-06-12 19:11:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:43,581 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 433 transitions. [2021-06-12 19:11:43,582 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 433 transitions. [2021-06-12 19:11:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:43,582 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:43,582 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:43,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 19:11:43,583 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1896362483, now seen corresponding path program 1 times [2021-06-12 19:11:43,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:43,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706093259] [2021-06-12 19:11:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:43,795 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-12 19:11:43,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:43,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706093259] [2021-06-12 19:11:43,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706093259] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:43,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:43,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:43,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265701109] [2021-06-12 19:11:43,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:43,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:43,800 INFO L87 Difference]: Start difference. First operand 162 states and 433 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:43,860 INFO L93 Difference]: Finished difference Result 304 states and 750 transitions. [2021-06-12 19:11:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:43,863 INFO L225 Difference]: With dead ends: 304 [2021-06-12 19:11:43,863 INFO L226 Difference]: Without dead ends: 265 [2021-06-12 19:11:43,864 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-12 19:11:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 170. [2021-06-12 19:11:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.6804733727810652) internal successors, (453), 169 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 453 transitions. [2021-06-12 19:11:43,872 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 453 transitions. Word has length 17 [2021-06-12 19:11:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:43,872 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 453 transitions. [2021-06-12 19:11:43,872 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 453 transitions. [2021-06-12 19:11:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:43,873 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:43,873 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:43,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 19:11:43,874 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 448349167, now seen corresponding path program 2 times [2021-06-12 19:11:43,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:43,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383955392] [2021-06-12 19:11:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,025 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-12 19:11:44,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383955392] [2021-06-12 19:11:44,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383955392] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986003376] [2021-06-12 19:11:44,027 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,031 INFO L87 Difference]: Start difference. First operand 170 states and 453 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,080 INFO L93 Difference]: Finished difference Result 319 states and 785 transitions. [2021-06-12 19:11:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,083 INFO L225 Difference]: With dead ends: 319 [2021-06-12 19:11:44,083 INFO L226 Difference]: Without dead ends: 257 [2021-06-12 19:11:44,084 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-12 19:11:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 162. [2021-06-12 19:11:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.6645962732919255) internal successors, (429), 161 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 429 transitions. [2021-06-12 19:11:44,090 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 429 transitions. Word has length 17 [2021-06-12 19:11:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:44,090 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 429 transitions. [2021-06-12 19:11:44,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 429 transitions. [2021-06-12 19:11:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:44,091 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:44,092 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:44,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 19:11:44,092 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash 808670063, now seen corresponding path program 3 times [2021-06-12 19:11:44,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:44,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387594483] [2021-06-12 19:11:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,200 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-12 19:11:44,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387594483] [2021-06-12 19:11:44,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387594483] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053827349] [2021-06-12 19:11:44,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,203 INFO L87 Difference]: Start difference. First operand 162 states and 429 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,247 INFO L93 Difference]: Finished difference Result 291 states and 712 transitions. [2021-06-12 19:11:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,250 INFO L225 Difference]: With dead ends: 291 [2021-06-12 19:11:44,250 INFO L226 Difference]: Without dead ends: 252 [2021-06-12 19:11:44,250 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-12 19:11:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 166. [2021-06-12 19:11:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.6484848484848484) internal successors, (437), 165 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 437 transitions. [2021-06-12 19:11:44,263 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 437 transitions. Word has length 17 [2021-06-12 19:11:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:44,263 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 437 transitions. [2021-06-12 19:11:44,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 437 transitions. [2021-06-12 19:11:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:44,270 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:44,270 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:44,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 19:11:44,270 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -209274001, now seen corresponding path program 4 times [2021-06-12 19:11:44,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:44,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139310961] [2021-06-12 19:11:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,384 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-12 19:11:44,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139310961] [2021-06-12 19:11:44,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139310961] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029969388] [2021-06-12 19:11:44,386 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,387 INFO L87 Difference]: Start difference. First operand 166 states and 437 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,440 INFO L93 Difference]: Finished difference Result 297 states and 725 transitions. [2021-06-12 19:11:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,442 INFO L225 Difference]: With dead ends: 297 [2021-06-12 19:11:44,442 INFO L226 Difference]: Without dead ends: 248 [2021-06-12 19:11:44,442 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-12 19:11:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 162. [2021-06-12 19:11:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.652173913043478) internal successors, (427), 161 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 427 transitions. [2021-06-12 19:11:44,448 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 427 transitions. Word has length 17 [2021-06-12 19:11:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:44,449 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 427 transitions. [2021-06-12 19:11:44,449 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 427 transitions. [2021-06-12 19:11:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:44,449 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:44,449 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:44,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 19:11:44,450 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1120579375, now seen corresponding path program 5 times [2021-06-12 19:11:44,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:44,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214118506] [2021-06-12 19:11:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,545 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-12 19:11:44,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214118506] [2021-06-12 19:11:44,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214118506] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197498942] [2021-06-12 19:11:44,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,547 INFO L87 Difference]: Start difference. First operand 162 states and 427 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,586 INFO L93 Difference]: Finished difference Result 332 states and 818 transitions. [2021-06-12 19:11:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,588 INFO L225 Difference]: With dead ends: 332 [2021-06-12 19:11:44,589 INFO L226 Difference]: Without dead ends: 278 [2021-06-12 19:11:44,589 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-12 19:11:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 177. [2021-06-12 19:11:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.602272727272727) internal successors, (458), 176 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 458 transitions. [2021-06-12 19:11:44,597 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 458 transitions. Word has length 17 [2021-06-12 19:11:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:44,597 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 458 transitions. [2021-06-12 19:11:44,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 458 transitions. [2021-06-12 19:11:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:44,598 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:44,598 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:44,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 19:11:44,599 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1448962257, now seen corresponding path program 6 times [2021-06-12 19:11:44,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:44,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811596350] [2021-06-12 19:11:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,675 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-12 19:11:44,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811596350] [2021-06-12 19:11:44,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811596350] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291900672] [2021-06-12 19:11:44,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,680 INFO L87 Difference]: Start difference. First operand 177 states and 458 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,728 INFO L93 Difference]: Finished difference Result 323 states and 785 transitions. [2021-06-12 19:11:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,731 INFO L225 Difference]: With dead ends: 323 [2021-06-12 19:11:44,731 INFO L226 Difference]: Without dead ends: 257 [2021-06-12 19:11:44,731 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-12 19:11:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 156. [2021-06-12 19:11:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.6516129032258067) internal successors, (411), 155 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 411 transitions. [2021-06-12 19:11:44,737 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 411 transitions. Word has length 17 [2021-06-12 19:11:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:44,738 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 411 transitions. [2021-06-12 19:11:44,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 411 transitions. [2021-06-12 19:11:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:44,741 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:44,741 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:44,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 19:11:44,741 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -815299857, now seen corresponding path program 7 times [2021-06-12 19:11:44,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:44,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120363831] [2021-06-12 19:11:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,813 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-12 19:11:44,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120363831] [2021-06-12 19:11:44,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120363831] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641910704] [2021-06-12 19:11:44,814 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,815 INFO L87 Difference]: Start difference. First operand 156 states and 411 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,852 INFO L93 Difference]: Finished difference Result 290 states and 704 transitions. [2021-06-12 19:11:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,853 INFO L225 Difference]: With dead ends: 290 [2021-06-12 19:11:44,853 INFO L226 Difference]: Without dead ends: 251 [2021-06-12 19:11:44,854 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-06-12 19:11:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 156. [2021-06-12 19:11:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.6258064516129034) internal successors, (407), 155 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 407 transitions. [2021-06-12 19:11:44,862 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 407 transitions. Word has length 17 [2021-06-12 19:11:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:44,862 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 407 transitions. [2021-06-12 19:11:44,862 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 407 transitions. [2021-06-12 19:11:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:44,863 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:44,863 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:44,863 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 19:11:44,864 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1529411793, now seen corresponding path program 8 times [2021-06-12 19:11:44,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:44,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915494125] [2021-06-12 19:11:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:44,938 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-12 19:11:44,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:44,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915494125] [2021-06-12 19:11:44,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915494125] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:44,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:44,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:44,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191906684] [2021-06-12 19:11:44,940 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:44,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:44,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:44,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:44,941 INFO L87 Difference]: Start difference. First operand 156 states and 407 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:44,993 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2021-06-12 19:11:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:44,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:44,995 INFO L225 Difference]: With dead ends: 305 [2021-06-12 19:11:44,995 INFO L226 Difference]: Without dead ends: 243 [2021-06-12 19:11:44,996 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-06-12 19:11:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2021-06-12 19:11:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.6054421768707483) internal successors, (383), 147 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 383 transitions. [2021-06-12 19:11:45,001 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 383 transitions. Word has length 17 [2021-06-12 19:11:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,002 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 383 transitions. [2021-06-12 19:11:45,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 383 transitions. [2021-06-12 19:11:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,002 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,003 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 19:11:45,003 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash 192998127, now seen corresponding path program 9 times [2021-06-12 19:11:45,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532227506] [2021-06-12 19:11:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,076 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-12 19:11:45,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532227506] [2021-06-12 19:11:45,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532227506] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139597003] [2021-06-12 19:11:45,077 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,078 INFO L87 Difference]: Start difference. First operand 148 states and 383 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,115 INFO L93 Difference]: Finished difference Result 267 states and 641 transitions. [2021-06-12 19:11:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,117 INFO L225 Difference]: With dead ends: 267 [2021-06-12 19:11:45,117 INFO L226 Difference]: Without dead ends: 228 [2021-06-12 19:11:45,118 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-12 19:11:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2021-06-12 19:11:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.589403973509934) internal successors, (391), 151 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 391 transitions. [2021-06-12 19:11:45,123 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 391 transitions. Word has length 17 [2021-06-12 19:11:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,124 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 391 transitions. [2021-06-12 19:11:45,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 391 transitions. [2021-06-12 19:11:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,125 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,125 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 19:11:45,125 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1503575313, now seen corresponding path program 10 times [2021-06-12 19:11:45,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636944082] [2021-06-12 19:11:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,199 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-12 19:11:45,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636944082] [2021-06-12 19:11:45,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636944082] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522547700] [2021-06-12 19:11:45,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,201 INFO L87 Difference]: Start difference. First operand 152 states and 391 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,247 INFO L93 Difference]: Finished difference Result 239 states and 584 transitions. [2021-06-12 19:11:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,248 INFO L225 Difference]: With dead ends: 239 [2021-06-12 19:11:45,248 INFO L226 Difference]: Without dead ends: 192 [2021-06-12 19:11:45,249 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-12 19:11:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2021-06-12 19:11:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.5918367346938775) internal successors, (381), 147 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 381 transitions. [2021-06-12 19:11:45,254 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 381 transitions. Word has length 17 [2021-06-12 19:11:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,255 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 381 transitions. [2021-06-12 19:11:45,255 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 381 transitions. [2021-06-12 19:11:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,256 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,256 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 19:11:45,257 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1736251311, now seen corresponding path program 11 times [2021-06-12 19:11:45,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999013296] [2021-06-12 19:11:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,330 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-12 19:11:45,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999013296] [2021-06-12 19:11:45,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999013296] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67586841] [2021-06-12 19:11:45,331 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,332 INFO L87 Difference]: Start difference. First operand 148 states and 381 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,365 INFO L93 Difference]: Finished difference Result 288 states and 697 transitions. [2021-06-12 19:11:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,368 INFO L225 Difference]: With dead ends: 288 [2021-06-12 19:11:45,368 INFO L226 Difference]: Without dead ends: 234 [2021-06-12 19:11:45,369 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-12 19:11:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 158. [2021-06-12 19:11:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.5605095541401273) internal successors, (402), 157 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 402 transitions. [2021-06-12 19:11:45,375 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 402 transitions. Word has length 17 [2021-06-12 19:11:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,375 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 402 transitions. [2021-06-12 19:11:45,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 402 transitions. [2021-06-12 19:11:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,376 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,376 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 19:11:45,376 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1648314577, now seen corresponding path program 12 times [2021-06-12 19:11:45,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309216325] [2021-06-12 19:11:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,454 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-12 19:11:45,454 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309216325] [2021-06-12 19:11:45,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309216325] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61922808] [2021-06-12 19:11:45,455 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,456 INFO L87 Difference]: Start difference. First operand 158 states and 402 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,510 INFO L93 Difference]: Finished difference Result 245 states and 595 transitions. [2021-06-12 19:11:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,512 INFO L225 Difference]: With dead ends: 245 [2021-06-12 19:11:45,512 INFO L226 Difference]: Without dead ends: 188 [2021-06-12 19:11:45,514 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-06-12 19:11:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2021-06-12 19:11:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.5944055944055946) internal successors, (371), 143 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 371 transitions. [2021-06-12 19:11:45,519 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 371 transitions. Word has length 17 [2021-06-12 19:11:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,519 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 371 transitions. [2021-06-12 19:11:45,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 371 transitions. [2021-06-12 19:11:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,521 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,522 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 19:11:45,522 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,522 INFO L82 PathProgramCache]: Analyzing trace with hash 601862097, now seen corresponding path program 13 times [2021-06-12 19:11:45,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459911521] [2021-06-12 19:11:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,590 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-12 19:11:45,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459911521] [2021-06-12 19:11:45,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459911521] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324622318] [2021-06-12 19:11:45,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,624 INFO L87 Difference]: Start difference. First operand 144 states and 371 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,677 INFO L93 Difference]: Finished difference Result 261 states and 622 transitions. [2021-06-12 19:11:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,679 INFO L225 Difference]: With dead ends: 261 [2021-06-12 19:11:45,679 INFO L226 Difference]: Without dead ends: 222 [2021-06-12 19:11:45,679 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-06-12 19:11:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 144. [2021-06-12 19:11:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.5664335664335662) internal successors, (367), 143 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 367 transitions. [2021-06-12 19:11:45,683 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 367 transitions. Word has length 17 [2021-06-12 19:11:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,683 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 367 transitions. [2021-06-12 19:11:45,683 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 367 transitions. [2021-06-12 19:11:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,683 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,683 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 19:11:45,684 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash -416081967, now seen corresponding path program 14 times [2021-06-12 19:11:45,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836692030] [2021-06-12 19:11:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,742 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-12 19:11:45,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836692030] [2021-06-12 19:11:45,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836692030] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411605207] [2021-06-12 19:11:45,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,744 INFO L87 Difference]: Start difference. First operand 144 states and 367 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,787 INFO L93 Difference]: Finished difference Result 267 states and 635 transitions. [2021-06-12 19:11:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,788 INFO L225 Difference]: With dead ends: 267 [2021-06-12 19:11:45,788 INFO L226 Difference]: Without dead ends: 218 [2021-06-12 19:11:45,789 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-12 19:11:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 140. [2021-06-12 19:11:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.568345323741007) internal successors, (357), 139 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 357 transitions. [2021-06-12 19:11:45,793 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 357 transitions. Word has length 17 [2021-06-12 19:11:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,793 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 357 transitions. [2021-06-12 19:11:45,793 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 357 transitions. [2021-06-12 19:11:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,794 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,794 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 19:11:45,794 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1441474897, now seen corresponding path program 15 times [2021-06-12 19:11:45,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782338874] [2021-06-12 19:11:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,847 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-12 19:11:45,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782338874] [2021-06-12 19:11:45,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782338874] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431070044] [2021-06-12 19:11:45,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,848 INFO L87 Difference]: Start difference. First operand 140 states and 357 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:45,877 INFO L93 Difference]: Finished difference Result 247 states and 583 transitions. [2021-06-12 19:11:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:45,879 INFO L225 Difference]: With dead ends: 247 [2021-06-12 19:11:45,879 INFO L226 Difference]: Without dead ends: 208 [2021-06-12 19:11:45,879 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-06-12 19:11:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2021-06-12 19:11:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.5419847328244276) internal successors, (333), 131 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 333 transitions. [2021-06-12 19:11:45,883 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 333 transitions. Word has length 17 [2021-06-12 19:11:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:45,883 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 333 transitions. [2021-06-12 19:11:45,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 333 transitions. [2021-06-12 19:11:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:45,884 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:45,884 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:45,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 19:11:45,884 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash -422512687, now seen corresponding path program 16 times [2021-06-12 19:11:45,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:45,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110282135] [2021-06-12 19:11:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:45,945 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-12 19:11:45,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:45,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110282135] [2021-06-12 19:11:45,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110282135] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:45,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:45,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:45,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962875637] [2021-06-12 19:11:45,946 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:45,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:45,947 INFO L87 Difference]: Start difference. First operand 132 states and 333 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,005 INFO L93 Difference]: Finished difference Result 219 states and 526 transitions. [2021-06-12 19:11:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,006 INFO L225 Difference]: With dead ends: 219 [2021-06-12 19:11:46,006 INFO L226 Difference]: Without dead ends: 172 [2021-06-12 19:11:46,006 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-12 19:11:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2021-06-12 19:11:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.543307086614173) internal successors, (323), 127 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 323 transitions. [2021-06-12 19:11:46,015 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 323 transitions. Word has length 17 [2021-06-12 19:11:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,015 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 323 transitions. [2021-06-12 19:11:46,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 323 transitions. [2021-06-12 19:11:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,016 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,016 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 19:11:46,016 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1264414673, now seen corresponding path program 17 times [2021-06-12 19:11:46,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713321805] [2021-06-12 19:11:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,067 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-12 19:11:46,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713321805] [2021-06-12 19:11:46,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713321805] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056355891] [2021-06-12 19:11:46,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,069 INFO L87 Difference]: Start difference. First operand 128 states and 323 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,117 INFO L93 Difference]: Finished difference Result 223 states and 540 transitions. [2021-06-12 19:11:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,118 INFO L225 Difference]: With dead ends: 223 [2021-06-12 19:11:46,118 INFO L226 Difference]: Without dead ends: 178 [2021-06-12 19:11:46,119 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-06-12 19:11:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 134. [2021-06-12 19:11:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.526315789473684) internal successors, (336), 133 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 336 transitions. [2021-06-12 19:11:46,123 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 336 transitions. Word has length 17 [2021-06-12 19:11:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,123 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 336 transitions. [2021-06-12 19:11:46,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 336 transitions. [2021-06-12 19:11:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,123 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,124 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 19:11:46,124 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,124 INFO L82 PathProgramCache]: Analyzing trace with hash 936031791, now seen corresponding path program 18 times [2021-06-12 19:11:46,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481265968] [2021-06-12 19:11:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,173 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-12 19:11:46,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481265968] [2021-06-12 19:11:46,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481265968] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550036764] [2021-06-12 19:11:46,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,174 INFO L87 Difference]: Start difference. First operand 134 states and 336 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,210 INFO L93 Difference]: Finished difference Result 177 states and 432 transitions. [2021-06-12 19:11:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,212 INFO L225 Difference]: With dead ends: 177 [2021-06-12 19:11:46,212 INFO L226 Difference]: Without dead ends: 126 [2021-06-12 19:11:46,212 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-06-12 19:11:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-06-12 19:11:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.552) internal successors, (319), 125 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 319 transitions. [2021-06-12 19:11:46,217 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 319 transitions. Word has length 17 [2021-06-12 19:11:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,218 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 319 transitions. [2021-06-12 19:11:46,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 319 transitions. [2021-06-12 19:11:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,219 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,219 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-12 19:11:46,219 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1679709363, now seen corresponding path program 19 times [2021-06-12 19:11:46,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245259780] [2021-06-12 19:11:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,278 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-12 19:11:46,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245259780] [2021-06-12 19:11:46,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245259780] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999683905] [2021-06-12 19:11:46,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,280 INFO L87 Difference]: Start difference. First operand 126 states and 319 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,314 INFO L93 Difference]: Finished difference Result 212 states and 507 transitions. [2021-06-12 19:11:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,316 INFO L225 Difference]: With dead ends: 212 [2021-06-12 19:11:46,316 INFO L226 Difference]: Without dead ends: 158 [2021-06-12 19:11:46,316 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-06-12 19:11:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2021-06-12 19:11:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.464) internal successors, (308), 125 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 308 transitions. [2021-06-12 19:11:46,320 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 308 transitions. Word has length 17 [2021-06-12 19:11:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,320 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 308 transitions. [2021-06-12 19:11:46,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 308 transitions. [2021-06-12 19:11:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,320 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,321 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,321 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-12 19:11:46,321 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1351326481, now seen corresponding path program 20 times [2021-06-12 19:11:46,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489082670] [2021-06-12 19:11:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,375 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-12 19:11:46,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489082670] [2021-06-12 19:11:46,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489082670] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493084230] [2021-06-12 19:11:46,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,376 INFO L87 Difference]: Start difference. First operand 126 states and 308 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,415 INFO L93 Difference]: Finished difference Result 203 states and 474 transitions. [2021-06-12 19:11:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,416 INFO L225 Difference]: With dead ends: 203 [2021-06-12 19:11:46,416 INFO L226 Difference]: Without dead ends: 143 [2021-06-12 19:11:46,417 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-06-12 19:11:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2021-06-12 19:11:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.4545454545454546) internal successors, (270), 110 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 270 transitions. [2021-06-12 19:11:46,424 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 270 transitions. Word has length 17 [2021-06-12 19:11:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,424 INFO L482 AbstractCegarLoop]: Abstraction has 111 states and 270 transitions. [2021-06-12 19:11:46,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 270 transitions. [2021-06-12 19:11:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,425 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,425 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-12 19:11:46,425 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash -363627631, now seen corresponding path program 21 times [2021-06-12 19:11:46,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783222638] [2021-06-12 19:11:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,484 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-12 19:11:46,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783222638] [2021-06-12 19:11:46,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783222638] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336501559] [2021-06-12 19:11:46,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,486 INFO L87 Difference]: Start difference. First operand 111 states and 270 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,511 INFO L93 Difference]: Finished difference Result 174 states and 399 transitions. [2021-06-12 19:11:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,512 INFO L225 Difference]: With dead ends: 174 [2021-06-12 19:11:46,512 INFO L226 Difference]: Without dead ends: 120 [2021-06-12 19:11:46,512 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-06-12 19:11:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 88. [2021-06-12 19:11:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.310344827586207) internal successors, (201), 87 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 201 transitions. [2021-06-12 19:11:46,515 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 201 transitions. Word has length 17 [2021-06-12 19:11:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,515 INFO L482 AbstractCegarLoop]: Abstraction has 88 states and 201 transitions. [2021-06-12 19:11:46,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 201 transitions. [2021-06-12 19:11:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,515 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,515 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-12 19:11:46,516 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1855122543, now seen corresponding path program 22 times [2021-06-12 19:11:46,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734291281] [2021-06-12 19:11:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,581 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-12 19:11:46,581 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734291281] [2021-06-12 19:11:46,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734291281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956376911] [2021-06-12 19:11:46,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,582 INFO L87 Difference]: Start difference. First operand 88 states and 201 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,623 INFO L93 Difference]: Finished difference Result 131 states and 297 transitions. [2021-06-12 19:11:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,624 INFO L225 Difference]: With dead ends: 131 [2021-06-12 19:11:46,624 INFO L226 Difference]: Without dead ends: 78 [2021-06-12 19:11:46,625 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-06-12 19:11:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-06-12 19:11:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.272727272727273) internal successors, (175), 77 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 175 transitions. [2021-06-12 19:11:46,627 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 175 transitions. Word has length 17 [2021-06-12 19:11:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,627 INFO L482 AbstractCegarLoop]: Abstraction has 78 states and 175 transitions. [2021-06-12 19:11:46,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 175 transitions. [2021-06-12 19:11:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,628 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,628 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-12 19:11:46,628 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash -40818065, now seen corresponding path program 23 times [2021-06-12 19:11:46,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393155983] [2021-06-12 19:11:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,677 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-12 19:11:46,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393155983] [2021-06-12 19:11:46,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393155983] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577431901] [2021-06-12 19:11:46,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,678 INFO L87 Difference]: Start difference. First operand 78 states and 175 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,717 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2021-06-12 19:11:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,718 INFO L225 Difference]: With dead ends: 109 [2021-06-12 19:11:46,718 INFO L226 Difference]: Without dead ends: 64 [2021-06-12 19:11:46,718 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-06-12 19:11:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-06-12 19:11:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 63 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 132 transitions. [2021-06-12 19:11:46,721 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 132 transitions. Word has length 17 [2021-06-12 19:11:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,722 INFO L482 AbstractCegarLoop]: Abstraction has 64 states and 132 transitions. [2021-06-12 19:11:46,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 132 transitions. [2021-06-12 19:11:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-12 19:11:46,723 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 19:11:46,723 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 19:11:46,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-12 19:11:46,723 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 19:11:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 19:11:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1630752815, now seen corresponding path program 24 times [2021-06-12 19:11:46,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 19:11:46,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593614784] [2021-06-12 19:11:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 19:11:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 19:11:46,790 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-12 19:11:46,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 19:11:46,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593614784] [2021-06-12 19:11:46,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593614784] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 19:11:46,791 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 19:11:46,791 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 19:11:46,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635910131] [2021-06-12 19:11:46,791 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 19:11:46,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 19:11:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 19:11:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-12 19:11:46,792 INFO L87 Difference]: Start difference. First operand 64 states and 132 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 19:11:46,819 INFO L93 Difference]: Finished difference Result 63 states and 131 transitions. [2021-06-12 19:11:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 19:11:46,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-06-12 19:11:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 19:11:46,819 INFO L225 Difference]: With dead ends: 63 [2021-06-12 19:11:46,819 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 19:11:46,820 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 19:11:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 19:11:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 19:11:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 19:11:46,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2021-06-12 19:11:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 19:11:46,820 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 19:11:46,820 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 19:11:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 19:11:46,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 19:11:46,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-12 19:11:46,822 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 19:11:46,824 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 07:11:46 BasicIcfg [2021-06-12 19:11:46,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 19:11:46,825 INFO L168 Benchmark]: Toolchain (without parser) took 4239.71 ms. Allocated memory was 181.4 MB in the beginning and 227.5 MB in the end (delta: 46.1 MB). Free memory was 161.4 MB in the beginning and 106.3 MB in the end (delta: 55.2 MB). Peak memory consumption was 102.2 MB. Max. memory is 8.0 GB. [2021-06-12 19:11:46,825 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 181.4 MB. Free memory is still 162.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 19:11:46,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.12 ms. Allocated memory is still 181.4 MB. Free memory was 161.3 MB in the beginning and 159.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-12 19:11:46,825 INFO L168 Benchmark]: Boogie Preprocessor took 12.96 ms. Allocated memory is still 181.4 MB. Free memory was 159.8 MB in the beginning and 158.9 MB in the end (delta: 917.2 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-12 19:11:46,825 INFO L168 Benchmark]: RCFGBuilder took 231.18 ms. Allocated memory is still 181.4 MB. Free memory was 158.9 MB in the beginning and 149.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-06-12 19:11:46,825 INFO L168 Benchmark]: TraceAbstraction took 3964.87 ms. Allocated memory was 181.4 MB in the beginning and 227.5 MB in the end (delta: 46.1 MB). Free memory was 149.3 MB in the beginning and 106.3 MB in the end (delta: 43.0 MB). Peak memory consumption was 90.7 MB. Max. memory is 8.0 GB. [2021-06-12 19:11:46,826 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.14 ms. Allocated memory is still 181.4 MB. Free memory is still 162.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 25.12 ms. Allocated memory is still 181.4 MB. Free memory was 161.3 MB in the beginning and 159.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 12.96 ms. Allocated memory is still 181.4 MB. Free memory was 159.8 MB in the beginning and 158.9 MB in the end (delta: 917.2 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 231.18 ms. Allocated memory is still 181.4 MB. Free memory was 158.9 MB in the beginning and 149.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3964.87 ms. Allocated memory was 181.4 MB in the beginning and 227.5 MB in the end (delta: 46.1 MB). Free memory was 149.3 MB in the beginning and 106.3 MB in the end (delta: 43.0 MB). Peak memory consumption was 90.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3818.5ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 43.3ms, AutomataDifference: 1251.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 65.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1010 SDtfs, 1216 SDslu, 1386 SDs, 0 SdLazy, 333 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 336.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1513.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 221.2ms AutomataMinimizationTime, 27 MinimizatonAttempts, 1410 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.7ms SsaConstructionTime, 103.2ms SatisfiabilityAnalysisTime, 1826.8ms InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 6156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...