/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/mcr/example_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 20:21:53,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 20:21:53,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 20:21:53,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 20:21:53,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 20:21:53,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 20:21:53,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 20:21:53,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 20:21:53,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 20:21:53,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 20:21:53,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 20:21:53,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 20:21:53,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 20:21:53,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 20:21:53,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 20:21:53,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 20:21:54,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 20:21:54,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 20:21:54,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 20:21:54,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 20:21:54,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 20:21:54,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 20:21:54,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 20:21:54,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 20:21:54,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 20:21:54,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 20:21:54,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 20:21:54,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 20:21:54,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 20:21:54,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 20:21:54,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 20:21:54,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 20:21:54,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 20:21:54,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 20:21:54,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 20:21:54,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 20:21:54,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 20:21:54,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 20:21:54,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 20:21:54,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 20:21:54,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 20:21:54,034 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:21:54,069 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 20:21:54,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 20:21:54,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 20:21:54,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 20:21:54,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 20:21:54,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 20:21:54,073 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 20:21:54,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 20:21:54,073 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 20:21:54,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 20:21:54,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 20:21:54,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 20:21:54,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 20:21:54,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 20:21:54,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 20:21:54,074 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 20:21:54,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 20:21:54,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 20:21:54,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 20:21:54,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 20:21:54,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 20:21:54,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 20:21:54,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 20:21:54,076 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 20:21:54,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 20:21:54,076 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:21:54,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 20:21:54,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 20:21:54,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 20:21:54,397 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 20:21:54,398 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 20:21:54,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl [2021-05-21 20:21:54,399 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl' [2021-05-21 20:21:54,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 20:21:54,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 20:21:54,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 20:21:54,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 20:21:54,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 20:21:54,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 20:21:54,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 20:21:54,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 20:21:54,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 20:21:54,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/1) ... [2021-05-21 20:21:54,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 20:21:54,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 20:21:54,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 20:21:54,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 20:21:54,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (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:21:54,780 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2021-05-21 20:21:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2021-05-21 20:21:54,781 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2021-05-21 20:21:54,781 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2021-05-21 20:21:54,781 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2021-05-21 20:21:54,781 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2021-05-21 20:21:54,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2021-05-21 20:21:54,782 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2021-05-21 20:21:54,782 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2021-05-21 20:21:54,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2021-05-21 20:21:54,782 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2021-05-21 20:21:54,783 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2021-05-21 20:21:54,783 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2021-05-21 20:21:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2021-05-21 20:21:54,784 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2021-05-21 20:21:54,784 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 20:21:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 20:21:54,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 20:21:54,785 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:21:54,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 20:21:54,945 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-21 20:21:54,946 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:21:54 BoogieIcfgContainer [2021-05-21 20:21:54,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 20:21:54,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 20:21:54,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 20:21:54,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 20:21:54,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:54" (1/2) ... [2021-05-21 20:21:54,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfaed57 and model type example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 08:21:54, skipping insertion in model container [2021-05-21 20:21:54,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:21:54" (2/2) ... [2021-05-21 20:21:54,953 INFO L111 eAbstractionObserver]: Analyzing ICFG example_5.bpl [2021-05-21 20:21:54,958 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 20:21:54,958 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 20:21:54,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 20:21:54,959 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 20:21:55,077 INFO L149 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2021-05-21 20:21:55,092 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-05-21 20:21:55,126 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 20:21:55,126 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 20:21:55,126 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 20:21:55,127 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 20:21:55,127 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 20:21:55,127 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 20:21:55,127 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 20:21:55,127 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 20:21:55,136 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 48 transitions, 196 flow [2021-05-21 20:21:55,234 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1148 states, 1146 states have (on average 3.7068062827225132) internal successors, (4248), 1147 states have internal predecessors, (4248), 0 states have call successors, (0), 0 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:21:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 1148 states, 1146 states have (on average 3.7068062827225132) internal successors, (4248), 1147 states have internal predecessors, (4248), 0 states have call successors, (0), 0 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:21:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:55,266 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:55,267 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:55,267 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 921696598, now seen corresponding path program 1 times [2021-05-21 20:21:55,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:55,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784128762] [2021-05-21 20:21:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:55,415 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:21:55,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:55,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784128762] [2021-05-21 20:21:55,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784128762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:55,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:55,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:21:55,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148600996] [2021-05-21 20:21:55,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:21:55,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:21:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:55,437 INFO L87 Difference]: Start difference. First operand has 1148 states, 1146 states have (on average 3.7068062827225132) internal successors, (4248), 1147 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:55,479 INFO L93 Difference]: Finished difference Result 959 states and 3411 transitions. [2021-05-21 20:21:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:21:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:55,507 INFO L225 Difference]: With dead ends: 959 [2021-05-21 20:21:55,507 INFO L226 Difference]: Without dead ends: 957 [2021-05-21 20:21:55,508 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-05-21 20:21:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2021-05-21 20:21:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 3.5658995815899583) internal successors, (3409), 956 states have internal predecessors, (3409), 0 states have call successors, (0), 0 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:21:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 3409 transitions. [2021-05-21 20:21:55,644 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 3409 transitions. Word has length 21 [2021-05-21 20:21:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:55,646 INFO L482 AbstractCegarLoop]: Abstraction has 957 states and 3409 transitions. [2021-05-21 20:21:55,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 3409 transitions. [2021-05-21 20:21:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:55,652 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:55,652 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:55,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 20:21:55,653 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash 79574102, now seen corresponding path program 1 times [2021-05-21 20:21:55,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:55,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7342589] [2021-05-21 20:21:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:55,700 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:21:55,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:55,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7342589] [2021-05-21 20:21:55,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7342589] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:55,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:55,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:21:55,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224600078] [2021-05-21 20:21:55,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:21:55,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:21:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:55,704 INFO L87 Difference]: Start difference. First operand 957 states and 3409 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:55,730 INFO L93 Difference]: Finished difference Result 741 states and 2572 transitions. [2021-05-21 20:21:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:21:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:55,739 INFO L225 Difference]: With dead ends: 741 [2021-05-21 20:21:55,739 INFO L226 Difference]: Without dead ends: 741 [2021-05-21 20:21:55,740 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-05-21 20:21:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2021-05-21 20:21:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 3.4756756756756757) internal successors, (2572), 740 states have internal predecessors, (2572), 0 states have call successors, (0), 0 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:21:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2572 transitions. [2021-05-21 20:21:55,770 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2572 transitions. Word has length 21 [2021-05-21 20:21:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:55,770 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 2572 transitions. [2021-05-21 20:21:55,771 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2572 transitions. [2021-05-21 20:21:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:55,773 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:55,773 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:55,774 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 20:21:55,774 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1823307896, now seen corresponding path program 1 times [2021-05-21 20:21:55,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:55,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072459815] [2021-05-21 20:21:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:55,826 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:21:55,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:55,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072459815] [2021-05-21 20:21:55,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072459815] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:55,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:55,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:21:55,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220167024] [2021-05-21 20:21:55,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:21:55,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:21:55,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:55,829 INFO L87 Difference]: Start difference. First operand 741 states and 2572 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:55,841 INFO L93 Difference]: Finished difference Result 567 states and 1945 transitions. [2021-05-21 20:21:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:21:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:55,845 INFO L225 Difference]: With dead ends: 567 [2021-05-21 20:21:55,845 INFO L226 Difference]: Without dead ends: 567 [2021-05-21 20:21:55,846 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-05-21 20:21:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2021-05-21 20:21:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.4363957597173145) internal successors, (1945), 566 states have internal predecessors, (1945), 0 states have call successors, (0), 0 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:21:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1945 transitions. [2021-05-21 20:21:55,867 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1945 transitions. Word has length 21 [2021-05-21 20:21:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:55,868 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1945 transitions. [2021-05-21 20:21:55,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1945 transitions. [2021-05-21 20:21:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:55,870 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:55,870 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:55,870 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 20:21:55,870 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:55,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1824113276, now seen corresponding path program 1 times [2021-05-21 20:21:55,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:55,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328826099] [2021-05-21 20:21:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:56,026 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:21:56,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:56,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328826099] [2021-05-21 20:21:56,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328826099] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:56,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:56,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:56,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40575724] [2021-05-21 20:21:56,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:56,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:56,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:56,029 INFO L87 Difference]: Start difference. First operand 567 states and 1945 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:56,090 INFO L93 Difference]: Finished difference Result 1267 states and 4072 transitions. [2021-05-21 20:21:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:56,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:56,097 INFO L225 Difference]: With dead ends: 1267 [2021-05-21 20:21:56,097 INFO L226 Difference]: Without dead ends: 1133 [2021-05-21 20:21:56,098 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-05-21 20:21:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 616. [2021-05-21 20:21:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 3.4) internal successors, (2091), 615 states have internal predecessors, (2091), 0 states have call successors, (0), 0 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:21:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 2091 transitions. [2021-05-21 20:21:56,127 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 2091 transitions. Word has length 21 [2021-05-21 20:21:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:56,127 INFO L482 AbstractCegarLoop]: Abstraction has 616 states and 2091 transitions. [2021-05-21 20:21:56,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 2091 transitions. [2021-05-21 20:21:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:56,130 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:56,130 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:56,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 20:21:56,130 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1418935620, now seen corresponding path program 2 times [2021-05-21 20:21:56,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:56,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615845350] [2021-05-21 20:21:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:56,248 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:21:56,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:56,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615845350] [2021-05-21 20:21:56,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615845350] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:56,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:56,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:56,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940857101] [2021-05-21 20:21:56,250 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:56,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:56,251 INFO L87 Difference]: Start difference. First operand 616 states and 2091 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:56,328 INFO L93 Difference]: Finished difference Result 1250 states and 3995 transitions. [2021-05-21 20:21:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:56,335 INFO L225 Difference]: With dead ends: 1250 [2021-05-21 20:21:56,336 INFO L226 Difference]: Without dead ends: 1098 [2021-05-21 20:21:56,336 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 101.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-05-21 20:21:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 581. [2021-05-21 20:21:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 3.420689655172414) internal successors, (1984), 580 states have internal predecessors, (1984), 0 states have call successors, (0), 0 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:21:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1984 transitions. [2021-05-21 20:21:56,362 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1984 transitions. Word has length 21 [2021-05-21 20:21:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:56,363 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1984 transitions. [2021-05-21 20:21:56,363 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1984 transitions. [2021-05-21 20:21:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:56,365 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:56,365 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:56,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 20:21:56,366 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 213760410, now seen corresponding path program 3 times [2021-05-21 20:21:56,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:56,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414061247] [2021-05-21 20:21:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:56,550 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:21:56,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:56,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414061247] [2021-05-21 20:21:56,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414061247] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:56,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:56,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:56,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589843492] [2021-05-21 20:21:56,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:56,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:56,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:56,553 INFO L87 Difference]: Start difference. First operand 581 states and 1984 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:56,628 INFO L93 Difference]: Finished difference Result 1207 states and 3862 transitions. [2021-05-21 20:21:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:56,634 INFO L225 Difference]: With dead ends: 1207 [2021-05-21 20:21:56,635 INFO L226 Difference]: Without dead ends: 1104 [2021-05-21 20:21:56,636 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 111.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2021-05-21 20:21:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 601. [2021-05-21 20:21:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 3.4066666666666667) internal successors, (2044), 600 states have internal predecessors, (2044), 0 states have call successors, (0), 0 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:21:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2044 transitions. [2021-05-21 20:21:56,663 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2044 transitions. Word has length 21 [2021-05-21 20:21:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:56,664 INFO L482 AbstractCegarLoop]: Abstraction has 601 states and 2044 transitions. [2021-05-21 20:21:56,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2044 transitions. [2021-05-21 20:21:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:56,666 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:56,666 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:56,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 20:21:56,666 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1651666564, now seen corresponding path program 4 times [2021-05-21 20:21:56,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:56,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234824016] [2021-05-21 20:21:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:56,785 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:21:56,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:56,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234824016] [2021-05-21 20:21:56,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234824016] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:56,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:56,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:56,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176961197] [2021-05-21 20:21:56,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:56,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:56,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:56,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:56,788 INFO L87 Difference]: Start difference. First operand 601 states and 2044 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:56,837 INFO L93 Difference]: Finished difference Result 1238 states and 3949 transitions. [2021-05-21 20:21:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:56,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:56,843 INFO L225 Difference]: With dead ends: 1238 [2021-05-21 20:21:56,843 INFO L226 Difference]: Without dead ends: 1084 [2021-05-21 20:21:56,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-05-21 20:21:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 581. [2021-05-21 20:21:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 3.4034482758620688) internal successors, (1974), 580 states have internal predecessors, (1974), 0 states have call successors, (0), 0 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:21:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1974 transitions. [2021-05-21 20:21:56,871 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1974 transitions. Word has length 21 [2021-05-21 20:21:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:56,873 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1974 transitions. [2021-05-21 20:21:56,873 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1974 transitions. [2021-05-21 20:21:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:56,875 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:56,875 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:56,875 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 20:21:56,875 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1790028250, now seen corresponding path program 5 times [2021-05-21 20:21:56,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:56,876 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090956876] [2021-05-21 20:21:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:56,980 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:21:56,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:56,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090956876] [2021-05-21 20:21:56,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090956876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:56,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:56,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:56,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287587632] [2021-05-21 20:21:56,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:56,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:56,982 INFO L87 Difference]: Start difference. First operand 581 states and 1974 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:57,037 INFO L93 Difference]: Finished difference Result 1182 states and 3774 transitions. [2021-05-21 20:21:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:57,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:57,044 INFO L225 Difference]: With dead ends: 1182 [2021-05-21 20:21:57,044 INFO L226 Difference]: Without dead ends: 1079 [2021-05-21 20:21:57,044 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-05-21 20:21:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 593. [2021-05-21 20:21:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.3885135135135136) internal successors, (2006), 592 states have internal predecessors, (2006), 0 states have call successors, (0), 0 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:21:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2006 transitions. [2021-05-21 20:21:57,067 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2006 transitions. Word has length 21 [2021-05-21 20:21:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:57,067 INFO L482 AbstractCegarLoop]: Abstraction has 593 states and 2006 transitions. [2021-05-21 20:21:57,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2006 transitions. [2021-05-21 20:21:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:57,069 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:57,069 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:57,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 20:21:57,070 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash 856912858, now seen corresponding path program 6 times [2021-05-21 20:21:57,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:57,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229202534] [2021-05-21 20:21:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:57,164 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:21:57,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:57,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229202534] [2021-05-21 20:21:57,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229202534] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:57,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:57,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:57,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079508310] [2021-05-21 20:21:57,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:57,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:57,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:57,167 INFO L87 Difference]: Start difference. First operand 593 states and 2006 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:57,228 INFO L93 Difference]: Finished difference Result 1196 states and 3811 transitions. [2021-05-21 20:21:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:57,234 INFO L225 Difference]: With dead ends: 1196 [2021-05-21 20:21:57,234 INFO L226 Difference]: Without dead ends: 1053 [2021-05-21 20:21:57,234 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-05-21 20:21:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 567. [2021-05-21 20:21:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.4240282685512367) internal successors, (1938), 566 states have internal predecessors, (1938), 0 states have call successors, (0), 0 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:21:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1938 transitions. [2021-05-21 20:21:57,255 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1938 transitions. Word has length 21 [2021-05-21 20:21:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:57,256 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1938 transitions. [2021-05-21 20:21:57,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1938 transitions. [2021-05-21 20:21:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:57,258 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:57,258 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:57,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 20:21:57,258 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash -179046054, now seen corresponding path program 7 times [2021-05-21 20:21:57,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:57,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207603179] [2021-05-21 20:21:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:21:57,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:57,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207603179] [2021-05-21 20:21:57,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207603179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:57,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:57,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:57,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067937124] [2021-05-21 20:21:57,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:57,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:57,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:57,377 INFO L87 Difference]: Start difference. First operand 567 states and 1938 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:57,429 INFO L93 Difference]: Finished difference Result 1298 states and 4181 transitions. [2021-05-21 20:21:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:57,435 INFO L225 Difference]: With dead ends: 1298 [2021-05-21 20:21:57,435 INFO L226 Difference]: Without dead ends: 1164 [2021-05-21 20:21:57,436 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 104.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-05-21 20:21:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 623. [2021-05-21 20:21:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 3.3858520900321545) internal successors, (2106), 622 states have internal predecessors, (2106), 0 states have call successors, (0), 0 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:21:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 2106 transitions. [2021-05-21 20:21:57,459 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 2106 transitions. Word has length 21 [2021-05-21 20:21:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:57,460 INFO L482 AbstractCegarLoop]: Abstraction has 623 states and 2106 transitions. [2021-05-21 20:21:57,460 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 2106 transitions. [2021-05-21 20:21:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:57,461 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:57,462 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:57,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 20:21:57,462 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash 872872346, now seen corresponding path program 8 times [2021-05-21 20:21:57,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:57,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406073375] [2021-05-21 20:21:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:57,544 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:21:57,544 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:57,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406073375] [2021-05-21 20:21:57,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406073375] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:57,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:57,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:57,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850309362] [2021-05-21 20:21:57,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:57,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:57,546 INFO L87 Difference]: Start difference. First operand 623 states and 2106 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:57,609 INFO L93 Difference]: Finished difference Result 1281 states and 4104 transitions. [2021-05-21 20:21:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:57,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:57,615 INFO L225 Difference]: With dead ends: 1281 [2021-05-21 20:21:57,615 INFO L226 Difference]: Without dead ends: 1129 [2021-05-21 20:21:57,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 91.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-05-21 20:21:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 588. [2021-05-21 20:21:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 3.4003407155025553) internal successors, (1996), 587 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1996 transitions. [2021-05-21 20:21:57,638 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1996 transitions. Word has length 21 [2021-05-21 20:21:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:57,638 INFO L482 AbstractCegarLoop]: Abstraction has 588 states and 1996 transitions. [2021-05-21 20:21:57,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1996 transitions. [2021-05-21 20:21:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:57,640 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:57,640 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:57,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 20:21:57,640 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2136036634, now seen corresponding path program 9 times [2021-05-21 20:21:57,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:57,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180921970] [2021-05-21 20:21:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:57,721 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:21:57,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:57,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180921970] [2021-05-21 20:21:57,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180921970] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:57,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:57,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:57,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157291327] [2021-05-21 20:21:57,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:57,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:57,723 INFO L87 Difference]: Start difference. First operand 588 states and 1996 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:57,768 INFO L93 Difference]: Finished difference Result 1287 states and 4136 transitions. [2021-05-21 20:21:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:57,774 INFO L225 Difference]: With dead ends: 1287 [2021-05-21 20:21:57,775 INFO L226 Difference]: Without dead ends: 1153 [2021-05-21 20:21:57,775 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-05-21 20:21:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 614. [2021-05-21 20:21:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 3.3719412724306688) internal successors, (2067), 613 states have internal predecessors, (2067), 0 states have call successors, (0), 0 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:21:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2067 transitions. [2021-05-21 20:21:57,797 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2067 transitions. Word has length 21 [2021-05-21 20:21:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:57,798 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 2067 transitions. [2021-05-21 20:21:57,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2067 transitions. [2021-05-21 20:21:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:57,800 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:57,800 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:57,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 20:21:57,800 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 929894012, now seen corresponding path program 10 times [2021-05-21 20:21:57,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:57,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099886912] [2021-05-21 20:21:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:57,900 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:21:57,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:57,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099886912] [2021-05-21 20:21:57,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099886912] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:57,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:57,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:57,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831847759] [2021-05-21 20:21:57,902 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:57,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:57,903 INFO L87 Difference]: Start difference. First operand 614 states and 2067 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:57,964 INFO L93 Difference]: Finished difference Result 1268 states and 4055 transitions. [2021-05-21 20:21:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:57,971 INFO L225 Difference]: With dead ends: 1268 [2021-05-21 20:21:57,971 INFO L226 Difference]: Without dead ends: 1127 [2021-05-21 20:21:57,971 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 104.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-05-21 20:21:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 588. [2021-05-21 20:21:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 3.3781942078364566) internal successors, (1983), 587 states have internal predecessors, (1983), 0 states have call successors, (0), 0 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:21:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1983 transitions. [2021-05-21 20:21:57,996 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1983 transitions. Word has length 21 [2021-05-21 20:21:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:57,996 INFO L482 AbstractCegarLoop]: Abstraction has 588 states and 1983 transitions. [2021-05-21 20:21:57,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1983 transitions. [2021-05-21 20:21:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:57,997 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:57,998 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:57,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 20:21:57,998 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1110176068, now seen corresponding path program 11 times [2021-05-21 20:21:57,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:57,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907276913] [2021-05-21 20:21:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:58,093 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:21:58,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:58,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907276913] [2021-05-21 20:21:58,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907276913] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:58,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:58,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:58,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149203472] [2021-05-21 20:21:58,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:58,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:58,095 INFO L87 Difference]: Start difference. First operand 588 states and 1983 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:58,164 INFO L93 Difference]: Finished difference Result 1245 states and 3995 transitions. [2021-05-21 20:21:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:58,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:58,181 INFO L225 Difference]: With dead ends: 1245 [2021-05-21 20:21:58,181 INFO L226 Difference]: Without dead ends: 1128 [2021-05-21 20:21:58,182 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 91.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2021-05-21 20:21:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 606. [2021-05-21 20:21:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 3.3619834710743803) internal successors, (2034), 605 states have internal predecessors, (2034), 0 states have call successors, (0), 0 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:21:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 2034 transitions. [2021-05-21 20:21:58,220 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 2034 transitions. Word has length 21 [2021-05-21 20:21:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:58,220 INFO L482 AbstractCegarLoop]: Abstraction has 606 states and 2034 transitions. [2021-05-21 20:21:58,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 2034 transitions. [2021-05-21 20:21:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:58,222 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:58,222 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:58,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 20:21:58,223 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:58,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1438558950, now seen corresponding path program 12 times [2021-05-21 20:21:58,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:58,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147080683] [2021-05-21 20:21:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:58,331 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:21:58,332 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:58,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147080683] [2021-05-21 20:21:58,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147080683] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:58,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:58,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:58,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464162904] [2021-05-21 20:21:58,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:58,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:58,333 INFO L87 Difference]: Start difference. First operand 606 states and 2034 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:58,400 INFO L93 Difference]: Finished difference Result 1243 states and 3972 transitions. [2021-05-21 20:21:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:58,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:58,404 INFO L225 Difference]: With dead ends: 1243 [2021-05-21 20:21:58,404 INFO L226 Difference]: Without dead ends: 1089 [2021-05-21 20:21:58,405 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 104.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-05-21 20:21:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 567. [2021-05-21 20:21:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.408127208480565) internal successors, (1929), 566 states have internal predecessors, (1929), 0 states have call successors, (0), 0 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:21:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1929 transitions. [2021-05-21 20:21:58,428 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1929 transitions. Word has length 21 [2021-05-21 20:21:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:58,428 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1929 transitions. [2021-05-21 20:21:58,429 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1929 transitions. [2021-05-21 20:21:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:58,430 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:58,430 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:58,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 20:21:58,431 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1957163848, now seen corresponding path program 13 times [2021-05-21 20:21:58,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:58,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081913238] [2021-05-21 20:21:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:58,531 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:21:58,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:58,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081913238] [2021-05-21 20:21:58,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081913238] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:58,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:58,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:58,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124038215] [2021-05-21 20:21:58,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:58,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:58,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:58,533 INFO L87 Difference]: Start difference. First operand 567 states and 1929 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:58,593 INFO L93 Difference]: Finished difference Result 1192 states and 3820 transitions. [2021-05-21 20:21:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:58,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:58,597 INFO L225 Difference]: With dead ends: 1192 [2021-05-21 20:21:58,597 INFO L226 Difference]: Without dead ends: 1089 [2021-05-21 20:21:58,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 98.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-05-21 20:21:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 597. [2021-05-21 20:21:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.4060402684563758) internal successors, (2030), 596 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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:21:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 2030 transitions. [2021-05-21 20:21:58,621 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 2030 transitions. Word has length 21 [2021-05-21 20:21:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:58,621 INFO L482 AbstractCegarLoop]: Abstraction has 597 states and 2030 transitions. [2021-05-21 20:21:58,621 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 2030 transitions. [2021-05-21 20:21:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:58,623 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:58,623 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:58,623 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 20:21:58,623 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 472376474, now seen corresponding path program 14 times [2021-05-21 20:21:58,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:58,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174474869] [2021-05-21 20:21:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:58,715 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:21:58,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:58,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174474869] [2021-05-21 20:21:58,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174474869] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:58,716 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:58,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:58,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474927253] [2021-05-21 20:21:58,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:58,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:58,717 INFO L87 Difference]: Start difference. First operand 597 states and 2030 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:58,760 INFO L93 Difference]: Finished difference Result 1223 states and 3907 transitions. [2021-05-21 20:21:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:58,764 INFO L225 Difference]: With dead ends: 1223 [2021-05-21 20:21:58,764 INFO L226 Difference]: Without dead ends: 1069 [2021-05-21 20:21:58,764 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-05-21 20:21:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 577. [2021-05-21 20:21:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 3.4027777777777777) internal successors, (1960), 576 states have internal predecessors, (1960), 0 states have call successors, (0), 0 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:21:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1960 transitions. [2021-05-21 20:21:58,784 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1960 transitions. Word has length 21 [2021-05-21 20:21:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:58,784 INFO L482 AbstractCegarLoop]: Abstraction has 577 states and 1960 transitions. [2021-05-21 20:21:58,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1960 transitions. [2021-05-21 20:21:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:58,786 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:58,786 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:58,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 20:21:58,786 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1419053670, now seen corresponding path program 15 times [2021-05-21 20:21:58,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:58,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504172949] [2021-05-21 20:21:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:58,864 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:21:58,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:58,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504172949] [2021-05-21 20:21:58,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504172949] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:58,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:58,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:58,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66712437] [2021-05-21 20:21:58,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:58,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:58,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:58,868 INFO L87 Difference]: Start difference. First operand 577 states and 1960 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:58,921 INFO L93 Difference]: Finished difference Result 1165 states and 3727 transitions. [2021-05-21 20:21:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:58,924 INFO L225 Difference]: With dead ends: 1165 [2021-05-21 20:21:58,924 INFO L226 Difference]: Without dead ends: 1062 [2021-05-21 20:21:58,925 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-05-21 20:21:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 589. [2021-05-21 20:21:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 3.3877551020408165) internal successors, (1992), 588 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:21:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1992 transitions. [2021-05-21 20:21:58,945 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1992 transitions. Word has length 21 [2021-05-21 20:21:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:58,945 INFO L482 AbstractCegarLoop]: Abstraction has 589 states and 1992 transitions. [2021-05-21 20:21:58,945 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1992 transitions. [2021-05-21 20:21:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:58,947 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:58,947 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:58,947 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 20:21:58,947 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1264168858, now seen corresponding path program 16 times [2021-05-21 20:21:58,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:58,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348206461] [2021-05-21 20:21:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,016 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:21:59,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348206461] [2021-05-21 20:21:59,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348206461] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733213292] [2021-05-21 20:21:59,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,018 INFO L87 Difference]: Start difference. First operand 589 states and 1992 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:59,069 INFO L93 Difference]: Finished difference Result 1177 states and 3759 transitions. [2021-05-21 20:21:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:59,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:59,072 INFO L225 Difference]: With dead ends: 1177 [2021-05-21 20:21:59,072 INFO L226 Difference]: Without dead ends: 1050 [2021-05-21 20:21:59,072 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-05-21 20:21:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 577. [2021-05-21 20:21:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 3.392361111111111) internal successors, (1954), 576 states have internal predecessors, (1954), 0 states have call successors, (0), 0 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:21:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1954 transitions. [2021-05-21 20:21:59,090 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1954 transitions. Word has length 21 [2021-05-21 20:21:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:59,090 INFO L482 AbstractCegarLoop]: Abstraction has 577 states and 1954 transitions. [2021-05-21 20:21:59,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1954 transitions. [2021-05-21 20:21:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:59,092 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:59,092 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:59,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 20:21:59,092 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash 947468028, now seen corresponding path program 17 times [2021-05-21 20:21:59,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:59,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964775776] [2021-05-21 20:21:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,180 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:21:59,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964775776] [2021-05-21 20:21:59,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964775776] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982236270] [2021-05-21 20:21:59,181 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,183 INFO L87 Difference]: Start difference. First operand 577 states and 1954 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:59,223 INFO L93 Difference]: Finished difference Result 1241 states and 3972 transitions. [2021-05-21 20:21:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:59,225 INFO L225 Difference]: With dead ends: 1241 [2021-05-21 20:21:59,226 INFO L226 Difference]: Without dead ends: 1107 [2021-05-21 20:21:59,226 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-05-21 20:21:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 603. [2021-05-21 20:21:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 3.3637873754152823) internal successors, (2025), 602 states have internal predecessors, (2025), 0 states have call successors, (0), 0 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:21:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 2025 transitions. [2021-05-21 20:21:59,243 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 2025 transitions. Word has length 21 [2021-05-21 20:21:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:59,243 INFO L482 AbstractCegarLoop]: Abstraction has 603 states and 2025 transitions. [2021-05-21 20:21:59,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 2025 transitions. [2021-05-21 20:21:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:59,245 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:59,245 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:59,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 20:21:59,245 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:59,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1035404762, now seen corresponding path program 18 times [2021-05-21 20:21:59,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:59,246 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819002486] [2021-05-21 20:21:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,316 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:21:59,316 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819002486] [2021-05-21 20:21:59,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819002486] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709773313] [2021-05-21 20:21:59,317 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,317 INFO L87 Difference]: Start difference. First operand 603 states and 2025 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:59,370 INFO L93 Difference]: Finished difference Result 1222 states and 3891 transitions. [2021-05-21 20:21:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:59,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:59,373 INFO L225 Difference]: With dead ends: 1222 [2021-05-21 20:21:59,373 INFO L226 Difference]: Without dead ends: 1071 [2021-05-21 20:21:59,374 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-05-21 20:21:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 567. [2021-05-21 20:21:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.3992932862190814) internal successors, (1924), 566 states have internal predecessors, (1924), 0 states have call successors, (0), 0 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:21:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1924 transitions. [2021-05-21 20:21:59,392 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1924 transitions. Word has length 21 [2021-05-21 20:21:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:59,392 INFO L482 AbstractCegarLoop]: Abstraction has 567 states and 1924 transitions. [2021-05-21 20:21:59,392 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1924 transitions. [2021-05-21 20:21:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:59,394 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:59,394 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:59,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 20:21:59,394 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 873653722, now seen corresponding path program 19 times [2021-05-21 20:21:59,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:59,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583707573] [2021-05-21 20:21:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,465 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:21:59,466 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583707573] [2021-05-21 20:21:59,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583707573] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206900831] [2021-05-21 20:21:59,466 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,467 INFO L87 Difference]: Start difference. First operand 567 states and 1924 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:59,522 INFO L93 Difference]: Finished difference Result 1130 states and 3615 transitions. [2021-05-21 20:21:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:59,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:59,525 INFO L225 Difference]: With dead ends: 1130 [2021-05-21 20:21:59,526 INFO L226 Difference]: Without dead ends: 1027 [2021-05-21 20:21:59,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-05-21 20:21:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 585. [2021-05-21 20:21:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 3.392123287671233) internal successors, (1981), 584 states have internal predecessors, (1981), 0 states have call successors, (0), 0 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:21:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1981 transitions. [2021-05-21 20:21:59,544 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1981 transitions. Word has length 21 [2021-05-21 20:21:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:59,544 INFO L482 AbstractCegarLoop]: Abstraction has 585 states and 1981 transitions. [2021-05-21 20:21:59,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1981 transitions. [2021-05-21 20:21:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:59,545 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:59,545 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:59,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-21 20:21:59,545 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash -59461670, now seen corresponding path program 20 times [2021-05-21 20:21:59,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:59,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102364201] [2021-05-21 20:21:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,617 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:21:59,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102364201] [2021-05-21 20:21:59,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102364201] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852626864] [2021-05-21 20:21:59,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,618 INFO L87 Difference]: Start difference. First operand 585 states and 1981 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:59,676 INFO L93 Difference]: Finished difference Result 1144 states and 3652 transitions. [2021-05-21 20:21:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:59,679 INFO L225 Difference]: With dead ends: 1144 [2021-05-21 20:21:59,679 INFO L226 Difference]: Without dead ends: 1015 [2021-05-21 20:21:59,680 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-05-21 20:21:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 573. [2021-05-21 20:21:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 3.3968531468531467) internal successors, (1943), 572 states have internal predecessors, (1943), 0 states have call successors, (0), 0 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:21:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1943 transitions. [2021-05-21 20:21:59,697 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1943 transitions. Word has length 21 [2021-05-21 20:21:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:59,697 INFO L482 AbstractCegarLoop]: Abstraction has 573 states and 1943 transitions. [2021-05-21 20:21:59,697 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1943 transitions. [2021-05-21 20:21:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:59,699 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:59,699 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:59,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-21 20:21:59,699 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1169683272, now seen corresponding path program 21 times [2021-05-21 20:21:59,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:59,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359598588] [2021-05-21 20:21:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,798 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:21:59,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359598588] [2021-05-21 20:21:59,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359598588] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105578752] [2021-05-21 20:21:59,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,800 INFO L87 Difference]: Start difference. First operand 573 states and 1943 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:59,857 INFO L93 Difference]: Finished difference Result 1128 states and 3604 transitions. [2021-05-21 20:21:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:21:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:21:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:59,861 INFO L225 Difference]: With dead ends: 1128 [2021-05-21 20:21:59,861 INFO L226 Difference]: Without dead ends: 1025 [2021-05-21 20:21:59,861 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:21:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-05-21 20:21:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 585. [2021-05-21 20:21:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 3.381849315068493) internal successors, (1975), 584 states have internal predecessors, (1975), 0 states have call successors, (0), 0 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:21:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1975 transitions. [2021-05-21 20:21:59,879 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1975 transitions. Word has length 21 [2021-05-21 20:21:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:59,879 INFO L482 AbstractCegarLoop]: Abstraction has 585 states and 1975 transitions. [2021-05-21 20:21:59,879 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:21:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1975 transitions. [2021-05-21 20:21:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:21:59,881 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:59,881 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:59,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-21 20:21:59,881 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:21:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:59,881 INFO L82 PathProgramCache]: Analyzing trace with hash -65892390, now seen corresponding path program 22 times [2021-05-21 20:21:59,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:59,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128508136] [2021-05-21 20:21:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:59,955 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:21:59,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:59,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128508136] [2021-05-21 20:21:59,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128508136] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:59,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:59,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:21:59,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009010845] [2021-05-21 20:21:59,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:21:59,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:59,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:21:59,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:59,956 INFO L87 Difference]: Start difference. First operand 585 states and 1975 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,012 INFO L93 Difference]: Finished difference Result 1140 states and 3636 transitions. [2021-05-21 20:22:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,015 INFO L225 Difference]: With dead ends: 1140 [2021-05-21 20:22:00,015 INFO L226 Difference]: Without dead ends: 1013 [2021-05-21 20:22:00,015 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-05-21 20:22:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 573. [2021-05-21 20:22:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 3.3863636363636362) internal successors, (1937), 572 states have internal predecessors, (1937), 0 states have call successors, (0), 0 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:22:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1937 transitions. [2021-05-21 20:22:00,033 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1937 transitions. Word has length 21 [2021-05-21 20:22:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,033 INFO L482 AbstractCegarLoop]: Abstraction has 573 states and 1937 transitions. [2021-05-21 20:22:00,033 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1937 transitions. [2021-05-21 20:22:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,035 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,035 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-21 20:22:00,035 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1537010138, now seen corresponding path program 23 times [2021-05-21 20:22:00,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500055192] [2021-05-21 20:22:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:00,106 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:22:00,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:00,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500055192] [2021-05-21 20:22:00,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500055192] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:00,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:00,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:00,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431719605] [2021-05-21 20:22:00,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:00,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:00,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:00,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:00,108 INFO L87 Difference]: Start difference. First operand 573 states and 1937 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,174 INFO L93 Difference]: Finished difference Result 1162 states and 3721 transitions. [2021-05-21 20:22:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,177 INFO L225 Difference]: With dead ends: 1162 [2021-05-21 20:22:00,177 INFO L226 Difference]: Without dead ends: 1045 [2021-05-21 20:22:00,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 93.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-05-21 20:22:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 591. [2021-05-21 20:22:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.369491525423729) internal successors, (1988), 590 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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:22:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1988 transitions. [2021-05-21 20:22:00,196 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1988 transitions. Word has length 21 [2021-05-21 20:22:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,196 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1988 transitions. [2021-05-21 20:22:00,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1988 transitions. [2021-05-21 20:22:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,198 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,198 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-21 20:22:00,198 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1208627256, now seen corresponding path program 24 times [2021-05-21 20:22:00,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719112295] [2021-05-21 20:22:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:00,267 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:22:00,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:00,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719112295] [2021-05-21 20:22:00,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719112295] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:00,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:00,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:00,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66881520] [2021-05-21 20:22:00,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:00,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:00,269 INFO L87 Difference]: Start difference. First operand 591 states and 1988 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,325 INFO L93 Difference]: Finished difference Result 1160 states and 3698 transitions. [2021-05-21 20:22:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,328 INFO L225 Difference]: With dead ends: 1160 [2021-05-21 20:22:00,329 INFO L226 Difference]: Without dead ends: 1010 [2021-05-21 20:22:00,329 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-05-21 20:22:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 556. [2021-05-21 20:22:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.427027027027027) internal successors, (1902), 555 states have internal predecessors, (1902), 0 states have call successors, (0), 0 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:22:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1902 transitions. [2021-05-21 20:22:00,346 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1902 transitions. Word has length 21 [2021-05-21 20:22:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,346 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1902 transitions. [2021-05-21 20:22:00,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1902 transitions. [2021-05-21 20:22:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,347 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,347 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-21 20:22:00,347 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,348 INFO L82 PathProgramCache]: Analyzing trace with hash -281686468, now seen corresponding path program 25 times [2021-05-21 20:22:00,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056142926] [2021-05-21 20:22:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:00,418 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:22:00,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:00,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056142926] [2021-05-21 20:22:00,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056142926] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:00,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:00,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:00,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627529195] [2021-05-21 20:22:00,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:00,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:00,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:00,419 INFO L87 Difference]: Start difference. First operand 556 states and 1902 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,465 INFO L93 Difference]: Finished difference Result 1242 states and 3976 transitions. [2021-05-21 20:22:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,468 INFO L225 Difference]: With dead ends: 1242 [2021-05-21 20:22:00,469 INFO L226 Difference]: Without dead ends: 1108 [2021-05-21 20:22:00,469 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-05-21 20:22:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 591. [2021-05-21 20:22:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.3813559322033897) internal successors, (1995), 590 states have internal predecessors, (1995), 0 states have call successors, (0), 0 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:22:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1995 transitions. [2021-05-21 20:22:00,487 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1995 transitions. Word has length 21 [2021-05-21 20:22:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,487 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1995 transitions. [2021-05-21 20:22:00,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1995 transitions. [2021-05-21 20:22:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,489 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,489 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-21 20:22:00,489 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash 770231932, now seen corresponding path program 26 times [2021-05-21 20:22:00,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781254409] [2021-05-21 20:22:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:00,568 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:22:00,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:00,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781254409] [2021-05-21 20:22:00,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781254409] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:00,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:00,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:00,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243834973] [2021-05-21 20:22:00,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:00,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:00,569 INFO L87 Difference]: Start difference. First operand 591 states and 1995 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,629 INFO L93 Difference]: Finished difference Result 1225 states and 3899 transitions. [2021-05-21 20:22:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,632 INFO L225 Difference]: With dead ends: 1225 [2021-05-21 20:22:00,632 INFO L226 Difference]: Without dead ends: 1073 [2021-05-21 20:22:00,632 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-05-21 20:22:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 556. [2021-05-21 20:22:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.4018018018018017) internal successors, (1888), 555 states have internal predecessors, (1888), 0 states have call successors, (0), 0 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:22:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1888 transitions. [2021-05-21 20:22:00,649 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1888 transitions. Word has length 21 [2021-05-21 20:22:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,649 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1888 transitions. [2021-05-21 20:22:00,650 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1888 transitions. [2021-05-21 20:22:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,651 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,651 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-21 20:22:00,651 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1892039334, now seen corresponding path program 27 times [2021-05-21 20:22:00,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287385493] [2021-05-21 20:22:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:00,739 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:22:00,739 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:00,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287385493] [2021-05-21 20:22:00,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287385493] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:00,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:00,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:00,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127163589] [2021-05-21 20:22:00,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:00,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:00,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:00,740 INFO L87 Difference]: Start difference. First operand 556 states and 1888 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,799 INFO L93 Difference]: Finished difference Result 1182 states and 3766 transitions. [2021-05-21 20:22:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,802 INFO L225 Difference]: With dead ends: 1182 [2021-05-21 20:22:00,802 INFO L226 Difference]: Without dead ends: 1079 [2021-05-21 20:22:00,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 94.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-05-21 20:22:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 576. [2021-05-21 20:22:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.3878260869565215) internal successors, (1948), 575 states have internal predecessors, (1948), 0 states have call successors, (0), 0 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:22:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1948 transitions. [2021-05-21 20:22:00,820 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1948 transitions. Word has length 21 [2021-05-21 20:22:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,820 INFO L482 AbstractCegarLoop]: Abstraction has 576 states and 1948 transitions. [2021-05-21 20:22:00,820 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1948 transitions. [2021-05-21 20:22:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,821 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,821 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-21 20:22:00,821 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 537500988, now seen corresponding path program 28 times [2021-05-21 20:22:00,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566002706] [2021-05-21 20:22:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:00,899 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:22:00,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:00,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566002706] [2021-05-21 20:22:00,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566002706] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:00,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:00,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:00,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499354512] [2021-05-21 20:22:00,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:00,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:00,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:00,901 INFO L87 Difference]: Start difference. First operand 576 states and 1948 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:00,942 INFO L93 Difference]: Finished difference Result 1213 states and 3853 transitions. [2021-05-21 20:22:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:00,946 INFO L225 Difference]: With dead ends: 1213 [2021-05-21 20:22:00,946 INFO L226 Difference]: Without dead ends: 1059 [2021-05-21 20:22:00,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-05-21 20:22:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 556. [2021-05-21 20:22:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.383783783783784) internal successors, (1878), 555 states have internal predecessors, (1878), 0 states have call successors, (0), 0 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:22:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1878 transitions. [2021-05-21 20:22:00,962 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1878 transitions. Word has length 21 [2021-05-21 20:22:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:00,962 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1878 transitions. [2021-05-21 20:22:00,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1878 transitions. [2021-05-21 20:22:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:00,964 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:00,964 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:00,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-21 20:22:00,964 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -315771494, now seen corresponding path program 29 times [2021-05-21 20:22:00,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:00,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798529601] [2021-05-21 20:22:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,031 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:22:01,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798529601] [2021-05-21 20:22:01,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798529601] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:01,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174584644] [2021-05-21 20:22:01,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:01,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:01,033 INFO L87 Difference]: Start difference. First operand 556 states and 1878 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,087 INFO L93 Difference]: Finished difference Result 1157 states and 3678 transitions. [2021-05-21 20:22:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,090 INFO L225 Difference]: With dead ends: 1157 [2021-05-21 20:22:01,090 INFO L226 Difference]: Without dead ends: 1054 [2021-05-21 20:22:01,091 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-05-21 20:22:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 568. [2021-05-21 20:22:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.368606701940035) internal successors, (1910), 567 states have internal predecessors, (1910), 0 states have call successors, (0), 0 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:22:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1910 transitions. [2021-05-21 20:22:01,121 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1910 transitions. Word has length 21 [2021-05-21 20:22:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,122 INFO L482 AbstractCegarLoop]: Abstraction has 568 states and 1910 transitions. [2021-05-21 20:22:01,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1910 transitions. [2021-05-21 20:22:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,123 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,123 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,123 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-21 20:22:01,123 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1248886886, now seen corresponding path program 30 times [2021-05-21 20:22:01,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493559451] [2021-05-21 20:22:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,193 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:22:01,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493559451] [2021-05-21 20:22:01,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493559451] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:01,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460459928] [2021-05-21 20:22:01,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:01,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:01,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:01,195 INFO L87 Difference]: Start difference. First operand 568 states and 1910 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,252 INFO L93 Difference]: Finished difference Result 1171 states and 3715 transitions. [2021-05-21 20:22:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,256 INFO L225 Difference]: With dead ends: 1171 [2021-05-21 20:22:01,256 INFO L226 Difference]: Without dead ends: 1028 [2021-05-21 20:22:01,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-05-21 20:22:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 542. [2021-05-21 20:22:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.406654343807763) internal successors, (1843), 541 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:22:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1843 transitions. [2021-05-21 20:22:01,272 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1843 transitions. Word has length 21 [2021-05-21 20:22:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,272 INFO L482 AbstractCegarLoop]: Abstraction has 542 states and 1843 transitions. [2021-05-21 20:22:01,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1843 transitions. [2021-05-21 20:22:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,274 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,274 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-21 20:22:01,274 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2039974810, now seen corresponding path program 31 times [2021-05-21 20:22:01,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179052504] [2021-05-21 20:22:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,359 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:22:01,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179052504] [2021-05-21 20:22:01,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179052504] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:01,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448029590] [2021-05-21 20:22:01,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:01,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:01,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:01,360 INFO L87 Difference]: Start difference. First operand 542 states and 1843 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,402 INFO L93 Difference]: Finished difference Result 1207 states and 3850 transitions. [2021-05-21 20:22:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,405 INFO L225 Difference]: With dead ends: 1207 [2021-05-21 20:22:01,405 INFO L226 Difference]: Without dead ends: 1073 [2021-05-21 20:22:01,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-05-21 20:22:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 591. [2021-05-21 20:22:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 3.371186440677966) internal successors, (1989), 590 states have internal predecessors, (1989), 0 states have call successors, (0), 0 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:22:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1989 transitions. [2021-05-21 20:22:01,423 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1989 transitions. Word has length 21 [2021-05-21 20:22:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,423 INFO L482 AbstractCegarLoop]: Abstraction has 591 states and 1989 transitions. [2021-05-21 20:22:01,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1989 transitions. [2021-05-21 20:22:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,425 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,425 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-21 20:22:01,425 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1203074086, now seen corresponding path program 32 times [2021-05-21 20:22:01,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897316390] [2021-05-21 20:22:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,499 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:22:01,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897316390] [2021-05-21 20:22:01,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897316390] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:01,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689480827] [2021-05-21 20:22:01,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:01,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:01,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:01,500 INFO L87 Difference]: Start difference. First operand 591 states and 1989 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,570 INFO L93 Difference]: Finished difference Result 1190 states and 3773 transitions. [2021-05-21 20:22:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:01,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,573 INFO L225 Difference]: With dead ends: 1190 [2021-05-21 20:22:01,573 INFO L226 Difference]: Without dead ends: 1038 [2021-05-21 20:22:01,573 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-05-21 20:22:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 556. [2021-05-21 20:22:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.390990990990991) internal successors, (1882), 555 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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:22:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1882 transitions. [2021-05-21 20:22:01,589 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1882 transitions. Word has length 21 [2021-05-21 20:22:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,589 INFO L482 AbstractCegarLoop]: Abstraction has 556 states and 1882 transitions. [2021-05-21 20:22:01,590 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1882 transitions. [2021-05-21 20:22:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,591 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,591 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-21 20:22:01,591 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1641198536, now seen corresponding path program 1 times [2021-05-21 20:22:01,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543787189] [2021-05-21 20:22:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,599 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:22:01,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543787189] [2021-05-21 20:22:01,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543787189] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:22:01,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767993695] [2021-05-21 20:22:01,600 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:22:01,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:22:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:22:01,601 INFO L87 Difference]: Start difference. First operand 556 states and 1882 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,604 INFO L93 Difference]: Finished difference Result 473 states and 1551 transitions. [2021-05-21 20:22:01,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:22:01,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,605 INFO L225 Difference]: With dead ends: 473 [2021-05-21 20:22:01,605 INFO L226 Difference]: Without dead ends: 473 [2021-05-21 20:22:01,606 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:22:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-05-21 20:22:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-05-21 20:22:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2860169491525424) internal successors, (1551), 472 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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:22:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1551 transitions. [2021-05-21 20:22:01,616 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1551 transitions. Word has length 21 [2021-05-21 20:22:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,617 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1551 transitions. [2021-05-21 20:22:01,617 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1551 transitions. [2021-05-21 20:22:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,618 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,618 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,618 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-21 20:22:01,618 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1800136862, now seen corresponding path program 33 times [2021-05-21 20:22:01,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,618 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394770824] [2021-05-21 20:22:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,710 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:22:01,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394770824] [2021-05-21 20:22:01,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394770824] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:01,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79195312] [2021-05-21 20:22:01,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:01,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:01,712 INFO L87 Difference]: Start difference. First operand 473 states and 1551 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,753 INFO L93 Difference]: Finished difference Result 940 states and 2857 transitions. [2021-05-21 20:22:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,761 INFO L225 Difference]: With dead ends: 940 [2021-05-21 20:22:01,761 INFO L226 Difference]: Without dead ends: 861 [2021-05-21 20:22:01,761 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-05-21 20:22:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 489. [2021-05-21 20:22:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.276639344262295) internal successors, (1599), 488 states have internal predecessors, (1599), 0 states have call successors, (0), 0 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:22:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1599 transitions. [2021-05-21 20:22:01,781 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1599 transitions. Word has length 21 [2021-05-21 20:22:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,781 INFO L482 AbstractCegarLoop]: Abstraction has 489 states and 1599 transitions. [2021-05-21 20:22:01,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1599 transitions. [2021-05-21 20:22:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,782 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,782 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,783 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-21 20:22:01,783 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1471753980, now seen corresponding path program 34 times [2021-05-21 20:22:01,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265039282] [2021-05-21 20:22:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:01,880 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:22:01,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:01,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265039282] [2021-05-21 20:22:01,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265039282] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:01,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:01,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:01,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137769054] [2021-05-21 20:22:01,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:01,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:01,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:01,882 INFO L87 Difference]: Start difference. First operand 489 states and 1599 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:01,921 INFO L93 Difference]: Finished difference Result 924 states and 2801 transitions. [2021-05-21 20:22:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:01,924 INFO L225 Difference]: With dead ends: 924 [2021-05-21 20:22:01,924 INFO L226 Difference]: Without dead ends: 798 [2021-05-21 20:22:01,924 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-05-21 20:22:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 473. [2021-05-21 20:22:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2690677966101696) internal successors, (1543), 472 states have internal predecessors, (1543), 0 states have call successors, (0), 0 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:22:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1543 transitions. [2021-05-21 20:22:01,939 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1543 transitions. Word has length 21 [2021-05-21 20:22:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:01,939 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1543 transitions. [2021-05-21 20:22:01,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1543 transitions. [2021-05-21 20:22:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:01,940 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:01,940 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:01,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-21 20:22:01,940 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash -243200132, now seen corresponding path program 35 times [2021-05-21 20:22:01,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:01,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393970610] [2021-05-21 20:22:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,041 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:22:02,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393970610] [2021-05-21 20:22:02,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393970610] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712316416] [2021-05-21 20:22:02,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,043 INFO L87 Difference]: Start difference. First operand 473 states and 1543 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:02,093 INFO L93 Difference]: Finished difference Result 915 states and 2771 transitions. [2021-05-21 20:22:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:02,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:02,095 INFO L225 Difference]: With dead ends: 915 [2021-05-21 20:22:02,096 INFO L226 Difference]: Without dead ends: 836 [2021-05-21 20:22:02,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-05-21 20:22:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 481. [2021-05-21 20:22:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 3.25625) internal successors, (1563), 480 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1563 transitions. [2021-05-21 20:22:02,109 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1563 transitions. Word has length 21 [2021-05-21 20:22:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:02,109 INFO L482 AbstractCegarLoop]: Abstraction has 481 states and 1563 transitions. [2021-05-21 20:22:02,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1563 transitions. [2021-05-21 20:22:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:02,110 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:02,110 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:02,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-21 20:22:02,110 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1734695044, now seen corresponding path program 36 times [2021-05-21 20:22:02,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:02,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010887437] [2021-05-21 20:22:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,204 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:22:02,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010887437] [2021-05-21 20:22:02,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010887437] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,205 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,205 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062286749] [2021-05-21 20:22:02,206 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,207 INFO L87 Difference]: Start difference. First operand 481 states and 1563 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:02,272 INFO L93 Difference]: Finished difference Result 899 states and 2715 transitions. [2021-05-21 20:22:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:02,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:02,275 INFO L225 Difference]: With dead ends: 899 [2021-05-21 20:22:02,275 INFO L226 Difference]: Without dead ends: 786 [2021-05-21 20:22:02,275 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 105.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-05-21 20:22:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 461. [2021-05-21 20:22:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.2891304347826087) internal successors, (1513), 460 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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:22:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1513 transitions. [2021-05-21 20:22:02,288 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1513 transitions. Word has length 21 [2021-05-21 20:22:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:02,288 INFO L482 AbstractCegarLoop]: Abstraction has 461 states and 1513 transitions. [2021-05-21 20:22:02,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1513 transitions. [2021-05-21 20:22:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:02,289 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:02,289 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:02,290 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-21 20:22:02,290 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash 749113148, now seen corresponding path program 37 times [2021-05-21 20:22:02,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:02,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301688445] [2021-05-21 20:22:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,376 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:22:02,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301688445] [2021-05-21 20:22:02,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301688445] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072806186] [2021-05-21 20:22:02,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,377 INFO L87 Difference]: Start difference. First operand 461 states and 1513 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:02,442 INFO L93 Difference]: Finished difference Result 927 states and 2839 transitions. [2021-05-21 20:22:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:02,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:02,445 INFO L225 Difference]: With dead ends: 927 [2021-05-21 20:22:02,445 INFO L226 Difference]: Without dead ends: 840 [2021-05-21 20:22:02,446 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 100.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-05-21 20:22:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 477. [2021-05-21 20:22:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.28781512605042) internal successors, (1565), 476 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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:22:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1565 transitions. [2021-05-21 20:22:02,460 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1565 transitions. Word has length 21 [2021-05-21 20:22:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:02,460 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1565 transitions. [2021-05-21 20:22:02,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1565 transitions. [2021-05-21 20:22:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:02,462 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:02,462 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:02,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-21 20:22:02,462 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 997222278, now seen corresponding path program 38 times [2021-05-21 20:22:02,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:02,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447484327] [2021-05-21 20:22:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,538 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:22:02,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447484327] [2021-05-21 20:22:02,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447484327] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871908337] [2021-05-21 20:22:02,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,540 INFO L87 Difference]: Start difference. First operand 477 states and 1565 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:02,580 INFO L93 Difference]: Finished difference Result 919 states and 2803 transitions. [2021-05-21 20:22:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:02,582 INFO L225 Difference]: With dead ends: 919 [2021-05-21 20:22:02,583 INFO L226 Difference]: Without dead ends: 832 [2021-05-21 20:22:02,583 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-05-21 20:22:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 469. [2021-05-21 20:22:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.2927350427350426) internal successors, (1541), 468 states have internal predecessors, (1541), 0 states have call successors, (0), 0 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:22:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1541 transitions. [2021-05-21 20:22:02,596 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1541 transitions. Word has length 21 [2021-05-21 20:22:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:02,596 INFO L482 AbstractCegarLoop]: Abstraction has 469 states and 1541 transitions. [2021-05-21 20:22:02,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1541 transitions. [2021-05-21 20:22:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:02,597 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:02,597 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:02,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-21 20:22:02,597 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1294223846, now seen corresponding path program 39 times [2021-05-21 20:22:02,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:02,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710759900] [2021-05-21 20:22:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,681 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:22:02,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710759900] [2021-05-21 20:22:02,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710759900] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313904080] [2021-05-21 20:22:02,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,682 INFO L87 Difference]: Start difference. First operand 469 states and 1541 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:02,733 INFO L93 Difference]: Finished difference Result 950 states and 2902 transitions. [2021-05-21 20:22:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:02,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:02,735 INFO L225 Difference]: With dead ends: 950 [2021-05-21 20:22:02,735 INFO L226 Difference]: Without dead ends: 863 [2021-05-21 20:22:02,735 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-05-21 20:22:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 489. [2021-05-21 20:22:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.2807377049180326) internal successors, (1601), 488 states have internal predecessors, (1601), 0 states have call successors, (0), 0 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:22:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1601 transitions. [2021-05-21 20:22:02,748 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1601 transitions. Word has length 21 [2021-05-21 20:22:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:02,748 INFO L482 AbstractCegarLoop]: Abstraction has 489 states and 1601 transitions. [2021-05-21 20:22:02,748 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1601 transitions. [2021-05-21 20:22:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:02,749 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:02,749 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:02,749 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-21 20:22:02,749 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2141739260, now seen corresponding path program 40 times [2021-05-21 20:22:02,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:02,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107414169] [2021-05-21 20:22:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,833 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:22:02,833 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107414169] [2021-05-21 20:22:02,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107414169] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633853776] [2021-05-21 20:22:02,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,835 INFO L87 Difference]: Start difference. First operand 489 states and 1601 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:02,874 INFO L93 Difference]: Finished difference Result 973 states and 2957 transitions. [2021-05-21 20:22:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:02,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:02,877 INFO L225 Difference]: With dead ends: 973 [2021-05-21 20:22:02,877 INFO L226 Difference]: Without dead ends: 843 [2021-05-21 20:22:02,877 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-05-21 20:22:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 469. [2021-05-21 20:22:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.2756410256410255) internal successors, (1533), 468 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:22:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1533 transitions. [2021-05-21 20:22:02,889 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1533 transitions. Word has length 21 [2021-05-21 20:22:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:02,889 INFO L482 AbstractCegarLoop]: Abstraction has 469 states and 1533 transitions. [2021-05-21 20:22:02,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1533 transitions. [2021-05-21 20:22:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:02,890 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:02,890 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:02,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-21 20:22:02,890 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash 644082788, now seen corresponding path program 41 times [2021-05-21 20:22:02,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:02,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313382321] [2021-05-21 20:22:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:02,978 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:22:02,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:02,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313382321] [2021-05-21 20:22:02,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313382321] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:02,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:02,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:02,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389747934] [2021-05-21 20:22:02,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:02,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:02,979 INFO L87 Difference]: Start difference. First operand 469 states and 1533 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,016 INFO L93 Difference]: Finished difference Result 930 states and 2822 transitions. [2021-05-21 20:22:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,018 INFO L225 Difference]: With dead ends: 930 [2021-05-21 20:22:03,018 INFO L226 Difference]: Without dead ends: 851 [2021-05-21 20:22:03,018 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2021-05-21 20:22:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 485. [2021-05-21 20:22:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 3.2665289256198347) internal successors, (1581), 484 states have internal predecessors, (1581), 0 states have call successors, (0), 0 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:22:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1581 transitions. [2021-05-21 20:22:03,031 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1581 transitions. Word has length 21 [2021-05-21 20:22:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,031 INFO L482 AbstractCegarLoop]: Abstraction has 485 states and 1581 transitions. [2021-05-21 20:22:03,031 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1581 transitions. [2021-05-21 20:22:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,032 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,032 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-21 20:22:03,033 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash -945851962, now seen corresponding path program 42 times [2021-05-21 20:22:03,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593084925] [2021-05-21 20:22:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,117 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:22:03,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593084925] [2021-05-21 20:22:03,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593084925] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714624387] [2021-05-21 20:22:03,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,118 INFO L87 Difference]: Start difference. First operand 485 states and 1581 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,157 INFO L93 Difference]: Finished difference Result 914 states and 2766 transitions. [2021-05-21 20:22:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,159 INFO L225 Difference]: With dead ends: 914 [2021-05-21 20:22:03,159 INFO L226 Difference]: Without dead ends: 780 [2021-05-21 20:22:03,159 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-05-21 20:22:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 461. [2021-05-21 20:22:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.2804347826086957) internal successors, (1509), 460 states have internal predecessors, (1509), 0 states have call successors, (0), 0 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:22:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1509 transitions. [2021-05-21 20:22:03,171 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1509 transitions. Word has length 21 [2021-05-21 20:22:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,171 INFO L482 AbstractCegarLoop]: Abstraction has 461 states and 1509 transitions. [2021-05-21 20:22:03,171 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1509 transitions. [2021-05-21 20:22:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,172 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,172 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-21 20:22:03,173 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash -97683814, now seen corresponding path program 43 times [2021-05-21 20:22:03,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174618434] [2021-05-21 20:22:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,257 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:22:03,258 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174618434] [2021-05-21 20:22:03,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174618434] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694860653] [2021-05-21 20:22:03,258 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,259 INFO L87 Difference]: Start difference. First operand 461 states and 1509 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,317 INFO L93 Difference]: Finished difference Result 890 states and 2713 transitions. [2021-05-21 20:22:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,319 INFO L225 Difference]: With dead ends: 890 [2021-05-21 20:22:03,319 INFO L226 Difference]: Without dead ends: 803 [2021-05-21 20:22:03,319 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2021-05-21 20:22:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 473. [2021-05-21 20:22:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2733050847457625) internal successors, (1545), 472 states have internal predecessors, (1545), 0 states have call successors, (0), 0 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:22:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1545 transitions. [2021-05-21 20:22:03,328 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1545 transitions. Word has length 21 [2021-05-21 20:22:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,328 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1545 transitions. [2021-05-21 20:22:03,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1545 transitions. [2021-05-21 20:22:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,330 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,330 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,330 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-21 20:22:03,330 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 150425316, now seen corresponding path program 44 times [2021-05-21 20:22:03,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63259696] [2021-05-21 20:22:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,397 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:22:03,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63259696] [2021-05-21 20:22:03,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63259696] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691778260] [2021-05-21 20:22:03,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,399 INFO L87 Difference]: Start difference. First operand 473 states and 1545 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,437 INFO L93 Difference]: Finished difference Result 882 states and 2677 transitions. [2021-05-21 20:22:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,439 INFO L225 Difference]: With dead ends: 882 [2021-05-21 20:22:03,439 INFO L226 Difference]: Without dead ends: 795 [2021-05-21 20:22:03,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-05-21 20:22:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 465. [2021-05-21 20:22:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.2780172413793105) internal successors, (1521), 464 states have internal predecessors, (1521), 0 states have call successors, (0), 0 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:22:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1521 transitions. [2021-05-21 20:22:03,450 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1521 transitions. Word has length 21 [2021-05-21 20:22:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,450 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1521 transitions. [2021-05-21 20:22:03,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1521 transitions. [2021-05-21 20:22:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,451 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,451 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-21 20:22:03,452 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1094782618, now seen corresponding path program 45 times [2021-05-21 20:22:03,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157339322] [2021-05-21 20:22:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,513 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:22:03,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157339322] [2021-05-21 20:22:03,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157339322] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528116089] [2021-05-21 20:22:03,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,514 INFO L87 Difference]: Start difference. First operand 465 states and 1521 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,563 INFO L93 Difference]: Finished difference Result 896 states and 2726 transitions. [2021-05-21 20:22:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,565 INFO L225 Difference]: With dead ends: 896 [2021-05-21 20:22:03,565 INFO L226 Difference]: Without dead ends: 809 [2021-05-21 20:22:03,565 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-05-21 20:22:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 477. [2021-05-21 20:22:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.2626050420168067) internal successors, (1553), 476 states have internal predecessors, (1553), 0 states have call successors, (0), 0 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:22:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1553 transitions. [2021-05-21 20:22:03,577 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1553 transitions. Word has length 21 [2021-05-21 20:22:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,577 INFO L482 AbstractCegarLoop]: Abstraction has 477 states and 1553 transitions. [2021-05-21 20:22:03,577 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1553 transitions. [2021-05-21 20:22:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,578 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,578 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-21 20:22:03,578 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash -421844740, now seen corresponding path program 46 times [2021-05-21 20:22:03,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452226925] [2021-05-21 20:22:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,641 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:22:03,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452226925] [2021-05-21 20:22:03,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452226925] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931873808] [2021-05-21 20:22:03,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,643 INFO L87 Difference]: Start difference. First operand 477 states and 1553 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,698 INFO L93 Difference]: Finished difference Result 902 states and 2731 transitions. [2021-05-21 20:22:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,700 INFO L225 Difference]: With dead ends: 902 [2021-05-21 20:22:03,700 INFO L226 Difference]: Without dead ends: 797 [2021-05-21 20:22:03,700 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-05-21 20:22:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 465. [2021-05-21 20:22:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.269396551724138) internal successors, (1517), 464 states have internal predecessors, (1517), 0 states have call successors, (0), 0 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:22:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1517 transitions. [2021-05-21 20:22:03,712 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1517 transitions. Word has length 21 [2021-05-21 20:22:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,712 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1517 transitions. [2021-05-21 20:22:03,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1517 transitions. [2021-05-21 20:22:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,713 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,713 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-21 20:22:03,713 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1261878044, now seen corresponding path program 47 times [2021-05-21 20:22:03,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021947011] [2021-05-21 20:22:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,785 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:22:03,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021947011] [2021-05-21 20:22:03,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021947011] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081449378] [2021-05-21 20:22:03,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,786 INFO L87 Difference]: Start difference. First operand 465 states and 1517 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,825 INFO L93 Difference]: Finished difference Result 876 states and 2650 transitions. [2021-05-21 20:22:03,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,827 INFO L225 Difference]: With dead ends: 876 [2021-05-21 20:22:03,827 INFO L226 Difference]: Without dead ends: 797 [2021-05-21 20:22:03,827 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-05-21 20:22:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 473. [2021-05-21 20:22:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2563559322033897) internal successors, (1537), 472 states have internal predecessors, (1537), 0 states have call successors, (0), 0 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:22:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1537 transitions. [2021-05-21 20:22:03,838 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1537 transitions. Word has length 21 [2021-05-21 20:22:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,838 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1537 transitions. [2021-05-21 20:22:03,838 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1537 transitions. [2021-05-21 20:22:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,839 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,839 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-21 20:22:03,840 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1464160710, now seen corresponding path program 48 times [2021-05-21 20:22:03,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698330217] [2021-05-21 20:22:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:03,911 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:22:03,911 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:03,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698330217] [2021-05-21 20:22:03,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698330217] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:03,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:03,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:03,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730590256] [2021-05-21 20:22:03,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:03,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:03,912 INFO L87 Difference]: Start difference. First operand 473 states and 1537 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:03,966 INFO L93 Difference]: Finished difference Result 860 states and 2594 transitions. [2021-05-21 20:22:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:03,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:03,968 INFO L225 Difference]: With dead ends: 860 [2021-05-21 20:22:03,968 INFO L226 Difference]: Without dead ends: 749 [2021-05-21 20:22:03,968 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-05-21 20:22:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 455. [2021-05-21 20:22:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.297356828193833) internal successors, (1497), 454 states have internal predecessors, (1497), 0 states have call successors, (0), 0 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:22:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1497 transitions. [2021-05-21 20:22:03,978 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1497 transitions. Word has length 21 [2021-05-21 20:22:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:03,979 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1497 transitions. [2021-05-21 20:22:03,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1497 transitions. [2021-05-21 20:22:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:03,980 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:03,980 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:03,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-21 20:22:03,980 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1149207288, now seen corresponding path program 49 times [2021-05-21 20:22:03,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:03,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827354701] [2021-05-21 20:22:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,054 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:22:04,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827354701] [2021-05-21 20:22:04,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827354701] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688041422] [2021-05-21 20:22:04,055 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,055 INFO L87 Difference]: Start difference. First operand 455 states and 1497 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,094 INFO L93 Difference]: Finished difference Result 982 states and 2989 transitions. [2021-05-21 20:22:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,096 INFO L225 Difference]: With dead ends: 982 [2021-05-21 20:22:04,096 INFO L226 Difference]: Without dead ends: 872 [2021-05-21 20:22:04,097 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-05-21 20:22:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 486. [2021-05-21 20:22:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.2494845360824742) internal successors, (1576), 485 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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:22:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1576 transitions. [2021-05-21 20:22:04,109 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1576 transitions. Word has length 21 [2021-05-21 20:22:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,109 INFO L482 AbstractCegarLoop]: Abstraction has 486 states and 1576 transitions. [2021-05-21 20:22:04,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1576 transitions. [2021-05-21 20:22:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,110 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,110 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-21 20:22:04,110 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2093841608, now seen corresponding path program 50 times [2021-05-21 20:22:04,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489798202] [2021-05-21 20:22:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:04,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489798202] [2021-05-21 20:22:04,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489798202] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358972109] [2021-05-21 20:22:04,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,187 INFO L87 Difference]: Start difference. First operand 486 states and 1576 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,244 INFO L93 Difference]: Finished difference Result 965 states and 2916 transitions. [2021-05-21 20:22:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,246 INFO L225 Difference]: With dead ends: 965 [2021-05-21 20:22:04,246 INFO L226 Difference]: Without dead ends: 841 [2021-05-21 20:22:04,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-05-21 20:22:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 455. [2021-05-21 20:22:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.2709251101321586) internal successors, (1485), 454 states have internal predecessors, (1485), 0 states have call successors, (0), 0 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:22:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1485 transitions. [2021-05-21 20:22:04,257 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1485 transitions. Word has length 21 [2021-05-21 20:22:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,258 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1485 transitions. [2021-05-21 20:22:04,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1485 transitions. [2021-05-21 20:22:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,259 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,259 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,259 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-21 20:22:04,259 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 909369340, now seen corresponding path program 51 times [2021-05-21 20:22:04,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437760397] [2021-05-21 20:22:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,340 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:22:04,340 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437760397] [2021-05-21 20:22:04,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437760397] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896962443] [2021-05-21 20:22:04,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,341 INFO L87 Difference]: Start difference. First operand 455 states and 1485 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,387 INFO L93 Difference]: Finished difference Result 922 states and 2791 transitions. [2021-05-21 20:22:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,389 INFO L225 Difference]: With dead ends: 922 [2021-05-21 20:22:04,389 INFO L226 Difference]: Without dead ends: 843 [2021-05-21 20:22:04,390 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-05-21 20:22:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 471. [2021-05-21 20:22:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 3.2617021276595746) internal successors, (1533), 470 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:22:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1533 transitions. [2021-05-21 20:22:04,402 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1533 transitions. Word has length 21 [2021-05-21 20:22:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,402 INFO L482 AbstractCegarLoop]: Abstraction has 471 states and 1533 transitions. [2021-05-21 20:22:04,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1533 transitions. [2021-05-21 20:22:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,403 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,403 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-21 20:22:04,404 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 580986458, now seen corresponding path program 52 times [2021-05-21 20:22:04,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223137514] [2021-05-21 20:22:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,492 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:22:04,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223137514] [2021-05-21 20:22:04,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223137514] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818803339] [2021-05-21 20:22:04,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,493 INFO L87 Difference]: Start difference. First operand 471 states and 1533 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,533 INFO L93 Difference]: Finished difference Result 953 states and 2878 transitions. [2021-05-21 20:22:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,535 INFO L225 Difference]: With dead ends: 953 [2021-05-21 20:22:04,535 INFO L226 Difference]: Without dead ends: 827 [2021-05-21 20:22:04,535 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-05-21 20:22:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 455. [2021-05-21 20:22:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.253303964757709) internal successors, (1477), 454 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:22:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1477 transitions. [2021-05-21 20:22:04,546 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1477 transitions. Word has length 21 [2021-05-21 20:22:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,546 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 1477 transitions. [2021-05-21 20:22:04,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1477 transitions. [2021-05-21 20:22:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,548 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,548 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-21 20:22:04,548 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1133967654, now seen corresponding path program 53 times [2021-05-21 20:22:04,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301697733] [2021-05-21 20:22:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,633 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:22:04,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301697733] [2021-05-21 20:22:04,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301697733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710130684] [2021-05-21 20:22:04,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,635 INFO L87 Difference]: Start difference. First operand 455 states and 1477 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,678 INFO L93 Difference]: Finished difference Result 897 states and 2705 transitions. [2021-05-21 20:22:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,679 INFO L225 Difference]: With dead ends: 897 [2021-05-21 20:22:04,679 INFO L226 Difference]: Without dead ends: 818 [2021-05-21 20:22:04,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2021-05-21 20:22:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 463. [2021-05-21 20:22:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 3.24025974025974) internal successors, (1497), 462 states have internal predecessors, (1497), 0 states have call successors, (0), 0 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:22:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1497 transitions. [2021-05-21 20:22:04,692 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1497 transitions. Word has length 21 [2021-05-21 20:22:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,692 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1497 transitions. [2021-05-21 20:22:04,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1497 transitions. [2021-05-21 20:22:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,693 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,693 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,693 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-21 20:22:04,693 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1669504730, now seen corresponding path program 54 times [2021-05-21 20:22:04,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147431818] [2021-05-21 20:22:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:04,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147431818] [2021-05-21 20:22:04,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147431818] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607536605] [2021-05-21 20:22:04,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,779 INFO L87 Difference]: Start difference. First operand 463 states and 1497 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,845 INFO L93 Difference]: Finished difference Result 911 states and 2742 transitions. [2021-05-21 20:22:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,847 INFO L225 Difference]: With dead ends: 911 [2021-05-21 20:22:04,847 INFO L226 Difference]: Without dead ends: 798 [2021-05-21 20:22:04,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 103.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-05-21 20:22:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 443. [2021-05-21 20:22:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.273755656108597) internal successors, (1447), 442 states have internal predecessors, (1447), 0 states have call successors, (0), 0 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:22:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1447 transitions. [2021-05-21 20:22:04,855 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1447 transitions. Word has length 21 [2021-05-21 20:22:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,855 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1447 transitions. [2021-05-21 20:22:04,855 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1447 transitions. [2021-05-21 20:22:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,857 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,857 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-21 20:22:04,857 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2053126694, now seen corresponding path program 55 times [2021-05-21 20:22:04,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541641104] [2021-05-21 20:22:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:04,925 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:22:04,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:04,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541641104] [2021-05-21 20:22:04,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541641104] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:04,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:04,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:04,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517514372] [2021-05-21 20:22:04,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:04,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:04,926 INFO L87 Difference]: Start difference. First operand 443 states and 1447 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:04,964 INFO L93 Difference]: Finished difference Result 963 states and 2923 transitions. [2021-05-21 20:22:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:04,966 INFO L225 Difference]: With dead ends: 963 [2021-05-21 20:22:04,966 INFO L226 Difference]: Without dead ends: 853 [2021-05-21 20:22:04,967 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-05-21 20:22:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 443. [2021-05-21 20:22:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.2217194570135748) internal successors, (1424), 442 states have internal predecessors, (1424), 0 states have call successors, (0), 0 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:22:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1424 transitions. [2021-05-21 20:22:04,978 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1424 transitions. Word has length 21 [2021-05-21 20:22:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:04,979 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1424 transitions. [2021-05-21 20:22:04,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1424 transitions. [2021-05-21 20:22:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:04,980 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:04,980 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:04,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-21 20:22:04,980 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1001208294, now seen corresponding path program 56 times [2021-05-21 20:22:04,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:04,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745617457] [2021-05-21 20:22:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,055 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:22:05,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745617457] [2021-05-21 20:22:05,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745617457] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417212257] [2021-05-21 20:22:05,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,057 INFO L87 Difference]: Start difference. First operand 443 states and 1424 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,115 INFO L93 Difference]: Finished difference Result 946 states and 2850 transitions. [2021-05-21 20:22:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,117 INFO L225 Difference]: With dead ends: 946 [2021-05-21 20:22:05,117 INFO L226 Difference]: Without dead ends: 822 [2021-05-21 20:22:05,117 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-05-21 20:22:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 412. [2021-05-21 20:22:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.236009732360097) internal successors, (1330), 411 states have internal predecessors, (1330), 0 states have call successors, (0), 0 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:22:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1330 transitions. [2021-05-21 20:22:05,128 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1330 transitions. Word has length 21 [2021-05-21 20:22:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,128 INFO L482 AbstractCegarLoop]: Abstraction has 412 states and 1330 transitions. [2021-05-21 20:22:05,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1330 transitions. [2021-05-21 20:22:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,129 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,129 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-21 20:22:05,129 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1785983304, now seen corresponding path program 57 times [2021-05-21 20:22:05,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260502545] [2021-05-21 20:22:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,201 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:22:05,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260502545] [2021-05-21 20:22:05,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260502545] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341635604] [2021-05-21 20:22:05,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,202 INFO L87 Difference]: Start difference. First operand 412 states and 1330 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,244 INFO L93 Difference]: Finished difference Result 905 states and 2737 transitions. [2021-05-21 20:22:05,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,247 INFO L225 Difference]: With dead ends: 905 [2021-05-21 20:22:05,247 INFO L226 Difference]: Without dead ends: 795 [2021-05-21 20:22:05,247 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-05-21 20:22:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 434. [2021-05-21 20:22:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.203233256351039) internal successors, (1387), 433 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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:22:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1387 transitions. [2021-05-21 20:22:05,258 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1387 transitions. Word has length 21 [2021-05-21 20:22:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,258 INFO L482 AbstractCegarLoop]: Abstraction has 434 states and 1387 transitions. [2021-05-21 20:22:05,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1387 transitions. [2021-05-21 20:22:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,259 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,259 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,259 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-21 20:22:05,259 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1302841370, now seen corresponding path program 58 times [2021-05-21 20:22:05,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237730123] [2021-05-21 20:22:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,327 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:22:05,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237730123] [2021-05-21 20:22:05,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237730123] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343357992] [2021-05-21 20:22:05,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,328 INFO L87 Difference]: Start difference. First operand 434 states and 1387 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,383 INFO L93 Difference]: Finished difference Result 822 states and 2499 transitions. [2021-05-21 20:22:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,385 INFO L225 Difference]: With dead ends: 822 [2021-05-21 20:22:05,385 INFO L226 Difference]: Without dead ends: 709 [2021-05-21 20:22:05,385 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-05-21 20:22:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 412. [2021-05-21 20:22:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.2092457420924574) internal successors, (1319), 411 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1319 transitions. [2021-05-21 20:22:05,395 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1319 transitions. Word has length 21 [2021-05-21 20:22:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,395 INFO L482 AbstractCegarLoop]: Abstraction has 412 states and 1319 transitions. [2021-05-21 20:22:05,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1319 transitions. [2021-05-21 20:22:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,396 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,396 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-21 20:22:05,396 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -737228710, now seen corresponding path program 59 times [2021-05-21 20:22:05,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464368153] [2021-05-21 20:22:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,462 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:22:05,463 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464368153] [2021-05-21 20:22:05,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464368153] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802870403] [2021-05-21 20:22:05,463 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,464 INFO L87 Difference]: Start difference. First operand 412 states and 1319 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,519 INFO L93 Difference]: Finished difference Result 880 states and 2648 transitions. [2021-05-21 20:22:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,521 INFO L225 Difference]: With dead ends: 880 [2021-05-21 20:22:05,521 INFO L226 Difference]: Without dead ends: 787 [2021-05-21 20:22:05,521 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-05-21 20:22:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 426. [2021-05-21 20:22:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.1905882352941175) internal successors, (1356), 425 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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:22:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1356 transitions. [2021-05-21 20:22:05,541 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1356 transitions. Word has length 21 [2021-05-21 20:22:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,541 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1356 transitions. [2021-05-21 20:22:05,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1356 transitions. [2021-05-21 20:22:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,543 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,543 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-21 20:22:05,543 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1065611592, now seen corresponding path program 60 times [2021-05-21 20:22:05,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612070532] [2021-05-21 20:22:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,637 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:22:05,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612070532] [2021-05-21 20:22:05,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612070532] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682342139] [2021-05-21 20:22:05,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,638 INFO L87 Difference]: Start difference. First operand 426 states and 1356 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,689 INFO L93 Difference]: Finished difference Result 814 states and 2468 transitions. [2021-05-21 20:22:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,691 INFO L225 Difference]: With dead ends: 814 [2021-05-21 20:22:05,691 INFO L226 Difference]: Without dead ends: 690 [2021-05-21 20:22:05,691 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-05-21 20:22:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 393. [2021-05-21 20:22:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2448979591836733) internal successors, (1272), 392 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:22:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1272 transitions. [2021-05-21 20:22:05,701 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1272 transitions. Word has length 21 [2021-05-21 20:22:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,701 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1272 transitions. [2021-05-21 20:22:05,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1272 transitions. [2021-05-21 20:22:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,702 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,702 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-21 20:22:05,702 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash 910773180, now seen corresponding path program 61 times [2021-05-21 20:22:05,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793860685] [2021-05-21 20:22:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,774 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:22:05,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793860685] [2021-05-21 20:22:05,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793860685] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273583006] [2021-05-21 20:22:05,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,775 INFO L87 Difference]: Start difference. First operand 393 states and 1272 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,814 INFO L93 Difference]: Finished difference Result 825 states and 2485 transitions. [2021-05-21 20:22:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,816 INFO L225 Difference]: With dead ends: 825 [2021-05-21 20:22:05,816 INFO L226 Difference]: Without dead ends: 746 [2021-05-21 20:22:05,816 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-05-21 20:22:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 417. [2021-05-21 20:22:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.25) internal successors, (1352), 416 states have internal predecessors, (1352), 0 states have call successors, (0), 0 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:22:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1352 transitions. [2021-05-21 20:22:05,826 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1352 transitions. Word has length 21 [2021-05-21 20:22:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,826 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1352 transitions. [2021-05-21 20:22:05,826 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1352 transitions. [2021-05-21 20:22:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,827 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,827 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-21 20:22:05,827 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 582390298, now seen corresponding path program 62 times [2021-05-21 20:22:05,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979998740] [2021-05-21 20:22:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:05,904 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:22:05,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:05,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979998740] [2021-05-21 20:22:05,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979998740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:05,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:05,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:05,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473292089] [2021-05-21 20:22:05,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:05,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:05,906 INFO L87 Difference]: Start difference. First operand 417 states and 1352 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:05,948 INFO L93 Difference]: Finished difference Result 856 states and 2572 transitions. [2021-05-21 20:22:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:05,950 INFO L225 Difference]: With dead ends: 856 [2021-05-21 20:22:05,950 INFO L226 Difference]: Without dead ends: 730 [2021-05-21 20:22:05,950 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-05-21 20:22:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 401. [2021-05-21 20:22:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.24) internal successors, (1296), 400 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:22:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1296 transitions. [2021-05-21 20:22:05,959 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1296 transitions. Word has length 21 [2021-05-21 20:22:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:05,960 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1296 transitions. [2021-05-21 20:22:05,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1296 transitions. [2021-05-21 20:22:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:05,961 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:05,961 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:05,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-21 20:22:05,961 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2103239612, now seen corresponding path program 63 times [2021-05-21 20:22:05,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:05,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988316900] [2021-05-21 20:22:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,033 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:22:06,033 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988316900] [2021-05-21 20:22:06,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988316900] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124124173] [2021-05-21 20:22:06,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,034 INFO L87 Difference]: Start difference. First operand 401 states and 1296 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,073 INFO L93 Difference]: Finished difference Result 829 states and 2489 transitions. [2021-05-21 20:22:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,075 INFO L225 Difference]: With dead ends: 829 [2021-05-21 20:22:06,075 INFO L226 Difference]: Without dead ends: 750 [2021-05-21 20:22:06,075 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-05-21 20:22:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 409. [2021-05-21 20:22:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 3.2254901960784315) internal successors, (1316), 408 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1316 transitions. [2021-05-21 20:22:06,086 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1316 transitions. Word has length 21 [2021-05-21 20:22:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,086 INFO L482 AbstractCegarLoop]: Abstraction has 409 states and 1316 transitions. [2021-05-21 20:22:06,086 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1316 transitions. [2021-05-21 20:22:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,087 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,087 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-21 20:22:06,087 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1049070524, now seen corresponding path program 64 times [2021-05-21 20:22:06,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162359538] [2021-05-21 20:22:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,154 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:22:06,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162359538] [2021-05-21 20:22:06,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162359538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242234858] [2021-05-21 20:22:06,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,155 INFO L87 Difference]: Start difference. First operand 409 states and 1316 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,201 INFO L93 Difference]: Finished difference Result 777 states and 2360 transitions. [2021-05-21 20:22:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,203 INFO L225 Difference]: With dead ends: 777 [2021-05-21 20:22:06,203 INFO L226 Difference]: Without dead ends: 678 [2021-05-21 20:22:06,203 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-05-21 20:22:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 401. [2021-05-21 20:22:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.23) internal successors, (1292), 400 states have internal predecessors, (1292), 0 states have call successors, (0), 0 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:22:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1292 transitions. [2021-05-21 20:22:06,212 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1292 transitions. Word has length 21 [2021-05-21 20:22:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,212 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1292 transitions. [2021-05-21 20:22:06,212 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1292 transitions. [2021-05-21 20:22:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,213 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,213 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-05-21 20:22:06,213 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1868918118, now seen corresponding path program 65 times [2021-05-21 20:22:06,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139737728] [2021-05-21 20:22:06,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:06,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139737728] [2021-05-21 20:22:06,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139737728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651409050] [2021-05-21 20:22:06,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,279 INFO L87 Difference]: Start difference. First operand 401 states and 1292 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,318 INFO L93 Difference]: Finished difference Result 805 states and 2409 transitions. [2021-05-21 20:22:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,320 INFO L225 Difference]: With dead ends: 805 [2021-05-21 20:22:06,320 INFO L226 Difference]: Without dead ends: 695 [2021-05-21 20:22:06,320 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-05-21 20:22:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 423. [2021-05-21 20:22:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.1966824644549763) internal successors, (1349), 422 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1349 transitions. [2021-05-21 20:22:06,329 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1349 transitions. Word has length 21 [2021-05-21 20:22:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,329 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1349 transitions. [2021-05-21 20:22:06,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1349 transitions. [2021-05-21 20:22:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,330 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,330 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,330 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-21 20:22:06,331 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash 857120636, now seen corresponding path program 66 times [2021-05-21 20:22:06,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145543680] [2021-05-21 20:22:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:06,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145543680] [2021-05-21 20:22:06,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145543680] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923932078] [2021-05-21 20:22:06,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,395 INFO L87 Difference]: Start difference. First operand 423 states and 1349 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,442 INFO L93 Difference]: Finished difference Result 722 states and 2171 transitions. [2021-05-21 20:22:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,443 INFO L225 Difference]: With dead ends: 722 [2021-05-21 20:22:06,444 INFO L226 Difference]: Without dead ends: 601 [2021-05-21 20:22:06,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-05-21 20:22:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 393. [2021-05-21 20:22:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2346938775510203) internal successors, (1268), 392 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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:22:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1268 transitions. [2021-05-21 20:22:06,453 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1268 transitions. Word has length 21 [2021-05-21 20:22:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,453 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1268 transitions. [2021-05-21 20:22:06,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1268 transitions. [2021-05-21 20:22:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,454 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,454 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-21 20:22:06,454 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1893120794, now seen corresponding path program 67 times [2021-05-21 20:22:06,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314458612] [2021-05-21 20:22:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,530 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:22:06,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314458612] [2021-05-21 20:22:06,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314458612] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600961047] [2021-05-21 20:22:06,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,531 INFO L87 Difference]: Start difference. First operand 393 states and 1268 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,569 INFO L93 Difference]: Finished difference Result 788 states and 2359 transitions. [2021-05-21 20:22:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,571 INFO L225 Difference]: With dead ends: 788 [2021-05-21 20:22:06,571 INFO L226 Difference]: Without dead ends: 709 [2021-05-21 20:22:06,571 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-05-21 20:22:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 405. [2021-05-21 20:22:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.227722772277228) internal successors, (1304), 404 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1304 transitions. [2021-05-21 20:22:06,581 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1304 transitions. Word has length 21 [2021-05-21 20:22:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,581 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1304 transitions. [2021-05-21 20:22:06,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1304 transitions. [2021-05-21 20:22:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,582 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,582 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-21 20:22:06,582 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 401625882, now seen corresponding path program 68 times [2021-05-21 20:22:06,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884292625] [2021-05-21 20:22:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,658 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:22:06,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884292625] [2021-05-21 20:22:06,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884292625] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599983656] [2021-05-21 20:22:06,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,660 INFO L87 Difference]: Start difference. First operand 405 states and 1304 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,730 INFO L93 Difference]: Finished difference Result 802 states and 2396 transitions. [2021-05-21 20:22:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,732 INFO L225 Difference]: With dead ends: 802 [2021-05-21 20:22:06,732 INFO L226 Difference]: Without dead ends: 701 [2021-05-21 20:22:06,732 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-05-21 20:22:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 397. [2021-05-21 20:22:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.2323232323232323) internal successors, (1280), 396 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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:22:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1280 transitions. [2021-05-21 20:22:06,741 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1280 transitions. Word has length 21 [2021-05-21 20:22:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,742 INFO L482 AbstractCegarLoop]: Abstraction has 397 states and 1280 transitions. [2021-05-21 20:22:06,742 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1280 transitions. [2021-05-21 20:22:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,742 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,743 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-21 20:22:06,743 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1320783876, now seen corresponding path program 69 times [2021-05-21 20:22:06,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507611050] [2021-05-21 20:22:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,811 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:22:06,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507611050] [2021-05-21 20:22:06,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507611050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403790269] [2021-05-21 20:22:06,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,812 INFO L87 Difference]: Start difference. First operand 397 states and 1280 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,850 INFO L93 Difference]: Finished difference Result 800 states and 2395 transitions. [2021-05-21 20:22:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,852 INFO L225 Difference]: With dead ends: 800 [2021-05-21 20:22:06,852 INFO L226 Difference]: Without dead ends: 721 [2021-05-21 20:22:06,852 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-05-21 20:22:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 405. [2021-05-21 20:22:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.217821782178218) internal successors, (1300), 404 states have internal predecessors, (1300), 0 states have call successors, (0), 0 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:22:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1300 transitions. [2021-05-21 20:22:06,860 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1300 transitions. Word has length 21 [2021-05-21 20:22:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:06,861 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1300 transitions. [2021-05-21 20:22:06,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1300 transitions. [2021-05-21 20:22:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:06,862 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:06,862 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:06,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-21 20:22:06,862 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash 202273562, now seen corresponding path program 70 times [2021-05-21 20:22:06,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:06,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345057884] [2021-05-21 20:22:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:06,941 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:22:06,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:06,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345057884] [2021-05-21 20:22:06,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345057884] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:06,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:06,942 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:06,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641109580] [2021-05-21 20:22:06,942 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:06,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:06,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:06,943 INFO L87 Difference]: Start difference. First operand 405 states and 1300 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:06,998 INFO L93 Difference]: Finished difference Result 748 states and 2266 transitions. [2021-05-21 20:22:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:06,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:06,999 INFO L225 Difference]: With dead ends: 748 [2021-05-21 20:22:06,999 INFO L226 Difference]: Without dead ends: 649 [2021-05-21 20:22:06,999 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-05-21 20:22:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 397. [2021-05-21 20:22:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.2222222222222223) internal successors, (1276), 396 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:22:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1276 transitions. [2021-05-21 20:22:07,007 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1276 transitions. Word has length 21 [2021-05-21 20:22:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,007 INFO L482 AbstractCegarLoop]: Abstraction has 397 states and 1276 transitions. [2021-05-21 20:22:07,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1276 transitions. [2021-05-21 20:22:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,008 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,008 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-05-21 20:22:07,008 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 957414170, now seen corresponding path program 71 times [2021-05-21 20:22:07,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76449531] [2021-05-21 20:22:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,091 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:22:07,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76449531] [2021-05-21 20:22:07,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76449531] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,091 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,091 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132231519] [2021-05-21 20:22:07,092 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,092 INFO L87 Difference]: Start difference. First operand 397 states and 1276 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:07,150 INFO L93 Difference]: Finished difference Result 776 states and 2315 transitions. [2021-05-21 20:22:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:07,151 INFO L225 Difference]: With dead ends: 776 [2021-05-21 20:22:07,151 INFO L226 Difference]: Without dead ends: 683 [2021-05-21 20:22:07,152 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-05-21 20:22:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 411. [2021-05-21 20:22:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.202439024390244) internal successors, (1313), 410 states have internal predecessors, (1313), 0 states have call successors, (0), 0 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:22:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1313 transitions. [2021-05-21 20:22:07,161 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1313 transitions. Word has length 21 [2021-05-21 20:22:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,161 INFO L482 AbstractCegarLoop]: Abstraction has 411 states and 1313 transitions. [2021-05-21 20:22:07,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1313 transitions. [2021-05-21 20:22:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,162 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,162 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-21 20:22:07,162 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash -632520580, now seen corresponding path program 72 times [2021-05-21 20:22:07,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145456693] [2021-05-21 20:22:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,236 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:22:07,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145456693] [2021-05-21 20:22:07,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145456693] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135126434] [2021-05-21 20:22:07,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,237 INFO L87 Difference]: Start difference. First operand 411 states and 1313 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:07,293 INFO L93 Difference]: Finished difference Result 710 states and 2135 transitions. [2021-05-21 20:22:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:07,294 INFO L225 Difference]: With dead ends: 710 [2021-05-21 20:22:07,295 INFO L226 Difference]: Without dead ends: 593 [2021-05-21 20:22:07,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-05-21 20:22:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 385. [2021-05-21 20:22:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.2604166666666665) internal successors, (1252), 384 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:22:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1252 transitions. [2021-05-21 20:22:07,303 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1252 transitions. Word has length 21 [2021-05-21 20:22:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,303 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1252 transitions. [2021-05-21 20:22:07,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1252 transitions. [2021-05-21 20:22:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,304 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,304 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-21 20:22:07,305 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1845007066, now seen corresponding path program 73 times [2021-05-21 20:22:07,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508651813] [2021-05-21 20:22:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,379 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:22:07,379 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508651813] [2021-05-21 20:22:07,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508651813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331197009] [2021-05-21 20:22:07,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,380 INFO L87 Difference]: Start difference. First operand 385 states and 1252 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:07,433 INFO L93 Difference]: Finished difference Result 760 states and 2275 transitions. [2021-05-21 20:22:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:07,434 INFO L225 Difference]: With dead ends: 760 [2021-05-21 20:22:07,434 INFO L226 Difference]: Without dead ends: 673 [2021-05-21 20:22:07,434 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-05-21 20:22:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 393. [2021-05-21 20:22:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2448979591836733) internal successors, (1272), 392 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:22:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1272 transitions. [2021-05-21 20:22:07,444 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1272 transitions. Word has length 21 [2021-05-21 20:22:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,444 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1272 transitions. [2021-05-21 20:22:07,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1272 transitions. [2021-05-21 20:22:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,445 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,445 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,445 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-21 20:22:07,445 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2093116196, now seen corresponding path program 74 times [2021-05-21 20:22:07,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578029299] [2021-05-21 20:22:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,530 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:22:07,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578029299] [2021-05-21 20:22:07,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578029299] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002871786] [2021-05-21 20:22:07,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,531 INFO L87 Difference]: Start difference. First operand 393 states and 1272 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:07,575 INFO L93 Difference]: Finished difference Result 752 states and 2239 transitions. [2021-05-21 20:22:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:07,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:07,577 INFO L225 Difference]: With dead ends: 752 [2021-05-21 20:22:07,577 INFO L226 Difference]: Without dead ends: 665 [2021-05-21 20:22:07,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-05-21 20:22:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 385. [2021-05-21 20:22:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.25) internal successors, (1248), 384 states have internal predecessors, (1248), 0 states have call successors, (0), 0 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:22:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1248 transitions. [2021-05-21 20:22:07,587 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1248 transitions. Word has length 21 [2021-05-21 20:22:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,587 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1248 transitions. [2021-05-21 20:22:07,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1248 transitions. [2021-05-21 20:22:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,588 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,588 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-21 20:22:07,588 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -198329928, now seen corresponding path program 75 times [2021-05-21 20:22:07,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,588 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046383118] [2021-05-21 20:22:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,672 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:22:07,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046383118] [2021-05-21 20:22:07,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046383118] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827362913] [2021-05-21 20:22:07,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,674 INFO L87 Difference]: Start difference. First operand 385 states and 1248 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:07,723 INFO L93 Difference]: Finished difference Result 803 states and 2410 transitions. [2021-05-21 20:22:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:07,725 INFO L225 Difference]: With dead ends: 803 [2021-05-21 20:22:07,725 INFO L226 Difference]: Without dead ends: 716 [2021-05-21 20:22:07,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 100.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-05-21 20:22:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 405. [2021-05-21 20:22:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.237623762376238) internal successors, (1308), 404 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:22:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1308 transitions. [2021-05-21 20:22:07,735 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1308 transitions. Word has length 21 [2021-05-21 20:22:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,735 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1308 transitions. [2021-05-21 20:22:07,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1308 transitions. [2021-05-21 20:22:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,736 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,736 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-21 20:22:07,736 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1057334118, now seen corresponding path program 76 times [2021-05-21 20:22:07,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154975613] [2021-05-21 20:22:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,821 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:22:07,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154975613] [2021-05-21 20:22:07,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154975613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099930665] [2021-05-21 20:22:07,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,822 INFO L87 Difference]: Start difference. First operand 405 states and 1308 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:07,861 INFO L93 Difference]: Finished difference Result 826 states and 2465 transitions. [2021-05-21 20:22:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:07,863 INFO L225 Difference]: With dead ends: 826 [2021-05-21 20:22:07,863 INFO L226 Difference]: Without dead ends: 696 [2021-05-21 20:22:07,863 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-05-21 20:22:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 385. [2021-05-21 20:22:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.2291666666666665) internal successors, (1240), 384 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1240 transitions. [2021-05-21 20:22:07,873 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1240 transitions. Word has length 21 [2021-05-21 20:22:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:07,873 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1240 transitions. [2021-05-21 20:22:07,873 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1240 transitions. [2021-05-21 20:22:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:07,905 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:07,905 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:07,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-05-21 20:22:07,906 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1739976706, now seen corresponding path program 77 times [2021-05-21 20:22:07,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:07,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855374880] [2021-05-21 20:22:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:07,992 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:22:07,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:07,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855374880] [2021-05-21 20:22:07,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855374880] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:07,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:07,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:07,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889519264] [2021-05-21 20:22:07,993 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:07,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:07,993 INFO L87 Difference]: Start difference. First operand 385 states and 1240 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,031 INFO L93 Difference]: Finished difference Result 783 states and 2330 transitions. [2021-05-21 20:22:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,032 INFO L225 Difference]: With dead ends: 783 [2021-05-21 20:22:08,033 INFO L226 Difference]: Without dead ends: 704 [2021-05-21 20:22:08,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 89.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-05-21 20:22:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 401. [2021-05-21 20:22:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.22) internal successors, (1288), 400 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1288 transitions. [2021-05-21 20:22:08,042 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1288 transitions. Word has length 21 [2021-05-21 20:22:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,042 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1288 transitions. [2021-05-21 20:22:08,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1288 transitions. [2021-05-21 20:22:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,043 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,043 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-21 20:22:08,043 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,044 INFO L82 PathProgramCache]: Analyzing trace with hash 150041956, now seen corresponding path program 78 times [2021-05-21 20:22:08,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234151705] [2021-05-21 20:22:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:08,125 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234151705] [2021-05-21 20:22:08,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234151705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926770183] [2021-05-21 20:22:08,126 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,126 INFO L87 Difference]: Start difference. First operand 401 states and 1288 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,167 INFO L93 Difference]: Finished difference Result 814 states and 2417 transitions. [2021-05-21 20:22:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,169 INFO L225 Difference]: With dead ends: 814 [2021-05-21 20:22:08,169 INFO L226 Difference]: Without dead ends: 680 [2021-05-21 20:22:08,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-05-21 20:22:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 377. [2021-05-21 20:22:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.234042553191489) internal successors, (1216), 376 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:22:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1216 transitions. [2021-05-21 20:22:08,178 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1216 transitions. Word has length 21 [2021-05-21 20:22:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,178 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1216 transitions. [2021-05-21 20:22:08,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1216 transitions. [2021-05-21 20:22:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,179 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,179 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-21 20:22:08,179 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1048980186, now seen corresponding path program 79 times [2021-05-21 20:22:08,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535783762] [2021-05-21 20:22:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,247 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:22:08,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535783762] [2021-05-21 20:22:08,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535783762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543157339] [2021-05-21 20:22:08,248 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,248 INFO L87 Difference]: Start difference. First operand 377 states and 1216 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,306 INFO L93 Difference]: Finished difference Result 796 states and 2387 transitions. [2021-05-21 20:22:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,308 INFO L225 Difference]: With dead ends: 796 [2021-05-21 20:22:08,308 INFO L226 Difference]: Without dead ends: 709 [2021-05-21 20:22:08,308 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-05-21 20:22:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 389. [2021-05-21 20:22:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.2268041237113403) internal successors, (1252), 388 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:22:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1252 transitions. [2021-05-21 20:22:08,315 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1252 transitions. Word has length 21 [2021-05-21 20:22:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,315 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1252 transitions. [2021-05-21 20:22:08,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1252 transitions. [2021-05-21 20:22:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,316 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,316 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-21 20:22:08,316 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1297089316, now seen corresponding path program 80 times [2021-05-21 20:22:08,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030488982] [2021-05-21 20:22:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,387 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:22:08,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030488982] [2021-05-21 20:22:08,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030488982] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325904339] [2021-05-21 20:22:08,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,389 INFO L87 Difference]: Start difference. First operand 389 states and 1252 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,425 INFO L93 Difference]: Finished difference Result 788 states and 2351 transitions. [2021-05-21 20:22:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,426 INFO L225 Difference]: With dead ends: 788 [2021-05-21 20:22:08,426 INFO L226 Difference]: Without dead ends: 701 [2021-05-21 20:22:08,426 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-05-21 20:22:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 381. [2021-05-21 20:22:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.231578947368421) internal successors, (1228), 380 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1228 transitions. [2021-05-21 20:22:08,433 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1228 transitions. Word has length 21 [2021-05-21 20:22:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,433 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1228 transitions. [2021-05-21 20:22:08,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1228 transitions. [2021-05-21 20:22:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,434 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,434 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-21 20:22:08,434 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1604768474, now seen corresponding path program 81 times [2021-05-21 20:22:08,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170827985] [2021-05-21 20:22:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,500 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:22:08,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170827985] [2021-05-21 20:22:08,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170827985] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709203629] [2021-05-21 20:22:08,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,501 INFO L87 Difference]: Start difference. First operand 381 states and 1228 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,554 INFO L93 Difference]: Finished difference Result 788 states and 2363 transitions. [2021-05-21 20:22:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,556 INFO L225 Difference]: With dead ends: 788 [2021-05-21 20:22:08,556 INFO L226 Difference]: Without dead ends: 701 [2021-05-21 20:22:08,556 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 75.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-05-21 20:22:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 393. [2021-05-21 20:22:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.2142857142857144) internal successors, (1260), 392 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:22:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1260 transitions. [2021-05-21 20:22:08,566 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1260 transitions. Word has length 21 [2021-05-21 20:22:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,566 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1260 transitions. [2021-05-21 20:22:08,567 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1260 transitions. [2021-05-21 20:22:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,568 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,569 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,569 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-21 20:22:08,569 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -569482052, now seen corresponding path program 82 times [2021-05-21 20:22:08,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815512259] [2021-05-21 20:22:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,642 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:22:08,643 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,643 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815512259] [2021-05-21 20:22:08,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815512259] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114420531] [2021-05-21 20:22:08,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,644 INFO L87 Difference]: Start difference. First operand 393 states and 1260 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,698 INFO L93 Difference]: Finished difference Result 728 states and 2202 transitions. [2021-05-21 20:22:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,699 INFO L225 Difference]: With dead ends: 728 [2021-05-21 20:22:08,699 INFO L226 Difference]: Without dead ends: 625 [2021-05-21 20:22:08,700 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-05-21 20:22:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 381. [2021-05-21 20:22:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.221052631578947) internal successors, (1224), 380 states have internal predecessors, (1224), 0 states have call successors, (0), 0 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:22:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1224 transitions. [2021-05-21 20:22:08,709 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1224 transitions. Word has length 21 [2021-05-21 20:22:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,710 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1224 transitions. [2021-05-21 20:22:08,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1224 transitions. [2021-05-21 20:22:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,711 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,711 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-05-21 20:22:08,711 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash -751892188, now seen corresponding path program 83 times [2021-05-21 20:22:08,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927260069] [2021-05-21 20:22:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,776 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:22:08,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927260069] [2021-05-21 20:22:08,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927260069] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978719135] [2021-05-21 20:22:08,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,777 INFO L87 Difference]: Start difference. First operand 381 states and 1224 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,812 INFO L93 Difference]: Finished difference Result 776 states and 2315 transitions. [2021-05-21 20:22:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,814 INFO L225 Difference]: With dead ends: 776 [2021-05-21 20:22:08,814 INFO L226 Difference]: Without dead ends: 697 [2021-05-21 20:22:08,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-05-21 20:22:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 389. [2021-05-21 20:22:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.2061855670103094) internal successors, (1244), 388 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:22:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1244 transitions. [2021-05-21 20:22:08,823 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1244 transitions. Word has length 21 [2021-05-21 20:22:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,823 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1244 transitions. [2021-05-21 20:22:08,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1244 transitions. [2021-05-21 20:22:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,824 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,824 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-21 20:22:08,825 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1995152774, now seen corresponding path program 84 times [2021-05-21 20:22:08,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23484215] [2021-05-21 20:22:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:08,894 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:22:08,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:08,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23484215] [2021-05-21 20:22:08,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23484215] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:08,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:08,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:08,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008704334] [2021-05-21 20:22:08,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:08,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:08,895 INFO L87 Difference]: Start difference. First operand 389 states and 1244 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:08,952 INFO L93 Difference]: Finished difference Result 724 states and 2186 transitions. [2021-05-21 20:22:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:08,954 INFO L225 Difference]: With dead ends: 724 [2021-05-21 20:22:08,954 INFO L226 Difference]: Without dead ends: 621 [2021-05-21 20:22:08,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-05-21 20:22:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 377. [2021-05-21 20:22:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.228723404255319) internal successors, (1214), 376 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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:22:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1214 transitions. [2021-05-21 20:22:08,961 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1214 transitions. Word has length 21 [2021-05-21 20:22:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:08,961 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1214 transitions. [2021-05-21 20:22:08,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1214 transitions. [2021-05-21 20:22:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:08,962 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:08,962 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:08,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-05-21 20:22:08,962 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2031327800, now seen corresponding path program 85 times [2021-05-21 20:22:08,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:08,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190548416] [2021-05-21 20:22:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,044 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:22:09,045 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190548416] [2021-05-21 20:22:09,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190548416] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952289530] [2021-05-21 20:22:09,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,046 INFO L87 Difference]: Start difference. First operand 377 states and 1214 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,109 INFO L93 Difference]: Finished difference Result 791 states and 2360 transitions. [2021-05-21 20:22:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,110 INFO L225 Difference]: With dead ends: 791 [2021-05-21 20:22:09,110 INFO L226 Difference]: Without dead ends: 704 [2021-05-21 20:22:09,110 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-05-21 20:22:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 377. [2021-05-21 20:22:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.1968085106382977) internal successors, (1202), 376 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:22:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1202 transitions. [2021-05-21 20:22:09,117 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1202 transitions. Word has length 21 [2021-05-21 20:22:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,117 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1202 transitions. [2021-05-21 20:22:09,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1202 transitions. [2021-05-21 20:22:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,117 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,118 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-21 20:22:09,118 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1172323610, now seen corresponding path program 86 times [2021-05-21 20:22:09,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544180114] [2021-05-21 20:22:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,194 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:22:09,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544180114] [2021-05-21 20:22:09,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544180114] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442344323] [2021-05-21 20:22:09,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,196 INFO L87 Difference]: Start difference. First operand 377 states and 1202 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,233 INFO L93 Difference]: Finished difference Result 814 states and 2415 transitions. [2021-05-21 20:22:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,234 INFO L225 Difference]: With dead ends: 814 [2021-05-21 20:22:09,235 INFO L226 Difference]: Without dead ends: 684 [2021-05-21 20:22:09,235 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-05-21 20:22:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 357. [2021-05-21 20:22:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.1797752808988764) internal successors, (1132), 356 states have internal predecessors, (1132), 0 states have call successors, (0), 0 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:22:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1132 transitions. [2021-05-21 20:22:09,243 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1132 transitions. Word has length 21 [2021-05-21 20:22:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,243 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1132 transitions. [2021-05-21 20:22:09,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1132 transitions. [2021-05-21 20:22:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,244 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,244 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-21 20:22:09,244 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1824519834, now seen corresponding path program 87 times [2021-05-21 20:22:09,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673934684] [2021-05-21 20:22:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,313 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:22:09,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673934684] [2021-05-21 20:22:09,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673934684] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115683175] [2021-05-21 20:22:09,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,314 INFO L87 Difference]: Start difference. First operand 357 states and 1132 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,361 INFO L93 Difference]: Finished difference Result 740 states and 2191 transitions. [2021-05-21 20:22:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,366 INFO L225 Difference]: With dead ends: 740 [2021-05-21 20:22:09,366 INFO L226 Difference]: Without dead ends: 653 [2021-05-21 20:22:09,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-05-21 20:22:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 369. [2021-05-21 20:22:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.1630434782608696) internal successors, (1164), 368 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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:22:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1164 transitions. [2021-05-21 20:22:09,372 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1164 transitions. Word has length 21 [2021-05-21 20:22:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,372 INFO L482 AbstractCegarLoop]: Abstraction has 369 states and 1164 transitions. [2021-05-21 20:22:09,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1164 transitions. [2021-05-21 20:22:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,373 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,373 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-21 20:22:09,373 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1416279014, now seen corresponding path program 88 times [2021-05-21 20:22:09,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973700324] [2021-05-21 20:22:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,437 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:22:09,437 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,437 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973700324] [2021-05-21 20:22:09,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973700324] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099860336] [2021-05-21 20:22:09,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,438 INFO L87 Difference]: Start difference. First operand 369 states and 1164 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,478 INFO L93 Difference]: Finished difference Result 680 states and 2030 transitions. [2021-05-21 20:22:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,479 INFO L225 Difference]: With dead ends: 680 [2021-05-21 20:22:09,479 INFO L226 Difference]: Without dead ends: 577 [2021-05-21 20:22:09,480 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-05-21 20:22:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 357. [2021-05-21 20:22:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.162921348314607) internal successors, (1126), 356 states have internal predecessors, (1126), 0 states have call successors, (0), 0 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:22:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1126 transitions. [2021-05-21 20:22:09,485 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1126 transitions. Word has length 21 [2021-05-21 20:22:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,485 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1126 transitions. [2021-05-21 20:22:09,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1126 transitions. [2021-05-21 20:22:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,486 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,486 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-05-21 20:22:09,486 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -928326020, now seen corresponding path program 89 times [2021-05-21 20:22:09,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854487178] [2021-05-21 20:22:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,565 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:22:09,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854487178] [2021-05-21 20:22:09,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854487178] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399979499] [2021-05-21 20:22:09,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,566 INFO L87 Difference]: Start difference. First operand 357 states and 1126 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,606 INFO L93 Difference]: Finished difference Result 773 states and 2287 transitions. [2021-05-21 20:22:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,607 INFO L225 Difference]: With dead ends: 773 [2021-05-21 20:22:09,607 INFO L226 Difference]: Without dead ends: 663 [2021-05-21 20:22:09,607 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-05-21 20:22:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 379. [2021-05-21 20:22:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.1296296296296298) internal successors, (1183), 378 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1183 transitions. [2021-05-21 20:22:09,616 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1183 transitions. Word has length 21 [2021-05-21 20:22:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,616 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1183 transitions. [2021-05-21 20:22:09,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1183 transitions. [2021-05-21 20:22:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,617 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,617 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,617 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-21 20:22:09,617 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -840389286, now seen corresponding path program 90 times [2021-05-21 20:22:09,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906531896] [2021-05-21 20:22:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,681 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:22:09,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906531896] [2021-05-21 20:22:09,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906531896] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491683145] [2021-05-21 20:22:09,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,682 INFO L87 Difference]: Start difference. First operand 379 states and 1183 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,734 INFO L93 Difference]: Finished difference Result 690 states and 2049 transitions. [2021-05-21 20:22:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,735 INFO L225 Difference]: With dead ends: 690 [2021-05-21 20:22:09,735 INFO L226 Difference]: Without dead ends: 567 [2021-05-21 20:22:09,735 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-05-21 20:22:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 347. [2021-05-21 20:22:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.1705202312138727) internal successors, (1097), 346 states have internal predecessors, (1097), 0 states have call successors, (0), 0 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:22:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1097 transitions. [2021-05-21 20:22:09,743 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1097 transitions. Word has length 21 [2021-05-21 20:22:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,743 INFO L482 AbstractCegarLoop]: Abstraction has 347 states and 1097 transitions. [2021-05-21 20:22:09,743 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1097 transitions. [2021-05-21 20:22:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,744 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,744 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-05-21 20:22:09,744 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash 456830594, now seen corresponding path program 91 times [2021-05-21 20:22:09,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68308969] [2021-05-21 20:22:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,816 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:22:09,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68308969] [2021-05-21 20:22:09,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68308969] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525550993] [2021-05-21 20:22:09,816 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,817 INFO L87 Difference]: Start difference. First operand 347 states and 1097 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,853 INFO L93 Difference]: Finished difference Result 686 states and 2000 transitions. [2021-05-21 20:22:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,855 INFO L225 Difference]: With dead ends: 686 [2021-05-21 20:22:09,855 INFO L226 Difference]: Without dead ends: 607 [2021-05-21 20:22:09,855 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-05-21 20:22:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 347. [2021-05-21 20:22:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.147398843930636) internal successors, (1089), 346 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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:22:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1089 transitions. [2021-05-21 20:22:09,863 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1089 transitions. Word has length 21 [2021-05-21 20:22:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,863 INFO L482 AbstractCegarLoop]: Abstraction has 347 states and 1089 transitions. [2021-05-21 20:22:09,863 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1089 transitions. [2021-05-21 20:22:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,864 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,864 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-21 20:22:09,864 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1133104156, now seen corresponding path program 92 times [2021-05-21 20:22:09,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557750999] [2021-05-21 20:22:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:09,940 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:22:09,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:09,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557750999] [2021-05-21 20:22:09,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557750999] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:09,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:09,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:09,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904332767] [2021-05-21 20:22:09,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:09,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:09,942 INFO L87 Difference]: Start difference. First operand 347 states and 1089 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:09,972 INFO L93 Difference]: Finished difference Result 717 states and 2087 transitions. [2021-05-21 20:22:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:09,973 INFO L225 Difference]: With dead ends: 717 [2021-05-21 20:22:09,973 INFO L226 Difference]: Without dead ends: 591 [2021-05-21 20:22:09,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-05-21 20:22:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 331. [2021-05-21 20:22:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 3.1303030303030304) internal successors, (1033), 330 states have internal predecessors, (1033), 0 states have call successors, (0), 0 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:22:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1033 transitions. [2021-05-21 20:22:09,981 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1033 transitions. Word has length 21 [2021-05-21 20:22:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:09,981 INFO L482 AbstractCegarLoop]: Abstraction has 331 states and 1033 transitions. [2021-05-21 20:22:09,981 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1033 transitions. [2021-05-21 20:22:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:09,982 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:09,982 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:09,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-05-21 20:22:09,982 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash 250022628, now seen corresponding path program 93 times [2021-05-21 20:22:09,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:09,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081707560] [2021-05-21 20:22:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,054 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:22:10,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081707560] [2021-05-21 20:22:10,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081707560] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261214654] [2021-05-21 20:22:10,055 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,055 INFO L87 Difference]: Start difference. First operand 331 states and 1033 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,094 INFO L93 Difference]: Finished difference Result 690 states and 2004 transitions. [2021-05-21 20:22:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,096 INFO L225 Difference]: With dead ends: 690 [2021-05-21 20:22:10,096 INFO L226 Difference]: Without dead ends: 611 [2021-05-21 20:22:10,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-05-21 20:22:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 339. [2021-05-21 20:22:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.1153846153846154) internal successors, (1053), 338 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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:22:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1053 transitions. [2021-05-21 20:22:10,104 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1053 transitions. Word has length 21 [2021-05-21 20:22:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,104 INFO L482 AbstractCegarLoop]: Abstraction has 339 states and 1053 transitions. [2021-05-21 20:22:10,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1053 transitions. [2021-05-21 20:22:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,107 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,107 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-21 20:22:10,107 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1930519268, now seen corresponding path program 94 times [2021-05-21 20:22:10,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021755895] [2021-05-21 20:22:10,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,169 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:22:10,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021755895] [2021-05-21 20:22:10,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021755895] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,170 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,170 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859248578] [2021-05-21 20:22:10,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,170 INFO L87 Difference]: Start difference. First operand 339 states and 1053 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,216 INFO L93 Difference]: Finished difference Result 638 states and 1875 transitions. [2021-05-21 20:22:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,218 INFO L225 Difference]: With dead ends: 638 [2021-05-21 20:22:10,218 INFO L226 Difference]: Without dead ends: 539 [2021-05-21 20:22:10,218 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-05-21 20:22:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 331. [2021-05-21 20:22:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 3.118181818181818) internal successors, (1029), 330 states have internal predecessors, (1029), 0 states have call successors, (0), 0 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:22:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1029 transitions. [2021-05-21 20:22:10,236 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1029 transitions. Word has length 21 [2021-05-21 20:22:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,236 INFO L482 AbstractCegarLoop]: Abstraction has 331 states and 1029 transitions. [2021-05-21 20:22:10,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1029 transitions. [2021-05-21 20:22:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,237 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,237 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,237 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-05-21 20:22:10,237 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1667184582, now seen corresponding path program 95 times [2021-05-21 20:22:10,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541317350] [2021-05-21 20:22:10,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,302 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:22:10,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541317350] [2021-05-21 20:22:10,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541317350] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412838874] [2021-05-21 20:22:10,303 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,304 INFO L87 Difference]: Start difference. First operand 331 states and 1029 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,338 INFO L93 Difference]: Finished difference Result 666 states and 1924 transitions. [2021-05-21 20:22:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,340 INFO L225 Difference]: With dead ends: 666 [2021-05-21 20:22:10,340 INFO L226 Difference]: Without dead ends: 556 [2021-05-21 20:22:10,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-05-21 20:22:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 284. [2021-05-21 20:22:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.0530035335689045) internal successors, (864), 283 states have internal predecessors, (864), 0 states have call successors, (0), 0 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:22:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 864 transitions. [2021-05-21 20:22:10,346 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 864 transitions. Word has length 21 [2021-05-21 20:22:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,346 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 864 transitions. [2021-05-21 20:22:10,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 864 transitions. [2021-05-21 20:22:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,347 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,347 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-21 20:22:10,347 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash 275040036, now seen corresponding path program 96 times [2021-05-21 20:22:10,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128057992] [2021-05-21 20:22:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,411 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:22:10,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128057992] [2021-05-21 20:22:10,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128057992] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151851645] [2021-05-21 20:22:10,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,413 INFO L87 Difference]: Start difference. First operand 284 states and 864 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,460 INFO L93 Difference]: Finished difference Result 583 states and 1686 transitions. [2021-05-21 20:22:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,461 INFO L225 Difference]: With dead ends: 583 [2021-05-21 20:22:10,461 INFO L226 Difference]: Without dead ends: 458 [2021-05-21 20:22:10,461 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-05-21 20:22:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 250. [2021-05-21 20:22:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.1204819277108435) internal successors, (777), 249 states have internal predecessors, (777), 0 states have call successors, (0), 0 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:22:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 777 transitions. [2021-05-21 20:22:10,467 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 777 transitions. Word has length 21 [2021-05-21 20:22:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,467 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 777 transitions. [2021-05-21 20:22:10,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 777 transitions. [2021-05-21 20:22:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,467 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,467 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-05-21 20:22:10,468 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash 988259000, now seen corresponding path program 97 times [2021-05-21 20:22:10,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911713673] [2021-05-21 20:22:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,535 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:22:10,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911713673] [2021-05-21 20:22:10,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911713673] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,535 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600004964] [2021-05-21 20:22:10,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,537 INFO L87 Difference]: Start difference. First operand 250 states and 777 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,585 INFO L93 Difference]: Finished difference Result 513 states and 1487 transitions. [2021-05-21 20:22:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,587 INFO L225 Difference]: With dead ends: 513 [2021-05-21 20:22:10,587 INFO L226 Difference]: Without dead ends: 426 [2021-05-21 20:22:10,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-05-21 20:22:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 258. [2021-05-21 20:22:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.1011673151750974) internal successors, (797), 257 states have internal predecessors, (797), 0 states have call successors, (0), 0 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:22:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 797 transitions. [2021-05-21 20:22:10,593 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 797 transitions. Word has length 21 [2021-05-21 20:22:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,593 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 797 transitions. [2021-05-21 20:22:10,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 797 transitions. [2021-05-21 20:22:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,595 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,595 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-21 20:22:10,596 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1236368130, now seen corresponding path program 98 times [2021-05-21 20:22:10,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748296234] [2021-05-21 20:22:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,662 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:22:10,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748296234] [2021-05-21 20:22:10,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748296234] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574592077] [2021-05-21 20:22:10,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,664 INFO L87 Difference]: Start difference. First operand 258 states and 797 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,699 INFO L93 Difference]: Finished difference Result 505 states and 1451 transitions. [2021-05-21 20:22:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,700 INFO L225 Difference]: With dead ends: 505 [2021-05-21 20:22:10,700 INFO L226 Difference]: Without dead ends: 418 [2021-05-21 20:22:10,700 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 68.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-05-21 20:22:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 250. [2021-05-21 20:22:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.104417670682731) internal successors, (773), 249 states have internal predecessors, (773), 0 states have call successors, (0), 0 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:22:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 773 transitions. [2021-05-21 20:22:10,706 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 773 transitions. Word has length 21 [2021-05-21 20:22:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,707 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 773 transitions. [2021-05-21 20:22:10,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 773 transitions. [2021-05-21 20:22:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,707 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,707 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-21 20:22:10,707 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2114241864, now seen corresponding path program 99 times [2021-05-21 20:22:10,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768946440] [2021-05-21 20:22:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,776 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:22:10,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768946440] [2021-05-21 20:22:10,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768946440] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234644372] [2021-05-21 20:22:10,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,777 INFO L87 Difference]: Start difference. First operand 250 states and 773 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,821 INFO L93 Difference]: Finished difference Result 531 states and 1544 transitions. [2021-05-21 20:22:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,822 INFO L225 Difference]: With dead ends: 531 [2021-05-21 20:22:10,822 INFO L226 Difference]: Without dead ends: 444 [2021-05-21 20:22:10,822 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 78.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-05-21 20:22:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 262. [2021-05-21 20:22:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0842911877394634) internal successors, (805), 261 states have internal predecessors, (805), 0 states have call successors, (0), 0 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:22:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 805 transitions. [2021-05-21 20:22:10,829 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 805 transitions. Word has length 21 [2021-05-21 20:22:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,829 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 805 transitions. [2021-05-21 20:22:10,829 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 805 transitions. [2021-05-21 20:22:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,830 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,830 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-21 20:22:10,830 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 664098074, now seen corresponding path program 100 times [2021-05-21 20:22:10,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142243275] [2021-05-21 20:22:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:10,891 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:22:10,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:10,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142243275] [2021-05-21 20:22:10,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142243275] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:10,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:10,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:10,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950034613] [2021-05-21 20:22:10,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:10,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:10,892 INFO L87 Difference]: Start difference. First operand 262 states and 805 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:10,939 INFO L93 Difference]: Finished difference Result 537 states and 1549 transitions. [2021-05-21 20:22:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:10,940 INFO L225 Difference]: With dead ends: 537 [2021-05-21 20:22:10,940 INFO L226 Difference]: Without dead ends: 432 [2021-05-21 20:22:10,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-05-21 20:22:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 250. [2021-05-21 20:22:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0883534136546187) internal successors, (769), 249 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 769 transitions. [2021-05-21 20:22:10,944 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 769 transitions. Word has length 21 [2021-05-21 20:22:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:10,944 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 769 transitions. [2021-05-21 20:22:10,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 769 transitions. [2021-05-21 20:22:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:10,945 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:10,945 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:10,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-05-21 20:22:10,945 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:10,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash -175935230, now seen corresponding path program 101 times [2021-05-21 20:22:10,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:10,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806521496] [2021-05-21 20:22:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,015 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:22:11,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806521496] [2021-05-21 20:22:11,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806521496] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484650962] [2021-05-21 20:22:11,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,017 INFO L87 Difference]: Start difference. First operand 250 states and 769 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,047 INFO L93 Difference]: Finished difference Result 511 states and 1468 transitions. [2021-05-21 20:22:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,048 INFO L225 Difference]: With dead ends: 511 [2021-05-21 20:22:11,048 INFO L226 Difference]: Without dead ends: 432 [2021-05-21 20:22:11,048 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-05-21 20:22:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 258. [2021-05-21 20:22:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.0700389105058368) internal successors, (789), 257 states have internal predecessors, (789), 0 states have call successors, (0), 0 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:22:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 789 transitions. [2021-05-21 20:22:11,052 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 789 transitions. Word has length 21 [2021-05-21 20:22:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,052 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 789 transitions. [2021-05-21 20:22:11,052 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 789 transitions. [2021-05-21 20:22:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,052 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,052 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-21 20:22:11,052 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1744863772, now seen corresponding path program 102 times [2021-05-21 20:22:11,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988807721] [2021-05-21 20:22:11,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,121 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:22:11,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988807721] [2021-05-21 20:22:11,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988807721] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452679924] [2021-05-21 20:22:11,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,122 INFO L87 Difference]: Start difference. First operand 258 states and 789 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,173 INFO L93 Difference]: Finished difference Result 525 states and 1505 transitions. [2021-05-21 20:22:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,174 INFO L225 Difference]: With dead ends: 525 [2021-05-21 20:22:11,174 INFO L226 Difference]: Without dead ends: 420 [2021-05-21 20:22:11,174 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-05-21 20:22:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 246. [2021-05-21 20:22:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0979591836734692) internal successors, (759), 245 states have internal predecessors, (759), 0 states have call successors, (0), 0 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:22:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 759 transitions. [2021-05-21 20:22:11,180 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 759 transitions. Word has length 21 [2021-05-21 20:22:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,180 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 759 transitions. [2021-05-21 20:22:11,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 759 transitions. [2021-05-21 20:22:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,180 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,180 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-05-21 20:22:11,181 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 507356954, now seen corresponding path program 103 times [2021-05-21 20:22:11,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202136706] [2021-05-21 20:22:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,244 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:22:11,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202136706] [2021-05-21 20:22:11,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202136706] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888902891] [2021-05-21 20:22:11,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,245 INFO L87 Difference]: Start difference. First operand 246 states and 759 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,288 INFO L93 Difference]: Finished difference Result 501 states and 1441 transitions. [2021-05-21 20:22:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,289 INFO L225 Difference]: With dead ends: 501 [2021-05-21 20:22:11,289 INFO L226 Difference]: Without dead ends: 414 [2021-05-21 20:22:11,289 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-05-21 20:22:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 246. [2021-05-21 20:22:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0653061224489795) internal successors, (751), 245 states have internal predecessors, (751), 0 states have call successors, (0), 0 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:22:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 751 transitions. [2021-05-21 20:22:11,293 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 751 transitions. Word has length 21 [2021-05-21 20:22:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,293 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 751 transitions. [2021-05-21 20:22:11,293 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 751 transitions. [2021-05-21 20:22:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,293 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,293 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,293 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-21 20:22:11,293 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 755466084, now seen corresponding path program 104 times [2021-05-21 20:22:11,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022637681] [2021-05-21 20:22:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,358 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:22:11,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022637681] [2021-05-21 20:22:11,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022637681] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625445750] [2021-05-21 20:22:11,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,360 INFO L87 Difference]: Start difference. First operand 246 states and 751 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,408 INFO L93 Difference]: Finished difference Result 493 states and 1405 transitions. [2021-05-21 20:22:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,409 INFO L225 Difference]: With dead ends: 493 [2021-05-21 20:22:11,410 INFO L226 Difference]: Without dead ends: 406 [2021-05-21 20:22:11,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-05-21 20:22:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 238. [2021-05-21 20:22:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 3.067510548523207) internal successors, (727), 237 states have internal predecessors, (727), 0 states have call successors, (0), 0 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:22:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 727 transitions. [2021-05-21 20:22:11,415 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 727 transitions. Word has length 21 [2021-05-21 20:22:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,415 INFO L482 AbstractCegarLoop]: Abstraction has 238 states and 727 transitions. [2021-05-21 20:22:11,415 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 727 transitions. [2021-05-21 20:22:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,415 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,415 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-05-21 20:22:11,415 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,416 INFO L82 PathProgramCache]: Analyzing trace with hash -418293064, now seen corresponding path program 105 times [2021-05-21 20:22:11,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979082247] [2021-05-21 20:22:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,481 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:22:11,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979082247] [2021-05-21 20:22:11,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979082247] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611975277] [2021-05-21 20:22:11,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,482 INFO L87 Difference]: Start difference. First operand 238 states and 727 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,529 INFO L93 Difference]: Finished difference Result 493 states and 1417 transitions. [2021-05-21 20:22:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,530 INFO L225 Difference]: With dead ends: 493 [2021-05-21 20:22:11,530 INFO L226 Difference]: Without dead ends: 406 [2021-05-21 20:22:11,530 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-05-21 20:22:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 250. [2021-05-21 20:22:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0481927710843375) internal successors, (759), 249 states have internal predecessors, (759), 0 states have call successors, (0), 0 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:22:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 759 transitions. [2021-05-21 20:22:11,536 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 759 transitions. Word has length 21 [2021-05-21 20:22:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,536 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 759 transitions. [2021-05-21 20:22:11,536 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 759 transitions. [2021-05-21 20:22:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,536 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,536 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-21 20:22:11,537 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1702423706, now seen corresponding path program 106 times [2021-05-21 20:22:11,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622452144] [2021-05-21 20:22:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,607 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:22:11,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622452144] [2021-05-21 20:22:11,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622452144] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856275362] [2021-05-21 20:22:11,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,608 INFO L87 Difference]: Start difference. First operand 250 states and 759 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,658 INFO L93 Difference]: Finished difference Result 433 states and 1256 transitions. [2021-05-21 20:22:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,659 INFO L225 Difference]: With dead ends: 433 [2021-05-21 20:22:11,659 INFO L226 Difference]: Without dead ends: 330 [2021-05-21 20:22:11,659 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-05-21 20:22:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 238. [2021-05-21 20:22:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 3.050632911392405) internal successors, (723), 237 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:22:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 723 transitions. [2021-05-21 20:22:11,664 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 723 transitions. Word has length 21 [2021-05-21 20:22:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,664 INFO L482 AbstractCegarLoop]: Abstraction has 238 states and 723 transitions. [2021-05-21 20:22:11,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 723 transitions. [2021-05-21 20:22:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,664 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,664 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-05-21 20:22:11,664 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1520013570, now seen corresponding path program 107 times [2021-05-21 20:22:11,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283050543] [2021-05-21 20:22:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,730 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:22:11,731 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283050543] [2021-05-21 20:22:11,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283050543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6569737] [2021-05-21 20:22:11,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,731 INFO L87 Difference]: Start difference. First operand 238 states and 723 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,764 INFO L93 Difference]: Finished difference Result 481 states and 1369 transitions. [2021-05-21 20:22:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,765 INFO L225 Difference]: With dead ends: 481 [2021-05-21 20:22:11,765 INFO L226 Difference]: Without dead ends: 402 [2021-05-21 20:22:11,765 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-05-21 20:22:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 246. [2021-05-21 20:22:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0326530612244897) internal successors, (743), 245 states have internal predecessors, (743), 0 states have call successors, (0), 0 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:22:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 743 transitions. [2021-05-21 20:22:11,770 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 743 transitions. Word has length 21 [2021-05-21 20:22:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,770 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 743 transitions. [2021-05-21 20:22:11,770 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 743 transitions. [2021-05-21 20:22:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,771 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,771 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,771 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-21 20:22:11,771 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash -27908764, now seen corresponding path program 108 times [2021-05-21 20:22:11,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678010848] [2021-05-21 20:22:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,838 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:22:11,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678010848] [2021-05-21 20:22:11,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678010848] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959463505] [2021-05-21 20:22:11,839 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,839 INFO L87 Difference]: Start difference. First operand 246 states and 743 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:11,888 INFO L93 Difference]: Finished difference Result 429 states and 1240 transitions. [2021-05-21 20:22:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:11,889 INFO L225 Difference]: With dead ends: 429 [2021-05-21 20:22:11,889 INFO L226 Difference]: Without dead ends: 326 [2021-05-21 20:22:11,890 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-05-21 20:22:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 234. [2021-05-21 20:22:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.060085836909871) internal successors, (713), 233 states have internal predecessors, (713), 0 states have call successors, (0), 0 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:22:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 713 transitions. [2021-05-21 20:22:11,894 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 713 transitions. Word has length 21 [2021-05-21 20:22:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:11,894 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 713 transitions. [2021-05-21 20:22:11,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 713 transitions. [2021-05-21 20:22:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:11,895 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:11,895 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:11,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-05-21 20:22:11,895 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -577641800, now seen corresponding path program 109 times [2021-05-21 20:22:11,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:11,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149648561] [2021-05-21 20:22:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:11,963 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:22:11,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:11,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149648561] [2021-05-21 20:22:11,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149648561] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:11,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:11,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:11,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622101072] [2021-05-21 20:22:11,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:11,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:11,964 INFO L87 Difference]: Start difference. First operand 234 states and 713 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,003 INFO L93 Difference]: Finished difference Result 479 states and 1364 transitions. [2021-05-21 20:22:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,004 INFO L225 Difference]: With dead ends: 479 [2021-05-21 20:22:12,004 INFO L226 Difference]: Without dead ends: 392 [2021-05-21 20:22:12,005 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-05-21 20:22:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 234. [2021-05-21 20:22:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.0085836909871246) internal successors, (701), 233 states have internal predecessors, (701), 0 states have call successors, (0), 0 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:22:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 701 transitions. [2021-05-21 20:22:12,008 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 701 transitions. Word has length 21 [2021-05-21 20:22:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,008 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 701 transitions. [2021-05-21 20:22:12,008 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 701 transitions. [2021-05-21 20:22:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,008 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,008 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-05-21 20:22:12,009 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2094269158, now seen corresponding path program 110 times [2021-05-21 20:22:12,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222492705] [2021-05-21 20:22:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:12,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222492705] [2021-05-21 20:22:12,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222492705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299792760] [2021-05-21 20:22:12,067 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,068 INFO L87 Difference]: Start difference. First operand 234 states and 701 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,107 INFO L93 Difference]: Finished difference Result 485 states and 1369 transitions. [2021-05-21 20:22:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,108 INFO L225 Difference]: With dead ends: 485 [2021-05-21 20:22:12,108 INFO L226 Difference]: Without dead ends: 380 [2021-05-21 20:22:12,108 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-05-21 20:22:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 222. [2021-05-21 20:22:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 3.0) internal successors, (663), 221 states have internal predecessors, (663), 0 states have call successors, (0), 0 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:22:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 663 transitions. [2021-05-21 20:22:12,112 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 663 transitions. Word has length 21 [2021-05-21 20:22:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,112 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 663 transitions. [2021-05-21 20:22:12,112 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 663 transitions. [2021-05-21 20:22:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,112 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,112 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-05-21 20:22:12,112 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 503420826, now seen corresponding path program 111 times [2021-05-21 20:22:12,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158018473] [2021-05-21 20:22:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,183 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:22:12,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158018473] [2021-05-21 20:22:12,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158018473] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081758019] [2021-05-21 20:22:12,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,184 INFO L87 Difference]: Start difference. First operand 222 states and 663 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,229 INFO L93 Difference]: Finished difference Result 441 states and 1233 transitions. [2021-05-21 20:22:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,230 INFO L225 Difference]: With dead ends: 441 [2021-05-21 20:22:12,230 INFO L226 Difference]: Without dead ends: 354 [2021-05-21 20:22:12,230 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-05-21 20:22:12,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 198. [2021-05-21 20:22:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.918781725888325) internal successors, (575), 197 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:22:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 575 transitions. [2021-05-21 20:22:12,234 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 575 transitions. Word has length 21 [2021-05-21 20:22:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,234 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 575 transitions. [2021-05-21 20:22:12,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 575 transitions. [2021-05-21 20:22:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,235 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,235 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-21 20:22:12,235 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash 906396826, now seen corresponding path program 112 times [2021-05-21 20:22:12,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686759546] [2021-05-21 20:22:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,297 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:22:12,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686759546] [2021-05-21 20:22:12,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686759546] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208534311] [2021-05-21 20:22:12,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,298 INFO L87 Difference]: Start difference. First operand 198 states and 575 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,342 INFO L93 Difference]: Finished difference Result 381 states and 1072 transitions. [2021-05-21 20:22:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,343 INFO L225 Difference]: With dead ends: 381 [2021-05-21 20:22:12,343 INFO L226 Difference]: Without dead ends: 278 [2021-05-21 20:22:12,343 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-05-21 20:22:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 186. [2021-05-21 20:22:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.902702702702703) internal successors, (537), 185 states have internal predecessors, (537), 0 states have call successors, (0), 0 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:22:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 537 transitions. [2021-05-21 20:22:12,347 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 537 transitions. Word has length 21 [2021-05-21 20:22:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,347 INFO L482 AbstractCegarLoop]: Abstraction has 186 states and 537 transitions. [2021-05-21 20:22:12,347 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 537 transitions. [2021-05-21 20:22:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,348 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,348 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-05-21 20:22:12,348 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 100048508, now seen corresponding path program 113 times [2021-05-21 20:22:12,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438111476] [2021-05-21 20:22:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,412 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:22:12,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438111476] [2021-05-21 20:22:12,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438111476] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,412 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,412 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699254468] [2021-05-21 20:22:12,412 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,413 INFO L87 Difference]: Start difference. First operand 186 states and 537 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,458 INFO L93 Difference]: Finished difference Result 385 states and 1090 transitions. [2021-05-21 20:22:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,459 INFO L225 Difference]: With dead ends: 385 [2021-05-21 20:22:12,459 INFO L226 Difference]: Without dead ends: 292 [2021-05-21 20:22:12,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-21 20:22:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 200. [2021-05-21 20:22:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.8844221105527637) internal successors, (574), 199 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:22:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 574 transitions. [2021-05-21 20:22:12,462 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 574 transitions. Word has length 21 [2021-05-21 20:22:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,462 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 574 transitions. [2021-05-21 20:22:12,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 574 transitions. [2021-05-21 20:22:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,462 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,462 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-21 20:22:12,462 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash -228334374, now seen corresponding path program 114 times [2021-05-21 20:22:12,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683860827] [2021-05-21 20:22:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,533 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:22:12,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683860827] [2021-05-21 20:22:12,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683860827] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910318839] [2021-05-21 20:22:12,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,535 INFO L87 Difference]: Start difference. First operand 200 states and 574 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,601 INFO L93 Difference]: Finished difference Result 291 states and 822 transitions. [2021-05-21 20:22:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,602 INFO L225 Difference]: With dead ends: 291 [2021-05-21 20:22:12,602 INFO L226 Difference]: Without dead ends: 180 [2021-05-21 20:22:12,602 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-05-21 20:22:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-05-21 20:22:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.916201117318436) internal successors, (522), 179 states have internal predecessors, (522), 0 states have call successors, (0), 0 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:22:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2021-05-21 20:22:12,606 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 21 [2021-05-21 20:22:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,606 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2021-05-21 20:22:12,606 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2021-05-21 20:22:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,607 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,607 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-05-21 20:22:12,607 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2142828290, now seen corresponding path program 115 times [2021-05-21 20:22:12,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10946341] [2021-05-21 20:22:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,693 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:22:12,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10946341] [2021-05-21 20:22:12,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10946341] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,694 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,694 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335699235] [2021-05-21 20:22:12,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,694 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,724 INFO L93 Difference]: Finished difference Result 323 states and 891 transitions. [2021-05-21 20:22:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,724 INFO L225 Difference]: With dead ends: 323 [2021-05-21 20:22:12,724 INFO L226 Difference]: Without dead ends: 244 [2021-05-21 20:22:12,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 81.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-05-21 20:22:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 180. [2021-05-21 20:22:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.8715083798882683) internal successors, (514), 179 states have internal predecessors, (514), 0 states have call successors, (0), 0 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:22:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 514 transitions. [2021-05-21 20:22:12,727 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 514 transitions. Word has length 21 [2021-05-21 20:22:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,727 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 514 transitions. [2021-05-21 20:22:12,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 514 transitions. [2021-05-21 20:22:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,728 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,728 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-05-21 20:22:12,728 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash 573899748, now seen corresponding path program 116 times [2021-05-21 20:22:12,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237325999] [2021-05-21 20:22:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,814 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:22:12,814 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237325999] [2021-05-21 20:22:12,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237325999] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82424651] [2021-05-21 20:22:12,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,815 INFO L87 Difference]: Start difference. First operand 180 states and 514 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,857 INFO L93 Difference]: Finished difference Result 337 states and 928 transitions. [2021-05-21 20:22:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,857 INFO L225 Difference]: With dead ends: 337 [2021-05-21 20:22:12,857 INFO L226 Difference]: Without dead ends: 236 [2021-05-21 20:22:12,858 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 95.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-05-21 20:22:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 172. [2021-05-21 20:22:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.865497076023392) internal successors, (490), 171 states have internal predecessors, (490), 0 states have call successors, (0), 0 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:22:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 490 transitions. [2021-05-21 20:22:12,860 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 490 transitions. Word has length 21 [2021-05-21 20:22:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,860 INFO L482 AbstractCegarLoop]: Abstraction has 172 states and 490 transitions. [2021-05-21 20:22:12,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 490 transitions. [2021-05-21 20:22:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,861 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,861 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-05-21 20:22:12,861 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1071076380, now seen corresponding path program 117 times [2021-05-21 20:22:12,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575782424] [2021-05-21 20:22:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:12,922 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:22:12,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:12,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575782424] [2021-05-21 20:22:12,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575782424] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:12,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:12,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:12,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133965293] [2021-05-21 20:22:12,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:12,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:12,924 INFO L87 Difference]: Start difference. First operand 172 states and 490 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:12,950 INFO L93 Difference]: Finished difference Result 299 states and 811 transitions. [2021-05-21 20:22:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:12,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:12,951 INFO L225 Difference]: With dead ends: 299 [2021-05-21 20:22:12,951 INFO L226 Difference]: Without dead ends: 220 [2021-05-21 20:22:12,951 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-21 20:22:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 156. [2021-05-21 20:22:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.8) internal successors, (434), 155 states have internal predecessors, (434), 0 states have call successors, (0), 0 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:22:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 434 transitions. [2021-05-21 20:22:12,954 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 434 transitions. Word has length 21 [2021-05-21 20:22:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:12,954 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 434 transitions. [2021-05-21 20:22:12,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 434 transitions. [2021-05-21 20:22:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:12,954 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:12,954 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:12,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-21 20:22:12,954 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -41772188, now seen corresponding path program 118 times [2021-05-21 20:22:12,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:12,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955387679] [2021-05-21 20:22:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:22:13,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:13,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955387679] [2021-05-21 20:22:13,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955387679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:13,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:13,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:13,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45969411] [2021-05-21 20:22:13,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:13,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:13,026 INFO L87 Difference]: Start difference. First operand 156 states and 434 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:13,071 INFO L93 Difference]: Finished difference Result 247 states and 682 transitions. [2021-05-21 20:22:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:13,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:13,072 INFO L225 Difference]: With dead ends: 247 [2021-05-21 20:22:13,072 INFO L226 Difference]: Without dead ends: 148 [2021-05-21 20:22:13,072 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-21 20:22:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-05-21 20:22:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.7891156462585034) internal successors, (410), 147 states have internal predecessors, (410), 0 states have call successors, (0), 0 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:22:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 410 transitions. [2021-05-21 20:22:13,074 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 410 transitions. Word has length 21 [2021-05-21 20:22:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:13,075 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 410 transitions. [2021-05-21 20:22:13,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 410 transitions. [2021-05-21 20:22:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:13,075 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:13,075 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:13,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-05-21 20:22:13,075 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:13,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:13,075 INFO L82 PathProgramCache]: Analyzing trace with hash -920778810, now seen corresponding path program 119 times [2021-05-21 20:22:13,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:13,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060857337] [2021-05-21 20:22:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:13,145 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:22:13,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:13,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060857337] [2021-05-21 20:22:13,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060857337] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:13,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:13,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:13,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784704681] [2021-05-21 20:22:13,146 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:13,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:13,146 INFO L87 Difference]: Start difference. First operand 148 states and 410 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:13,201 INFO L93 Difference]: Finished difference Result 211 states and 570 transitions. [2021-05-21 20:22:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:13,202 INFO L225 Difference]: With dead ends: 211 [2021-05-21 20:22:13,202 INFO L226 Difference]: Without dead ends: 118 [2021-05-21 20:22:13,202 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 99.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-05-21 20:22:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-05-21 20:22:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.58974358974359) internal successors, (303), 117 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:22:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 303 transitions. [2021-05-21 20:22:13,204 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 303 transitions. Word has length 21 [2021-05-21 20:22:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:13,204 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 303 transitions. [2021-05-21 20:22:13,204 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 303 transitions. [2021-05-21 20:22:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-21 20:22:13,204 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:22:13,204 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:22:13,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-21 20:22:13,205 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-05-21 20:22:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:22:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1330851492, now seen corresponding path program 120 times [2021-05-21 20:22:13,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:22:13,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738291448] [2021-05-21 20:22:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:22:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:22:13,271 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:22:13,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:22:13,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738291448] [2021-05-21 20:22:13,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738291448] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:22:13,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:22:13,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:22:13,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532177122] [2021-05-21 20:22:13,271 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:22:13,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:22:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:22:13,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:22:13,272 INFO L87 Difference]: Start difference. First operand 118 states and 303 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:22:13,309 INFO L93 Difference]: Finished difference Result 117 states and 302 transitions. [2021-05-21 20:22:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-21 20:22:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-05-21 20:22:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:22:13,309 INFO L225 Difference]: With dead ends: 117 [2021-05-21 20:22:13,309 INFO L226 Difference]: Without dead ends: 0 [2021-05-21 20:22:13,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:22:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-21 20:22:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-21 20:22:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:22:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-21 20:22:13,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-05-21 20:22:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:22:13,310 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-21 20:22:13,310 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:22:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-21 20:22:13,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-21 20:22:13,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-05-21 20:22:13,312 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-21 20:22:13,315 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.05 08:22:13 BasicIcfg [2021-05-21 20:22:13,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-21 20:22:13,316 INFO L168 Benchmark]: Toolchain (without parser) took 18643.93 ms. Allocated memory was 341.8 MB in the beginning and 654.3 MB in the end (delta: 312.5 MB). Free memory was 321.7 MB in the beginning and 452.5 MB in the end (delta: -130.8 MB). Peak memory consumption was 184.7 MB. Max. memory is 16.0 GB. [2021-05-21 20:22:13,316 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 341.8 MB. Free memory was 322.7 MB in the beginning and 322.6 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:22:13,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.45 ms. Allocated memory is still 341.8 MB. Free memory was 321.6 MB in the beginning and 320.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:22:13,316 INFO L168 Benchmark]: Boogie Preprocessor took 11.27 ms. Allocated memory is still 341.8 MB. Free memory was 320.1 MB in the beginning and 319.2 MB in the end (delta: 873.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:22:13,316 INFO L168 Benchmark]: RCFGBuilder took 230.69 ms. Allocated memory is still 341.8 MB. Free memory was 319.1 MB in the beginning and 309.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-05-21 20:22:13,316 INFO L168 Benchmark]: TraceAbstraction took 18367.38 ms. Allocated memory was 341.8 MB in the beginning and 654.3 MB in the end (delta: 312.5 MB). Free memory was 308.6 MB in the beginning and 452.5 MB in the end (delta: -143.9 MB). Peak memory consumption was 170.0 MB. Max. memory is 16.0 GB. [2021-05-21 20:22:13,317 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 341.8 MB. Free memory was 322.7 MB in the beginning and 322.6 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.45 ms. Allocated memory is still 341.8 MB. Free memory was 321.6 MB in the beginning and 320.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 11.27 ms. Allocated memory is still 341.8 MB. Free memory was 320.1 MB in the beginning and 319.2 MB in the end (delta: 873.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 230.69 ms. Allocated memory is still 341.8 MB. Free memory was 319.1 MB in the beginning and 309.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18367.38 ms. Allocated memory was 341.8 MB in the beginning and 654.3 MB in the end (delta: 312.5 MB). Free memory was 308.6 MB in the beginning and 452.5 MB in the end (delta: -143.9 MB). Peak memory consumption was 170.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18187.2ms, OverallIterations: 124, TraceHistogramMax: 1, EmptinessCheckTime: 185.4ms, AutomataDifference: 6364.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 107.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7201 SDtfs, 9019 SDslu, 13152 SDs, 0 SdLazy, 2710 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1824.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 9932.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=0, InterpolantAutomatonStates: 852, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1598.8ms AutomataMinimizationTime, 124 MinimizatonAttempts, 38456 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 55.3ms SsaConstructionTime, 136.3ms SatisfiabilityAnalysisTime, 9183.2ms InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 2480 ConstructedInterpolants, 0 QuantifiedInterpolants, 48111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 124 InterpolantComputations, 124 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...