/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 20:48:42,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 20:48:42,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 20:48:42,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 20:48:42,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 20:48:42,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 20:48:42,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 20:48:42,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 20:48:42,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 20:48:42,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 20:48:42,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 20:48:42,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 20:48:42,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 20:48:42,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 20:48:42,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 20:48:42,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 20:48:42,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 20:48:42,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 20:48:42,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 20:48:42,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 20:48:42,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 20:48:42,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 20:48:42,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 20:48:42,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 20:48:42,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 20:48:42,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 20:48:42,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 20:48:42,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 20:48:42,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 20:48:42,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 20:48:42,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 20:48:42,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 20:48:42,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 20:48:42,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 20:48:42,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 20:48:42,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 20:48:42,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 20:48:42,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 20:48:42,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 20:48:42,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 20:48:42,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 20:48:42,799 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-05-21 20:48:42,835 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 20:48:42,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 20:48:42,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 20:48:42,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 20:48:42,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 20:48:42,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 20:48:42,839 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 20:48:42,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 20:48:42,839 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 20:48:42,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 20:48:42,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 20:48:42,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 20:48:42,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 20:48:42,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 20:48:42,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 20:48:42,840 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 20:48:42,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 20:48:42,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 20:48:42,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 20:48:42,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 20:48:42,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 20:48:42,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 20:48:42,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 20:48:42,842 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 20:48:42,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 20:48:42,842 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-05-21 20:48:43,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 20:48:43,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 20:48:43,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 20:48:43,124 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 20:48:43,126 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 20:48:43,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-trans.wvr.bpl [2021-05-21 20:48:43,127 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-trans.wvr.bpl' [2021-05-21 20:48:43,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 20:48:43,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 20:48:43,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 20:48:43,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 20:48:43,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 20:48:43,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 20:48:43,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 20:48:43,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 20:48:43,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 20:48:43,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/1) ... [2021-05-21 20:48:43,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 20:48:43,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 20:48:43,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 20:48:43,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 20:48:43,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (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-05-21 20:48:43,328 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-05-21 20:48:43,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-05-21 20:48:43,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-05-21 20:48:43,329 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-05-21 20:48:43,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-05-21 20:48:43,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-05-21 20:48:43,329 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 20:48:43,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 20:48:43,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 20:48:43,330 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-05-21 20:48:43,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-05-21 20:48:43,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-05-21 20:48:43,331 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-21 20:48:44,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 20:48:44,235 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-05-21 20:48:44,236 INFO L202 PluginConnector]: Adding new model poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:48:44 BoogieIcfgContainer [2021-05-21 20:48:44,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 20:48:44,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 20:48:44,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 20:48:44,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 20:48:44,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:48:43" (1/2) ... [2021-05-21 20:48:44,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6158d7a and model type poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 08:48:44, skipping insertion in model container [2021-05-21 20:48:44,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:48:44" (2/2) ... [2021-05-21 20:48:44,248 INFO L111 eAbstractionObserver]: Analyzing ICFG poker-hand-trans.wvr.bpl [2021-05-21 20:48:44,253 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 20:48:44,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 20:48:44,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 20:48:44,255 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 20:48:44,306 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-05-21 20:48:44,321 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-05-21 20:48:44,335 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 20:48:44,336 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 20:48:44,336 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 20:48:44,336 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 20:48:44,336 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 20:48:44,336 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 20:48:44,339 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 20:48:44,339 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 20:48:44,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 37 transitions, 98 flow [2021-05-21 20:48:44,377 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:48:44,395 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:44,396 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:44,396 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1233644461, now seen corresponding path program 1 times [2021-05-21 20:48:44,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:44,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008190288] [2021-05-21 20:48:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:44,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:44,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008190288] [2021-05-21 20:48:44,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008190288] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:44,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:44,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:44,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182355394] [2021-05-21 20:48:44,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:44,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:44,989 INFO L87 Difference]: Start difference. First operand has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:45,342 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-05-21 20:48:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:45,404 INFO L93 Difference]: Finished difference Result 319 states and 1217 transitions. [2021-05-21 20:48:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:45,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-05-21 20:48:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:45,427 INFO L225 Difference]: With dead ends: 319 [2021-05-21 20:48:45,427 INFO L226 Difference]: Without dead ends: 304 [2021-05-21 20:48:45,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 409.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-05-21 20:48:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 201. [2021-05-21 20:48:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 4.41) internal successors, (882), 200 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 882 transitions. [2021-05-21 20:48:45,515 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 882 transitions. Word has length 14 [2021-05-21 20:48:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:45,516 INFO L482 AbstractCegarLoop]: Abstraction has 201 states and 882 transitions. [2021-05-21 20:48:45,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 882 transitions. [2021-05-21 20:48:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:48:45,519 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:45,519 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:45,519 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 20:48:45,520 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:45,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2024028845, now seen corresponding path program 2 times [2021-05-21 20:48:45,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:45,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701752901] [2021-05-21 20:48:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:45,792 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2021-05-21 20:48:46,011 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-05-21 20:48:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:46,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:46,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701752901] [2021-05-21 20:48:46,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701752901] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:46,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:46,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:46,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461757907] [2021-05-21 20:48:46,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:46,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:46,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:46,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:46,039 INFO L87 Difference]: Start difference. First operand 201 states and 882 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:46,404 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-05-21 20:48:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:46,453 INFO L93 Difference]: Finished difference Result 346 states and 1298 transitions. [2021-05-21 20:48:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:46,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-05-21 20:48:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:46,458 INFO L225 Difference]: With dead ends: 346 [2021-05-21 20:48:46,458 INFO L226 Difference]: Without dead ends: 331 [2021-05-21 20:48:46,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 492.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-05-21 20:48:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 212. [2021-05-21 20:48:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 4.322274881516588) internal successors, (912), 211 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 912 transitions. [2021-05-21 20:48:46,495 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 912 transitions. Word has length 14 [2021-05-21 20:48:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:46,495 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 912 transitions. [2021-05-21 20:48:46,496 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 912 transitions. [2021-05-21 20:48:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:48:46,498 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:46,498 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:46,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 20:48:46,498 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1840634711, now seen corresponding path program 3 times [2021-05-21 20:48:46,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:46,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610284735] [2021-05-21 20:48:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:46,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:46,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610284735] [2021-05-21 20:48:46,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610284735] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:46,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:46,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:46,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266528704] [2021-05-21 20:48:46,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:46,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:46,809 INFO L87 Difference]: Start difference. First operand 212 states and 912 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:47,137 INFO L93 Difference]: Finished difference Result 378 states and 1427 transitions. [2021-05-21 20:48:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-05-21 20:48:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:47,145 INFO L225 Difference]: With dead ends: 378 [2021-05-21 20:48:47,147 INFO L226 Difference]: Without dead ends: 363 [2021-05-21 20:48:47,148 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 346.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-05-21 20:48:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 219. [2021-05-21 20:48:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 4.330275229357798) internal successors, (944), 218 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 944 transitions. [2021-05-21 20:48:47,169 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 944 transitions. Word has length 14 [2021-05-21 20:48:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:47,170 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 944 transitions. [2021-05-21 20:48:47,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 944 transitions. [2021-05-21 20:48:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:48:47,175 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:47,175 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:47,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 20:48:47,175 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -867555397, now seen corresponding path program 4 times [2021-05-21 20:48:47,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:47,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694979079] [2021-05-21 20:48:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:47,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:47,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694979079] [2021-05-21 20:48:47,426 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694979079] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:47,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:47,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:47,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387931162] [2021-05-21 20:48:47,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:47,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:47,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:47,427 INFO L87 Difference]: Start difference. First operand 219 states and 944 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:47,757 INFO L93 Difference]: Finished difference Result 369 states and 1403 transitions. [2021-05-21 20:48:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:47,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-05-21 20:48:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:47,761 INFO L225 Difference]: With dead ends: 369 [2021-05-21 20:48:47,761 INFO L226 Difference]: Without dead ends: 354 [2021-05-21 20:48:47,761 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 343.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-05-21 20:48:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 231. [2021-05-21 20:48:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 4.243478260869566) internal successors, (976), 230 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 976 transitions. [2021-05-21 20:48:47,773 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 976 transitions. Word has length 14 [2021-05-21 20:48:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:47,773 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 976 transitions. [2021-05-21 20:48:47,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 976 transitions. [2021-05-21 20:48:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:48:47,774 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:47,775 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:47,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 20:48:47,775 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 922889575, now seen corresponding path program 5 times [2021-05-21 20:48:47,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:47,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977443534] [2021-05-21 20:48:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:47,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:47,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977443534] [2021-05-21 20:48:47,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977443534] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:47,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:47,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:47,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170006693] [2021-05-21 20:48:47,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:47,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:47,992 INFO L87 Difference]: Start difference. First operand 231 states and 976 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:48,322 INFO L93 Difference]: Finished difference Result 348 states and 1312 transitions. [2021-05-21 20:48:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:48,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-05-21 20:48:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:48,327 INFO L225 Difference]: With dead ends: 348 [2021-05-21 20:48:48,327 INFO L226 Difference]: Without dead ends: 333 [2021-05-21 20:48:48,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 359.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-05-21 20:48:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2021-05-21 20:48:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 4.262931034482759) internal successors, (989), 232 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 989 transitions. [2021-05-21 20:48:48,337 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 989 transitions. Word has length 14 [2021-05-21 20:48:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:48,337 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 989 transitions. [2021-05-21 20:48:48,337 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 989 transitions. [2021-05-21 20:48:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:48:48,339 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:48,339 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:48,339 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 20:48:48,339 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash 594755113, now seen corresponding path program 6 times [2021-05-21 20:48:48,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:48,340 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96897133] [2021-05-21 20:48:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:48,649 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2021-05-21 20:48:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:48,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:48,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96897133] [2021-05-21 20:48:48,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96897133] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:48,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:48,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:48,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403789897] [2021-05-21 20:48:48,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:48,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:48,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:48,676 INFO L87 Difference]: Start difference. First operand 233 states and 989 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,010 INFO L93 Difference]: Finished difference Result 358 states and 1349 transitions. [2021-05-21 20:48:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:49,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-05-21 20:48:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,013 INFO L225 Difference]: With dead ends: 358 [2021-05-21 20:48:49,014 INFO L226 Difference]: Without dead ends: 343 [2021-05-21 20:48:49,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 441.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-05-21 20:48:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 233. [2021-05-21 20:48:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 4.262931034482759) internal successors, (989), 232 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 989 transitions. [2021-05-21 20:48:49,024 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 989 transitions. Word has length 14 [2021-05-21 20:48:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,024 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 989 transitions. [2021-05-21 20:48:49,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 989 transitions. [2021-05-21 20:48:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-21 20:48:49,025 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,025 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 20:48:49,026 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1067380313, now seen corresponding path program 1 times [2021-05-21 20:48:49,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581337108] [2021-05-21 20:48:49,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:49,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581337108] [2021-05-21 20:48:49,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581337108] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:48:49,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758513874] [2021-05-21 20:48:49,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:48:49,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:48:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,049 INFO L87 Difference]: Start difference. First operand 233 states and 989 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,055 INFO L93 Difference]: Finished difference Result 268 states and 1130 transitions. [2021-05-21 20:48:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:48:49,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-05-21 20:48:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,057 INFO L225 Difference]: With dead ends: 268 [2021-05-21 20:48:49,057 INFO L226 Difference]: Without dead ends: 268 [2021-05-21 20:48:49,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-05-21 20:48:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2021-05-21 20:48:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 4.2796934865900385) internal successors, (1117), 261 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 1117 transitions. [2021-05-21 20:48:49,067 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 1117 transitions. Word has length 15 [2021-05-21 20:48:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,067 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 1117 transitions. [2021-05-21 20:48:49,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 1117 transitions. [2021-05-21 20:48:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-21 20:48:49,068 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,068 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 20:48:49,068 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1654834201, now seen corresponding path program 1 times [2021-05-21 20:48:49,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865738747] [2021-05-21 20:48:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:49,085 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865738747] [2021-05-21 20:48:49,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865738747] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:48:49,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098336447] [2021-05-21 20:48:49,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:48:49,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:48:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,087 INFO L87 Difference]: Start difference. First operand 262 states and 1117 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,094 INFO L93 Difference]: Finished difference Result 297 states and 1258 transitions. [2021-05-21 20:48:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:48:49,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-05-21 20:48:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,097 INFO L225 Difference]: With dead ends: 297 [2021-05-21 20:48:49,097 INFO L226 Difference]: Without dead ends: 297 [2021-05-21 20:48:49,098 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-05-21 20:48:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-05-21 20:48:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 4.25) internal successors, (1258), 296 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 1258 transitions. [2021-05-21 20:48:49,108 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 1258 transitions. Word has length 15 [2021-05-21 20:48:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,108 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 1258 transitions. [2021-05-21 20:48:49,108 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 1258 transitions. [2021-05-21 20:48:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-21 20:48:49,110 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,110 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 20:48:49,110 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2109293491, now seen corresponding path program 1 times [2021-05-21 20:48:49,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190709814] [2021-05-21 20:48:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:49,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190709814] [2021-05-21 20:48:49,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190709814] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:48:49,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86123769] [2021-05-21 20:48:49,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:48:49,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:48:49,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,126 INFO L87 Difference]: Start difference. First operand 297 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,132 INFO L93 Difference]: Finished difference Result 340 states and 1425 transitions. [2021-05-21 20:48:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:48:49,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-05-21 20:48:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,135 INFO L225 Difference]: With dead ends: 340 [2021-05-21 20:48:49,135 INFO L226 Difference]: Without dead ends: 340 [2021-05-21 20:48:49,135 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-05-21 20:48:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2021-05-21 20:48:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 4.2298507462686565) internal successors, (1417), 335 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1417 transitions. [2021-05-21 20:48:49,145 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1417 transitions. Word has length 15 [2021-05-21 20:48:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,146 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 1417 transitions. [2021-05-21 20:48:49,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1417 transitions. [2021-05-21 20:48:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-21 20:48:49,147 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,147 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,147 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 20:48:49,147 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1748926659, now seen corresponding path program 1 times [2021-05-21 20:48:49,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469557347] [2021-05-21 20:48:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:49,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469557347] [2021-05-21 20:48:49,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469557347] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:48:49,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290618847] [2021-05-21 20:48:49,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:48:49,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:48:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,163 INFO L87 Difference]: Start difference. First operand 336 states and 1417 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,169 INFO L93 Difference]: Finished difference Result 386 states and 1608 transitions. [2021-05-21 20:48:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:48:49,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-05-21 20:48:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,172 INFO L225 Difference]: With dead ends: 386 [2021-05-21 20:48:49,173 INFO L226 Difference]: Without dead ends: 386 [2021-05-21 20:48:49,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-05-21 20:48:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-05-21 20:48:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 4.176623376623376) internal successors, (1608), 385 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1608 transitions. [2021-05-21 20:48:49,185 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1608 transitions. Word has length 15 [2021-05-21 20:48:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,185 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1608 transitions. [2021-05-21 20:48:49,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1608 transitions. [2021-05-21 20:48:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-21 20:48:49,186 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,186 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 20:48:49,187 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,187 INFO L82 PathProgramCache]: Analyzing trace with hash 181705837, now seen corresponding path program 1 times [2021-05-21 20:48:49,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916658960] [2021-05-21 20:48:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,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-05-21 20:48:49,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916658960] [2021-05-21 20:48:49,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916658960] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:48:49,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956707821] [2021-05-21 20:48:49,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:48:49,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:48:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,202 INFO L87 Difference]: Start difference. First operand 386 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,208 INFO L93 Difference]: Finished difference Result 436 states and 1799 transitions. [2021-05-21 20:48:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:48:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-05-21 20:48:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,211 INFO L225 Difference]: With dead ends: 436 [2021-05-21 20:48:49,212 INFO L226 Difference]: Without dead ends: 436 [2021-05-21 20:48:49,212 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-05-21 20:48:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2021-05-21 20:48:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 4.135632183908046) internal successors, (1799), 435 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1799 transitions. [2021-05-21 20:48:49,224 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1799 transitions. Word has length 15 [2021-05-21 20:48:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,225 INFO L482 AbstractCegarLoop]: Abstraction has 436 states and 1799 transitions. [2021-05-21 20:48:49,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1799 transitions. [2021-05-21 20:48:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-21 20:48:49,226 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,226 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 20:48:49,227 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash 542072669, now seen corresponding path program 1 times [2021-05-21 20:48:49,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091743867] [2021-05-21 20:48:49,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:49,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091743867] [2021-05-21 20:48:49,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091743867] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:48:49,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664446189] [2021-05-21 20:48:49,242 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:48:49,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:48:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,243 INFO L87 Difference]: Start difference. First operand 436 states and 1799 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,250 INFO L93 Difference]: Finished difference Result 493 states and 2014 transitions. [2021-05-21 20:48:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:48:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-05-21 20:48:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,253 INFO L225 Difference]: With dead ends: 493 [2021-05-21 20:48:49,254 INFO L226 Difference]: Without dead ends: 493 [2021-05-21 20:48:49,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:48:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-05-21 20:48:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2021-05-21 20:48:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 4.09349593495935) internal successors, (2014), 492 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 2014 transitions. [2021-05-21 20:48:49,269 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 2014 transitions. Word has length 15 [2021-05-21 20:48:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,269 INFO L482 AbstractCegarLoop]: Abstraction has 493 states and 2014 transitions. [2021-05-21 20:48:49,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 2014 transitions. [2021-05-21 20:48:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:49,271 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,271 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 20:48:49,272 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash -85243986, now seen corresponding path program 1 times [2021-05-21 20:48:49,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217197781] [2021-05-21 20:48:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:49,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217197781] [2021-05-21 20:48:49,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217197781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:49,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106480311] [2021-05-21 20:48:49,327 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:49,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:49,328 INFO L87 Difference]: Start difference. First operand 493 states and 2014 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,439 INFO L93 Difference]: Finished difference Result 725 states and 2618 transitions. [2021-05-21 20:48:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,443 INFO L225 Difference]: With dead ends: 725 [2021-05-21 20:48:49,444 INFO L226 Difference]: Without dead ends: 698 [2021-05-21 20:48:49,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-05-21 20:48:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 544. [2021-05-21 20:48:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.955801104972376) internal successors, (2148), 543 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 2148 transitions. [2021-05-21 20:48:49,464 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 2148 transitions. Word has length 16 [2021-05-21 20:48:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,464 INFO L482 AbstractCegarLoop]: Abstraction has 544 states and 2148 transitions. [2021-05-21 20:48:49,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 2148 transitions. [2021-05-21 20:48:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:49,466 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,466 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 20:48:49,467 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 705140398, now seen corresponding path program 2 times [2021-05-21 20:48:49,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740929582] [2021-05-21 20:48:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:49,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740929582] [2021-05-21 20:48:49,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740929582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:49,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215956204] [2021-05-21 20:48:49,507 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:49,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:49,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:49,508 INFO L87 Difference]: Start difference. First operand 544 states and 2148 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:49,606 INFO L93 Difference]: Finished difference Result 779 states and 2777 transitions. [2021-05-21 20:48:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:49,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:49,611 INFO L225 Difference]: With dead ends: 779 [2021-05-21 20:48:49,611 INFO L226 Difference]: Without dead ends: 752 [2021-05-21 20:48:49,611 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-05-21 20:48:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 565. [2021-05-21 20:48:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.904255319148936) internal successors, (2202), 564 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 2202 transitions. [2021-05-21 20:48:49,629 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 2202 transitions. Word has length 16 [2021-05-21 20:48:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:49,629 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 2202 transitions. [2021-05-21 20:48:49,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 2202 transitions. [2021-05-21 20:48:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:49,631 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:49,631 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:49,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 20:48:49,631 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1662493965, now seen corresponding path program 1 times [2021-05-21 20:48:49,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:49,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559853263] [2021-05-21 20:48:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:49,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:49,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559853263] [2021-05-21 20:48:49,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559853263] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:49,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:49,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:49,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850362454] [2021-05-21 20:48:49,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:49,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:49,713 INFO L87 Difference]: Start difference. First operand 565 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:50,027 INFO L93 Difference]: Finished difference Result 793 states and 2784 transitions. [2021-05-21 20:48:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:50,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:50,032 INFO L225 Difference]: With dead ends: 793 [2021-05-21 20:48:50,032 INFO L226 Difference]: Without dead ends: 766 [2021-05-21 20:48:50,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 252.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-05-21 20:48:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 612. [2021-05-21 20:48:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.7872340425531914) internal successors, (2314), 611 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 2314 transitions. [2021-05-21 20:48:50,053 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 2314 transitions. Word has length 16 [2021-05-21 20:48:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:50,053 INFO L482 AbstractCegarLoop]: Abstraction has 612 states and 2314 transitions. [2021-05-21 20:48:50,053 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 2314 transitions. [2021-05-21 20:48:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:50,055 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:50,055 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:50,055 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 20:48:50,055 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1842088947, now seen corresponding path program 2 times [2021-05-21 20:48:50,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:50,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901561853] [2021-05-21 20:48:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:50,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:50,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901561853] [2021-05-21 20:48:50,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901561853] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:50,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:50,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:50,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561754685] [2021-05-21 20:48:50,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:50,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:50,162 INFO L87 Difference]: Start difference. First operand 612 states and 2314 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:50,455 INFO L93 Difference]: Finished difference Result 847 states and 2943 transitions. [2021-05-21 20:48:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:50,460 INFO L225 Difference]: With dead ends: 847 [2021-05-21 20:48:50,460 INFO L226 Difference]: Without dead ends: 820 [2021-05-21 20:48:50,461 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 226.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-05-21 20:48:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 633. [2021-05-21 20:48:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 3.7468354430379747) internal successors, (2368), 632 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 2368 transitions. [2021-05-21 20:48:50,480 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 2368 transitions. Word has length 16 [2021-05-21 20:48:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:50,481 INFO L482 AbstractCegarLoop]: Abstraction has 633 states and 2368 transitions. [2021-05-21 20:48:50,481 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 2368 transitions. [2021-05-21 20:48:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:50,483 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:50,483 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:50,483 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 20:48:50,483 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -881757258, now seen corresponding path program 1 times [2021-05-21 20:48:50,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:50,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14323835] [2021-05-21 20:48:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:50,536 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:50,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14323835] [2021-05-21 20:48:50,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14323835] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:50,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:50,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:50,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323894433] [2021-05-21 20:48:50,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:50,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:50,538 INFO L87 Difference]: Start difference. First operand 633 states and 2368 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:50,688 INFO L93 Difference]: Finished difference Result 974 states and 3400 transitions. [2021-05-21 20:48:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:50,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:50,693 INFO L225 Difference]: With dead ends: 974 [2021-05-21 20:48:50,694 INFO L226 Difference]: Without dead ends: 951 [2021-05-21 20:48:50,694 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:48:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-05-21 20:48:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 641. [2021-05-21 20:48:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.7375) internal successors, (2392), 640 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 2392 transitions. [2021-05-21 20:48:50,712 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 2392 transitions. Word has length 16 [2021-05-21 20:48:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:50,713 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 2392 transitions. [2021-05-21 20:48:50,713 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 2392 transitions. [2021-05-21 20:48:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:50,715 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:50,715 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:50,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 20:48:50,715 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 768619160, now seen corresponding path program 1 times [2021-05-21 20:48:50,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:50,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38105066] [2021-05-21 20:48:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:50,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:50,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38105066] [2021-05-21 20:48:50,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38105066] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:50,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:50,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:50,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868833243] [2021-05-21 20:48:50,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:50,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:50,778 INFO L87 Difference]: Start difference. First operand 641 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:50,954 INFO L93 Difference]: Finished difference Result 965 states and 3345 transitions. [2021-05-21 20:48:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:50,959 INFO L225 Difference]: With dead ends: 965 [2021-05-21 20:48:50,959 INFO L226 Difference]: Without dead ends: 936 [2021-05-21 20:48:50,960 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 88.7ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:48:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-05-21 20:48:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 645. [2021-05-21 20:48:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 3.732919254658385) internal successors, (2404), 644 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2404 transitions. [2021-05-21 20:48:50,977 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2404 transitions. Word has length 16 [2021-05-21 20:48:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:50,978 INFO L482 AbstractCegarLoop]: Abstraction has 645 states and 2404 transitions. [2021-05-21 20:48:50,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2404 transitions. [2021-05-21 20:48:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:51,007 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:51,007 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:51,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 20:48:51,007 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1488759573, now seen corresponding path program 1 times [2021-05-21 20:48:51,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:51,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955125292] [2021-05-21 20:48:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:51,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:51,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955125292] [2021-05-21 20:48:51,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955125292] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:51,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:51,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:51,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608825085] [2021-05-21 20:48:51,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:51,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:51,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:51,145 INFO L87 Difference]: Start difference. First operand 645 states and 2404 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:51,386 INFO L93 Difference]: Finished difference Result 1001 states and 3467 transitions. [2021-05-21 20:48:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:51,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:51,391 INFO L225 Difference]: With dead ends: 1001 [2021-05-21 20:48:51,391 INFO L226 Difference]: Without dead ends: 978 [2021-05-21 20:48:51,391 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 185.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:48:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-05-21 20:48:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 653. [2021-05-21 20:48:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 3.723926380368098) internal successors, (2428), 652 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 2428 transitions. [2021-05-21 20:48:51,410 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 2428 transitions. Word has length 16 [2021-05-21 20:48:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:51,410 INFO L482 AbstractCegarLoop]: Abstraction has 653 states and 2428 transitions. [2021-05-21 20:48:51,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 2428 transitions. [2021-05-21 20:48:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:51,412 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:51,412 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:51,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 20:48:51,412 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash 185156587, now seen corresponding path program 1 times [2021-05-21 20:48:51,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:51,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885025396] [2021-05-21 20:48:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:51,536 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:51,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885025396] [2021-05-21 20:48:51,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885025396] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:51,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:51,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:51,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411523547] [2021-05-21 20:48:51,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:51,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:51,537 INFO L87 Difference]: Start difference. First operand 653 states and 2428 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:51,751 INFO L93 Difference]: Finished difference Result 972 states and 3352 transitions. [2021-05-21 20:48:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:51,756 INFO L225 Difference]: With dead ends: 972 [2021-05-21 20:48:51,756 INFO L226 Difference]: Without dead ends: 943 [2021-05-21 20:48:51,756 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 157.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:48:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-05-21 20:48:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 657. [2021-05-21 20:48:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.7195121951219514) internal successors, (2440), 656 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2440 transitions. [2021-05-21 20:48:51,774 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2440 transitions. Word has length 16 [2021-05-21 20:48:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:51,774 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2440 transitions. [2021-05-21 20:48:51,774 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2440 transitions. [2021-05-21 20:48:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:51,776 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:51,776 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:51,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 20:48:51,776 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:51,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1227931188, now seen corresponding path program 2 times [2021-05-21 20:48:51,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:51,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015272899] [2021-05-21 20:48:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:51,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:51,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015272899] [2021-05-21 20:48:51,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015272899] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:51,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:51,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:51,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182348417] [2021-05-21 20:48:51,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:51,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:51,893 INFO L87 Difference]: Start difference. First operand 657 states and 2440 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:52,071 INFO L93 Difference]: Finished difference Result 1111 states and 3792 transitions. [2021-05-21 20:48:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:52,077 INFO L225 Difference]: With dead ends: 1111 [2021-05-21 20:48:52,077 INFO L226 Difference]: Without dead ends: 1088 [2021-05-21 20:48:52,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 141.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-05-21 20:48:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 657. [2021-05-21 20:48:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.7195121951219514) internal successors, (2440), 656 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2440 transitions. [2021-05-21 20:48:52,099 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2440 transitions. Word has length 16 [2021-05-21 20:48:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:52,099 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2440 transitions. [2021-05-21 20:48:52,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2440 transitions. [2021-05-21 20:48:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:52,101 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:52,101 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:52,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 20:48:52,101 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1214418261, now seen corresponding path program 2 times [2021-05-21 20:48:52,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:52,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129948354] [2021-05-21 20:48:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:52,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:52,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129948354] [2021-05-21 20:48:52,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129948354] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:52,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:52,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:52,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899486458] [2021-05-21 20:48:52,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:52,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:52,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:52,192 INFO L87 Difference]: Start difference. First operand 657 states and 2440 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:52,383 INFO L93 Difference]: Finished difference Result 1170 states and 4048 transitions. [2021-05-21 20:48:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:48:52,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:52,389 INFO L225 Difference]: With dead ends: 1170 [2021-05-21 20:48:52,389 INFO L226 Difference]: Without dead ends: 1143 [2021-05-21 20:48:52,389 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 123.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2021-05-21 20:48:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 657. [2021-05-21 20:48:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.716463414634146) internal successors, (2438), 656 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2438 transitions. [2021-05-21 20:48:52,408 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2438 transitions. Word has length 16 [2021-05-21 20:48:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:52,408 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2438 transitions. [2021-05-21 20:48:52,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2438 transitions. [2021-05-21 20:48:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:52,410 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:52,410 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:52,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-21 20:48:52,410 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1866944204, now seen corresponding path program 2 times [2021-05-21 20:48:52,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:52,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469437878] [2021-05-21 20:48:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:52,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:52,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469437878] [2021-05-21 20:48:52,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469437878] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:52,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:52,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:52,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741043694] [2021-05-21 20:48:52,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:52,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:52,493 INFO L87 Difference]: Start difference. First operand 657 states and 2438 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:52,624 INFO L93 Difference]: Finished difference Result 1084 states and 3756 transitions. [2021-05-21 20:48:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:52,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:52,628 INFO L225 Difference]: With dead ends: 1084 [2021-05-21 20:48:52,628 INFO L226 Difference]: Without dead ends: 1055 [2021-05-21 20:48:52,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2021-05-21 20:48:52,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 657. [2021-05-21 20:48:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.716463414634146) internal successors, (2438), 656 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2438 transitions. [2021-05-21 20:48:52,644 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2438 transitions. Word has length 16 [2021-05-21 20:48:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:52,644 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2438 transitions. [2021-05-21 20:48:52,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2438 transitions. [2021-05-21 20:48:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:52,646 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:52,646 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:52,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-21 20:48:52,646 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1453708437, now seen corresponding path program 2 times [2021-05-21 20:48:52,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:52,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112809402] [2021-05-21 20:48:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:52,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:52,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112809402] [2021-05-21 20:48:52,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112809402] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:52,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:52,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:52,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737150874] [2021-05-21 20:48:52,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:52,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:52,747 INFO L87 Difference]: Start difference. First operand 657 states and 2438 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:52,950 INFO L93 Difference]: Finished difference Result 1088 states and 3765 transitions. [2021-05-21 20:48:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:52,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:52,953 INFO L225 Difference]: With dead ends: 1088 [2021-05-21 20:48:52,953 INFO L226 Difference]: Without dead ends: 1048 [2021-05-21 20:48:52,953 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 159.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-05-21 20:48:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 657. [2021-05-21 20:48:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 3.7103658536585367) internal successors, (2434), 656 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2434 transitions. [2021-05-21 20:48:52,969 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2434 transitions. Word has length 16 [2021-05-21 20:48:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:52,970 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 2434 transitions. [2021-05-21 20:48:52,970 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2434 transitions. [2021-05-21 20:48:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:52,972 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:52,972 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:52,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-21 20:48:52,972 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:52,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash 486403162, now seen corresponding path program 3 times [2021-05-21 20:48:52,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:52,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670890104] [2021-05-21 20:48:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:53,018 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:53,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670890104] [2021-05-21 20:48:53,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670890104] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:53,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:53,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:53,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311087462] [2021-05-21 20:48:53,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:53,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:53,019 INFO L87 Difference]: Start difference. First operand 657 states and 2434 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:53,109 INFO L93 Difference]: Finished difference Result 869 states and 2928 transitions. [2021-05-21 20:48:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:53,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:53,112 INFO L225 Difference]: With dead ends: 869 [2021-05-21 20:48:53,112 INFO L226 Difference]: Without dead ends: 846 [2021-05-21 20:48:53,112 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-05-21 20:48:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 634. [2021-05-21 20:48:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 3.654028436018957) internal successors, (2313), 633 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2313 transitions. [2021-05-21 20:48:53,127 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 2313 transitions. Word has length 16 [2021-05-21 20:48:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:53,127 INFO L482 AbstractCegarLoop]: Abstraction has 634 states and 2313 transitions. [2021-05-21 20:48:53,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 2313 transitions. [2021-05-21 20:48:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:53,129 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:53,129 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:53,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-21 20:48:53,129 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1119769510, now seen corresponding path program 4 times [2021-05-21 20:48:53,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:53,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495144067] [2021-05-21 20:48:53,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:53,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:53,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495144067] [2021-05-21 20:48:53,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495144067] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:53,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:53,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:53,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70648251] [2021-05-21 20:48:53,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:53,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:53,185 INFO L87 Difference]: Start difference. First operand 634 states and 2313 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:53,305 INFO L93 Difference]: Finished difference Result 825 states and 2808 transitions. [2021-05-21 20:48:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:53,308 INFO L225 Difference]: With dead ends: 825 [2021-05-21 20:48:53,308 INFO L226 Difference]: Without dead ends: 802 [2021-05-21 20:48:53,308 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-05-21 20:48:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 644. [2021-05-21 20:48:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 3.636080870917574) internal successors, (2338), 643 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 2338 transitions. [2021-05-21 20:48:53,322 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 2338 transitions. Word has length 16 [2021-05-21 20:48:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:53,322 INFO L482 AbstractCegarLoop]: Abstraction has 644 states and 2338 transitions. [2021-05-21 20:48:53,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 2338 transitions. [2021-05-21 20:48:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:53,324 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:53,324 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:53,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-21 20:48:53,324 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash 423749436, now seen corresponding path program 3 times [2021-05-21 20:48:53,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:53,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108674753] [2021-05-21 20:48:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:53,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:53,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108674753] [2021-05-21 20:48:53,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108674753] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:53,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:53,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:53,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526592532] [2021-05-21 20:48:53,399 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:53,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:53,399 INFO L87 Difference]: Start difference. First operand 644 states and 2338 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:53,496 INFO L93 Difference]: Finished difference Result 815 states and 2725 transitions. [2021-05-21 20:48:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:53,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:53,502 INFO L225 Difference]: With dead ends: 815 [2021-05-21 20:48:53,502 INFO L226 Difference]: Without dead ends: 786 [2021-05-21 20:48:53,502 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-05-21 20:48:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 612. [2021-05-21 20:48:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.5810147299509003) internal successors, (2188), 611 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 2188 transitions. [2021-05-21 20:48:53,516 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 2188 transitions. Word has length 16 [2021-05-21 20:48:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:53,516 INFO L482 AbstractCegarLoop]: Abstraction has 612 states and 2188 transitions. [2021-05-21 20:48:53,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 2188 transitions. [2021-05-21 20:48:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:53,518 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:53,518 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:53,518 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-21 20:48:53,518 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash 315557690, now seen corresponding path program 4 times [2021-05-21 20:48:53,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:53,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170759931] [2021-05-21 20:48:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:53,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:53,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170759931] [2021-05-21 20:48:53,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170759931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:53,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:53,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:53,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406574149] [2021-05-21 20:48:53,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:53,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:53,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:53,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:53,581 INFO L87 Difference]: Start difference. First operand 612 states and 2188 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:53,660 INFO L93 Difference]: Finished difference Result 803 states and 2689 transitions. [2021-05-21 20:48:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:53,662 INFO L225 Difference]: With dead ends: 803 [2021-05-21 20:48:53,662 INFO L226 Difference]: Without dead ends: 774 [2021-05-21 20:48:53,662 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2021-05-21 20:48:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 618. [2021-05-21 20:48:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 3.5769854132901133) internal successors, (2207), 617 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2207 transitions. [2021-05-21 20:48:53,676 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2207 transitions. Word has length 16 [2021-05-21 20:48:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:53,676 INFO L482 AbstractCegarLoop]: Abstraction has 618 states and 2207 transitions. [2021-05-21 20:48:53,676 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2207 transitions. [2021-05-21 20:48:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:53,677 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:53,677 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:53,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-21 20:48:53,678 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2014690215, now seen corresponding path program 3 times [2021-05-21 20:48:53,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:53,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367743612] [2021-05-21 20:48:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:53,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:53,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367743612] [2021-05-21 20:48:53,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367743612] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:53,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:53,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:53,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538973987] [2021-05-21 20:48:53,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:53,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:53,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:53,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:53,787 INFO L87 Difference]: Start difference. First operand 618 states and 2207 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:54,040 INFO L93 Difference]: Finished difference Result 742 states and 2401 transitions. [2021-05-21 20:48:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:54,046 INFO L225 Difference]: With dead ends: 742 [2021-05-21 20:48:54,046 INFO L226 Difference]: Without dead ends: 719 [2021-05-21 20:48:54,047 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-05-21 20:48:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 555. [2021-05-21 20:48:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 3.487364620938628) internal successors, (1932), 554 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1932 transitions. [2021-05-21 20:48:54,059 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1932 transitions. Word has length 16 [2021-05-21 20:48:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:54,059 INFO L482 AbstractCegarLoop]: Abstraction has 555 states and 1932 transitions. [2021-05-21 20:48:54,059 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1932 transitions. [2021-05-21 20:48:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:54,060 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:54,060 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:54,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-21 20:48:54,061 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1307197767, now seen corresponding path program 4 times [2021-05-21 20:48:54,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:54,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538452781] [2021-05-21 20:48:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:54,139 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:54,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538452781] [2021-05-21 20:48:54,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538452781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:54,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:54,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:54,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228310684] [2021-05-21 20:48:54,140 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:54,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:54,141 INFO L87 Difference]: Start difference. First operand 555 states and 1932 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:54,299 INFO L93 Difference]: Finished difference Result 829 states and 2671 transitions. [2021-05-21 20:48:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:54,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:54,300 INFO L225 Difference]: With dead ends: 829 [2021-05-21 20:48:54,300 INFO L226 Difference]: Without dead ends: 806 [2021-05-21 20:48:54,301 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-05-21 20:48:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 565. [2021-05-21 20:48:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.469858156028369) internal successors, (1957), 564 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1957 transitions. [2021-05-21 20:48:54,312 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1957 transitions. Word has length 16 [2021-05-21 20:48:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:54,312 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 1957 transitions. [2021-05-21 20:48:54,312 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1957 transitions. [2021-05-21 20:48:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:54,314 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:54,314 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:54,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-21 20:48:54,314 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2145877403, now seen corresponding path program 3 times [2021-05-21 20:48:54,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:54,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771710692] [2021-05-21 20:48:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:54,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:54,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771710692] [2021-05-21 20:48:54,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771710692] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:54,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:54,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:54,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305308100] [2021-05-21 20:48:54,389 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:54,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:54,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:54,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:54,390 INFO L87 Difference]: Start difference. First operand 565 states and 1957 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:54,562 INFO L93 Difference]: Finished difference Result 670 states and 2109 transitions. [2021-05-21 20:48:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:54,564 INFO L225 Difference]: With dead ends: 670 [2021-05-21 20:48:54,565 INFO L226 Difference]: Without dead ends: 641 [2021-05-21 20:48:54,565 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 139.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-05-21 20:48:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 499. [2021-05-21 20:48:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 3.3493975903614457) internal successors, (1668), 498 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1668 transitions. [2021-05-21 20:48:54,574 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1668 transitions. Word has length 16 [2021-05-21 20:48:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:54,574 INFO L482 AbstractCegarLoop]: Abstraction has 499 states and 1668 transitions. [2021-05-21 20:48:54,575 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1668 transitions. [2021-05-21 20:48:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:54,576 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:54,576 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:54,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-21 20:48:54,576 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1820955431, now seen corresponding path program 4 times [2021-05-21 20:48:54,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:54,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186533294] [2021-05-21 20:48:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:54,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:54,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186533294] [2021-05-21 20:48:54,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186533294] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:54,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:54,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:54,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194031431] [2021-05-21 20:48:54,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:54,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:54,646 INFO L87 Difference]: Start difference. First operand 499 states and 1668 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:54,855 INFO L93 Difference]: Finished difference Result 674 states and 2121 transitions. [2021-05-21 20:48:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:54,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:54,856 INFO L225 Difference]: With dead ends: 674 [2021-05-21 20:48:54,857 INFO L226 Difference]: Without dead ends: 645 [2021-05-21 20:48:54,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 173.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-05-21 20:48:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 505. [2021-05-21 20:48:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.3472222222222223) internal successors, (1687), 504 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1687 transitions. [2021-05-21 20:48:54,866 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1687 transitions. Word has length 16 [2021-05-21 20:48:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:54,867 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1687 transitions. [2021-05-21 20:48:54,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1687 transitions. [2021-05-21 20:48:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:54,868 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:54,868 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:54,868 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-21 20:48:54,868 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash 648487496, now seen corresponding path program 3 times [2021-05-21 20:48:54,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:54,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87926895] [2021-05-21 20:48:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:54,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:54,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87926895] [2021-05-21 20:48:54,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87926895] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:54,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:54,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:54,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43817412] [2021-05-21 20:48:54,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:54,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:54,950 INFO L87 Difference]: Start difference. First operand 505 states and 1687 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:55,174 INFO L93 Difference]: Finished difference Result 1060 states and 3246 transitions. [2021-05-21 20:48:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-21 20:48:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:55,177 INFO L225 Difference]: With dead ends: 1060 [2021-05-21 20:48:55,177 INFO L226 Difference]: Without dead ends: 1033 [2021-05-21 20:48:55,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 139.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-21 20:48:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2021-05-21 20:48:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 505. [2021-05-21 20:48:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.3472222222222223) internal successors, (1687), 504 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1687 transitions. [2021-05-21 20:48:55,192 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1687 transitions. Word has length 16 [2021-05-21 20:48:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:55,192 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1687 transitions. [2021-05-21 20:48:55,192 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1687 transitions. [2021-05-21 20:48:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:55,193 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:55,194 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:55,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-21 20:48:55,194 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash 749508455, now seen corresponding path program 3 times [2021-05-21 20:48:55,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:55,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124908868] [2021-05-21 20:48:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:55,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:55,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124908868] [2021-05-21 20:48:55,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124908868] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:55,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:55,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:55,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906762481] [2021-05-21 20:48:55,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:55,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:55,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:55,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:55,384 INFO L87 Difference]: Start difference. First operand 505 states and 1687 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:55,541 INFO L93 Difference]: Finished difference Result 821 states and 2570 transitions. [2021-05-21 20:48:55,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:55,543 INFO L225 Difference]: With dead ends: 821 [2021-05-21 20:48:55,543 INFO L226 Difference]: Without dead ends: 794 [2021-05-21 20:48:55,543 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 185.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-05-21 20:48:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 505. [2021-05-21 20:48:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.3472222222222223) internal successors, (1687), 504 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1687 transitions. [2021-05-21 20:48:55,554 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1687 transitions. Word has length 16 [2021-05-21 20:48:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:55,554 INFO L482 AbstractCegarLoop]: Abstraction has 505 states and 1687 transitions. [2021-05-21 20:48:55,555 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1687 transitions. [2021-05-21 20:48:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:55,556 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:55,556 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:55,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-21 20:48:55,556 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1222989368, now seen corresponding path program 5 times [2021-05-21 20:48:55,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:55,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827834931] [2021-05-21 20:48:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:55,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:55,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827834931] [2021-05-21 20:48:55,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827834931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:55,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:55,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:55,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717847518] [2021-05-21 20:48:55,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:55,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:55,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:55,614 INFO L87 Difference]: Start difference. First operand 505 states and 1687 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:55,759 INFO L93 Difference]: Finished difference Result 891 states and 2762 transitions. [2021-05-21 20:48:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:55,762 INFO L225 Difference]: With dead ends: 891 [2021-05-21 20:48:55,762 INFO L226 Difference]: Without dead ends: 862 [2021-05-21 20:48:55,762 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-05-21 20:48:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 494. [2021-05-21 20:48:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.36105476673428) internal successors, (1657), 493 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1657 transitions. [2021-05-21 20:48:55,773 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1657 transitions. Word has length 16 [2021-05-21 20:48:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:55,773 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1657 transitions. [2021-05-21 20:48:55,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1657 transitions. [2021-05-21 20:48:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:55,774 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:55,774 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:55,774 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-21 20:48:55,775 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -248674713, now seen corresponding path program 5 times [2021-05-21 20:48:55,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:55,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023923431] [2021-05-21 20:48:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:55,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:55,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023923431] [2021-05-21 20:48:55,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023923431] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:55,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:55,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:55,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915204261] [2021-05-21 20:48:55,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:55,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:55,857 INFO L87 Difference]: Start difference. First operand 494 states and 1657 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:56,047 INFO L93 Difference]: Finished difference Result 868 states and 2732 transitions. [2021-05-21 20:48:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:56,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:56,050 INFO L225 Difference]: With dead ends: 868 [2021-05-21 20:48:56,050 INFO L226 Difference]: Without dead ends: 828 [2021-05-21 20:48:56,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 127.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-05-21 20:48:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 494. [2021-05-21 20:48:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-05-21 20:48:56,060 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-05-21 20:48:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:56,060 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-05-21 20:48:56,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-05-21 20:48:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:56,061 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:56,062 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:56,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-21 20:48:56,062 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:56,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1291259644, now seen corresponding path program 6 times [2021-05-21 20:48:56,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:56,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057013453] [2021-05-21 20:48:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:56,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:56,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057013453] [2021-05-21 20:48:56,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057013453] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:56,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:56,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:56,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146458549] [2021-05-21 20:48:56,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:56,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:56,133 INFO L87 Difference]: Start difference. First operand 494 states and 1652 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:56,264 INFO L93 Difference]: Finished difference Result 741 states and 2296 transitions. [2021-05-21 20:48:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:56,266 INFO L225 Difference]: With dead ends: 741 [2021-05-21 20:48:56,266 INFO L226 Difference]: Without dead ends: 712 [2021-05-21 20:48:56,268 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-05-21 20:48:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 494. [2021-05-21 20:48:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-05-21 20:48:56,279 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-05-21 20:48:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:56,280 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-05-21 20:48:56,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-05-21 20:48:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:56,281 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:56,281 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:56,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-21 20:48:56,281 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1392400701, now seen corresponding path program 6 times [2021-05-21 20:48:56,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:56,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267772565] [2021-05-21 20:48:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:56,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:56,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267772565] [2021-05-21 20:48:56,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267772565] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:56,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:56,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:56,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611187394] [2021-05-21 20:48:56,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:56,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:56,403 INFO L87 Difference]: Start difference. First operand 494 states and 1652 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:56,556 INFO L93 Difference]: Finished difference Result 773 states and 2416 transitions. [2021-05-21 20:48:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:56,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:56,558 INFO L225 Difference]: With dead ends: 773 [2021-05-21 20:48:56,558 INFO L226 Difference]: Without dead ends: 744 [2021-05-21 20:48:56,558 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 124.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-05-21 20:48:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 494. [2021-05-21 20:48:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-05-21 20:48:56,566 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-05-21 20:48:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:56,566 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-05-21 20:48:56,566 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-05-21 20:48:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:56,567 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:56,567 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:56,567 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-21 20:48:56,568 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 498850876, now seen corresponding path program 4 times [2021-05-21 20:48:56,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:56,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213459766] [2021-05-21 20:48:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:56,639 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:56,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213459766] [2021-05-21 20:48:56,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213459766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:56,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:56,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:56,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024856228] [2021-05-21 20:48:56,640 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:56,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:56,640 INFO L87 Difference]: Start difference. First operand 494 states and 1652 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:56,751 INFO L93 Difference]: Finished difference Result 889 states and 2730 transitions. [2021-05-21 20:48:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:56,753 INFO L225 Difference]: With dead ends: 889 [2021-05-21 20:48:56,753 INFO L226 Difference]: Without dead ends: 862 [2021-05-21 20:48:56,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-05-21 20:48:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 494. [2021-05-21 20:48:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3509127789046653) internal successors, (1652), 493 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1652 transitions. [2021-05-21 20:48:56,765 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1652 transitions. Word has length 16 [2021-05-21 20:48:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:56,765 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1652 transitions. [2021-05-21 20:48:56,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1652 transitions. [2021-05-21 20:48:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:56,766 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:56,766 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:56,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-21 20:48:56,767 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash 637834109, now seen corresponding path program 4 times [2021-05-21 20:48:56,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:56,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166855789] [2021-05-21 20:48:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:56,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:56,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166855789] [2021-05-21 20:48:56,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166855789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:56,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:56,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:56,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890800460] [2021-05-21 20:48:56,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:56,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:56,886 INFO L87 Difference]: Start difference. First operand 494 states and 1652 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:57,078 INFO L93 Difference]: Finished difference Result 863 states and 2698 transitions. [2021-05-21 20:48:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:57,084 INFO L225 Difference]: With dead ends: 863 [2021-05-21 20:48:57,084 INFO L226 Difference]: Without dead ends: 830 [2021-05-21 20:48:57,084 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 187.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-05-21 20:48:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 494. [2021-05-21 20:48:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-05-21 20:48:57,095 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 16 [2021-05-21 20:48:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:57,095 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-05-21 20:48:57,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-05-21 20:48:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:57,096 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:57,096 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:57,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-21 20:48:57,096 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1681413370, now seen corresponding path program 5 times [2021-05-21 20:48:57,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:57,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134991563] [2021-05-21 20:48:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:57,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:57,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134991563] [2021-05-21 20:48:57,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134991563] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:57,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:57,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:57,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266532588] [2021-05-21 20:48:57,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:57,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:57,134 INFO L87 Difference]: Start difference. First operand 494 states and 1649 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:57,217 INFO L93 Difference]: Finished difference Result 731 states and 2291 transitions. [2021-05-21 20:48:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:57,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:57,219 INFO L225 Difference]: With dead ends: 731 [2021-05-21 20:48:57,219 INFO L226 Difference]: Without dead ends: 704 [2021-05-21 20:48:57,220 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-05-21 20:48:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 494. [2021-05-21 20:48:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-05-21 20:48:57,241 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 16 [2021-05-21 20:48:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:57,241 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-05-21 20:48:57,242 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-05-21 20:48:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:57,243 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:57,243 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:57,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-21 20:48:57,243 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1580392411, now seen corresponding path program 5 times [2021-05-21 20:48:57,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:57,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431038414] [2021-05-21 20:48:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:57,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:57,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431038414] [2021-05-21 20:48:57,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431038414] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:57,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:57,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:57,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320212109] [2021-05-21 20:48:57,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:57,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:57,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:57,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:57,373 INFO L87 Difference]: Start difference. First operand 494 states and 1649 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:57,617 INFO L93 Difference]: Finished difference Result 731 states and 2291 transitions. [2021-05-21 20:48:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:48:57,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:57,619 INFO L225 Difference]: With dead ends: 731 [2021-05-21 20:48:57,619 INFO L226 Difference]: Without dead ends: 704 [2021-05-21 20:48:57,619 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 252.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:48:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-05-21 20:48:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 494. [2021-05-21 20:48:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.3448275862068964) internal successors, (1649), 493 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1649 transitions. [2021-05-21 20:48:57,629 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1649 transitions. Word has length 16 [2021-05-21 20:48:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:57,630 INFO L482 AbstractCegarLoop]: Abstraction has 494 states and 1649 transitions. [2021-05-21 20:48:57,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1649 transitions. [2021-05-21 20:48:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:57,631 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:57,631 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:57,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-21 20:48:57,631 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 784334086, now seen corresponding path program 5 times [2021-05-21 20:48:57,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:57,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694966844] [2021-05-21 20:48:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:57,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:57,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694966844] [2021-05-21 20:48:57,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694966844] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:57,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:57,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:48:57,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140724616] [2021-05-21 20:48:57,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:48:57,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:48:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:48:57,694 INFO L87 Difference]: Start difference. First operand 494 states and 1649 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:57,860 INFO L93 Difference]: Finished difference Result 793 states and 2506 transitions. [2021-05-21 20:48:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:57,862 INFO L225 Difference]: With dead ends: 793 [2021-05-21 20:48:57,862 INFO L226 Difference]: Without dead ends: 770 [2021-05-21 20:48:57,863 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:48:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-05-21 20:48:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 490. [2021-05-21 20:48:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.347648261758691) internal successors, (1637), 489 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1637 transitions. [2021-05-21 20:48:57,882 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1637 transitions. Word has length 16 [2021-05-21 20:48:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:57,883 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1637 transitions. [2021-05-21 20:48:57,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1637 transitions. [2021-05-21 20:48:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:57,884 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:57,884 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:57,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-21 20:48:57,884 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash 797847013, now seen corresponding path program 5 times [2021-05-21 20:48:57,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:57,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113260022] [2021-05-21 20:48:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-21 20:48:58,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:58,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113260022] [2021-05-21 20:48:58,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113260022] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:48:58,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:48:58,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:48:58,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494201505] [2021-05-21 20:48:58,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:48:58,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:48:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:48:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:48:58,044 INFO L87 Difference]: Start difference. First operand 490 states and 1637 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:48:58,306 INFO L93 Difference]: Finished difference Result 803 states and 2527 transitions. [2021-05-21 20:48:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:48:58,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-05-21 20:48:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:48:58,307 INFO L225 Difference]: With dead ends: 803 [2021-05-21 20:48:58,307 INFO L226 Difference]: Without dead ends: 776 [2021-05-21 20:48:58,307 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 264.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:48:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2021-05-21 20:48:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 490. [2021-05-21 20:48:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.3435582822085887) internal successors, (1635), 489 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1635 transitions. [2021-05-21 20:48:58,317 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1635 transitions. Word has length 16 [2021-05-21 20:48:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:48:58,318 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1635 transitions. [2021-05-21 20:48:58,318 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:48:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1635 transitions. [2021-05-21 20:48:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-21 20:48:58,318 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:48:58,319 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:48:58,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-21 20:48:58,319 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:48:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:48:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1214532848, now seen corresponding path program 6 times [2021-05-21 20:48:58,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:48:58,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962115970] [2021-05-21 20:48:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:48:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:48:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:48:58,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:48:58,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962115970] [2021-05-21 20:48:58,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962115970] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:48:58,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426288150] [2021-05-21 20:48:58,483 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:48:58,528 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-05-21 20:48:58,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 20:48:58,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-21 20:48:58,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:48:58,609 WARN L348 FreeRefinementEngine]: Global settings require throwing the following exception [2021-05-21 20:48:58,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-05-21 20:48:58,827 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.EqualityInformation.getEqinfo(EqualityInformation.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.derSimple(XnfDer.java:308) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.tryToEliminate_EqInfoBased(XnfDer.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.tryToEliminate(XnfDer.java:101) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:100) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:63) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-05-21 20:48:58,830 INFO L168 Benchmark]: Toolchain (without parser) took 15657.58 ms. Allocated memory was 337.6 MB in the beginning and 589.3 MB in the end (delta: 251.7 MB). Free memory was 316.0 MB in the beginning and 488.8 MB in the end (delta: -172.8 MB). Peak memory consumption was 80.9 MB. Max. memory is 16.0 GB. [2021-05-21 20:48:58,830 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 337.6 MB. Free memory was 318.5 MB in the beginning and 318.4 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:48:58,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.74 ms. Allocated memory is still 337.6 MB. Free memory was 315.9 MB in the beginning and 314.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:48:58,830 INFO L168 Benchmark]: Boogie Preprocessor took 43.75 ms. Allocated memory is still 337.6 MB. Free memory was 314.2 MB in the beginning and 311.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-05-21 20:48:58,830 INFO L168 Benchmark]: RCFGBuilder took 968.94 ms. Allocated memory is still 337.6 MB. Free memory was 311.7 MB in the beginning and 265.8 MB in the end (delta: 45.8 MB). Peak memory consumption was 47.0 MB. Max. memory is 16.0 GB. [2021-05-21 20:48:58,830 INFO L168 Benchmark]: TraceAbstraction took 14590.87 ms. Allocated memory was 337.6 MB in the beginning and 589.3 MB in the end (delta: 251.7 MB). Free memory was 265.8 MB in the beginning and 488.8 MB in the end (delta: -223.0 MB). Peak memory consumption was 29.7 MB. Max. memory is 16.0 GB. [2021-05-21 20:48:58,831 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.15 ms. Allocated memory is still 337.6 MB. Free memory was 318.5 MB in the beginning and 318.4 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 36.74 ms. Allocated memory is still 337.6 MB. Free memory was 315.9 MB in the beginning and 314.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 43.75 ms. Allocated memory is still 337.6 MB. Free memory was 314.2 MB in the beginning and 311.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 968.94 ms. Allocated memory is still 337.6 MB. Free memory was 311.7 MB in the beginning and 265.8 MB in the end (delta: 45.8 MB). Peak memory consumption was 47.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14590.87 ms. Allocated memory was 337.6 MB in the beginning and 589.3 MB in the end (delta: 251.7 MB). Free memory was 265.8 MB in the beginning and 488.8 MB in the end (delta: -223.0 MB). Peak memory consumption was 29.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.EqualityInformation.getEqinfo(EqualityInformation.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...