/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_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 20:21:47,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 20:21:47,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 20:21:47,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 20:21:47,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 20:21:47,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 20:21:47,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 20:21:47,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 20:21:47,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 20:21:47,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 20:21:47,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 20:21:47,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 20:21:47,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 20:21:47,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 20:21:47,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 20:21:47,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 20:21:47,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 20:21:47,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 20:21:47,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 20:21:47,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 20:21:47,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 20:21:47,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 20:21:47,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 20:21:47,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 20:21:47,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 20:21:47,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 20:21:47,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 20:21:47,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 20:21:47,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 20:21:47,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 20:21:47,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 20:21:47,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 20:21:47,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 20:21:47,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 20:21:47,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 20:21:47,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 20:21:47,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 20:21:47,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 20:21:47,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 20:21:47,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 20:21:47,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 20:21:47,507 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:47,544 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 20:21:47,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 20:21:47,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 20:21:47,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 20:21:47,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 20:21:47,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 20:21:47,547 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 20:21:47,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 20:21:47,548 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 20:21:47,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 20:21:47,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 20:21:47,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 20:21:47,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 20:21:47,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 20:21:47,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 20:21:47,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 20:21:47,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 20:21:47,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 20:21:47,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 20:21:47,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 20:21:47,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 20:21:47,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 20:21:47,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 20:21:47,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 20:21:47,551 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:47,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 20:21:47,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 20:21:47,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 20:21:47,841 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 20:21:47,842 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 20:21:47,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl [2021-05-21 20:21:47,843 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl' [2021-05-21 20:21:47,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 20:21:47,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 20:21:47,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 20:21:47,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 20:21:47,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 20:21:47,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 20:21:47,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 20:21:47,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 20:21:47,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 20:21:47,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/1) ... [2021-05-21 20:21:47,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 20:21:47,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 20:21:47,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 20:21:47,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 20:21:47,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (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:48,000 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2021-05-21 20:21:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2021-05-21 20:21:48,000 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2021-05-21 20:21:48,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2021-05-21 20:21:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2021-05-21 20:21:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2021-05-21 20:21:48,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2021-05-21 20:21:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2021-05-21 20:21:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2021-05-21 20:21:48,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2021-05-21 20:21:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2021-05-21 20:21:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2021-05-21 20:21:48,002 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 20:21:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 20:21:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 20:21:48,003 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:48,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 20:21:48,124 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-21 20:21:48,125 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:21:48 BoogieIcfgContainer [2021-05-21 20:21:48,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 20:21:48,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 20:21:48,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 20:21:48,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 20:21:48,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:21:47" (1/2) ... [2021-05-21 20:21:48,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6824b3 and model type example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 08:21:48, skipping insertion in model container [2021-05-21 20:21:48,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:21:48" (2/2) ... [2021-05-21 20:21:48,131 INFO L111 eAbstractionObserver]: Analyzing ICFG example_4.bpl [2021-05-21 20:21:48,141 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 20:21:48,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 20:21:48,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 20:21:48,143 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 20:21:48,247 INFO L149 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2021-05-21 20:21:48,286 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-05-21 20:21:48,326 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 20:21:48,326 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 20:21:48,326 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 20:21:48,326 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 20:21:48,327 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 20:21:48,327 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 20:21:48,327 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 20:21:48,327 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 20:21:48,335 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 35 transitions, 138 flow [2021-05-21 20:21:48,403 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 299 states, 297 states have (on average 2.95959595959596) internal successors, (879), 298 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 297 states have (on average 2.95959595959596) internal successors, (879), 298 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:48,426 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:48,426 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:48,427 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1503386291, now seen corresponding path program 1 times [2021-05-21 20:21:48,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:48,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939584245] [2021-05-21 20:21:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:48,587 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:48,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:48,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939584245] [2021-05-21 20:21:48,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939584245] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:48,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:48,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:21:48,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408015211] [2021-05-21 20:21:48,594 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:21:48,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:21:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:48,613 INFO L87 Difference]: Start difference. First operand has 299 states, 297 states have (on average 2.95959595959596) internal successors, (879), 298 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:48,656 INFO L93 Difference]: Finished difference Result 272 states and 771 transitions. [2021-05-21 20:21:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:21:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:48,678 INFO L225 Difference]: With dead ends: 272 [2021-05-21 20:21:48,678 INFO L226 Difference]: Without dead ends: 270 [2021-05-21 20:21:48,680 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-05-21 20:21:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-05-21 20:21:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 2.858736059479554) internal successors, (769), 269 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 769 transitions. [2021-05-21 20:21:48,748 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 769 transitions. Word has length 17 [2021-05-21 20:21:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:48,749 INFO L482 AbstractCegarLoop]: Abstraction has 270 states and 769 transitions. [2021-05-21 20:21:48,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 769 transitions. [2021-05-21 20:21:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:48,751 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:48,751 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:48,751 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 20:21:48,752 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 591735021, now seen corresponding path program 1 times [2021-05-21 20:21:48,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:48,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122110950] [2021-05-21 20:21:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:48,773 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:48,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:48,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122110950] [2021-05-21 20:21:48,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122110950] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:48,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:48,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:21:48,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893128528] [2021-05-21 20:21:48,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:21:48,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:21:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:48,777 INFO L87 Difference]: Start difference. First operand 270 states and 769 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:48,785 INFO L93 Difference]: Finished difference Result 216 states and 589 transitions. [2021-05-21 20:21:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:21:48,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:48,788 INFO L225 Difference]: With dead ends: 216 [2021-05-21 20:21:48,788 INFO L226 Difference]: Without dead ends: 216 [2021-05-21 20:21:48,788 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:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-05-21 20:21:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-05-21 20:21:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.73953488372093) internal successors, (589), 215 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 589 transitions. [2021-05-21 20:21:48,803 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 589 transitions. Word has length 17 [2021-05-21 20:21:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:48,804 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 589 transitions. [2021-05-21 20:21:48,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 589 transitions. [2021-05-21 20:21:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:48,805 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:48,806 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:48,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 20:21:48,806 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -345548245, now seen corresponding path program 1 times [2021-05-21 20:21:48,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:48,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881928626] [2021-05-21 20:21:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:48,827 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:48,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:48,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881928626] [2021-05-21 20:21:48,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881928626] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:48,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:48,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:21:48,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342631027] [2021-05-21 20:21:48,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:21:48,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:48,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:21:48,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:48,830 INFO L87 Difference]: Start difference. First operand 216 states and 589 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:48,837 INFO L93 Difference]: Finished difference Result 162 states and 433 transitions. [2021-05-21 20:21:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:21:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:48,839 INFO L225 Difference]: With dead ends: 162 [2021-05-21 20:21:48,839 INFO L226 Difference]: Without dead ends: 162 [2021-05-21 20:21:48,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:21:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-05-21 20:21:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-05-21 20:21:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.68944099378882) internal successors, (433), 161 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 433 transitions. [2021-05-21 20:21:48,850 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 433 transitions. Word has length 17 [2021-05-21 20:21:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:48,850 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 433 transitions. [2021-05-21 20:21:48,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 433 transitions. [2021-05-21 20:21:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:48,852 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:48,852 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:48,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 20:21:48,852 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:48,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1896362483, now seen corresponding path program 1 times [2021-05-21 20:21:48,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:48,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479901040] [2021-05-21 20:21:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:49,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:49,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:49,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479901040] [2021-05-21 20:21:49,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479901040] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:49,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:49,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:49,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152517663] [2021-05-21 20:21:49,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:49,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:49,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:49,029 INFO L87 Difference]: Start difference. First operand 162 states and 433 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:49,105 INFO L93 Difference]: Finished difference Result 304 states and 750 transitions. [2021-05-21 20:21:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:49,108 INFO L225 Difference]: With dead ends: 304 [2021-05-21 20:21:49,108 INFO L226 Difference]: Without dead ends: 265 [2021-05-21 20:21:49,109 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-05-21 20:21:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 170. [2021-05-21 20:21:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.6804733727810652) internal successors, (453), 169 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 453 transitions. [2021-05-21 20:21:49,132 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 453 transitions. Word has length 17 [2021-05-21 20:21:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:49,133 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 453 transitions. [2021-05-21 20:21:49,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 453 transitions. [2021-05-21 20:21:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:49,134 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:49,134 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:49,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 20:21:49,134 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 448349167, now seen corresponding path program 2 times [2021-05-21 20:21:49,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:49,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604025767] [2021-05-21 20:21:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:49,266 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:49,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:49,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604025767] [2021-05-21 20:21:49,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604025767] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:49,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:49,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:49,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168738550] [2021-05-21 20:21:49,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:49,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:49,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:49,273 INFO L87 Difference]: Start difference. First operand 170 states and 453 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:49,322 INFO L93 Difference]: Finished difference Result 319 states and 785 transitions. [2021-05-21 20:21:49,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:49,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:49,325 INFO L225 Difference]: With dead ends: 319 [2021-05-21 20:21:49,325 INFO L226 Difference]: Without dead ends: 257 [2021-05-21 20:21:49,325 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-21 20:21:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 162. [2021-05-21 20:21:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.6645962732919255) internal successors, (429), 161 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 429 transitions. [2021-05-21 20:21:49,334 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 429 transitions. Word has length 17 [2021-05-21 20:21:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:49,334 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 429 transitions. [2021-05-21 20:21:49,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 429 transitions. [2021-05-21 20:21:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:49,336 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:49,336 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:49,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 20:21:49,336 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:49,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash 808670063, now seen corresponding path program 3 times [2021-05-21 20:21:49,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:49,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536662932] [2021-05-21 20:21:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:49,474 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:49,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:49,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536662932] [2021-05-21 20:21:49,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536662932] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:49,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:49,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:49,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776833481] [2021-05-21 20:21:49,477 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:49,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:49,482 INFO L87 Difference]: Start difference. First operand 162 states and 429 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:49,521 INFO L93 Difference]: Finished difference Result 291 states and 712 transitions. [2021-05-21 20:21:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:49,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:49,524 INFO L225 Difference]: With dead ends: 291 [2021-05-21 20:21:49,524 INFO L226 Difference]: Without dead ends: 252 [2021-05-21 20:21:49,524 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-05-21 20:21:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 166. [2021-05-21 20:21:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.6484848484848484) internal successors, (437), 165 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 437 transitions. [2021-05-21 20:21:49,559 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 437 transitions. Word has length 17 [2021-05-21 20:21:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:49,560 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 437 transitions. [2021-05-21 20:21:49,560 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 437 transitions. [2021-05-21 20:21:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:49,561 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:49,561 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:49,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 20:21:49,561 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash -209274001, now seen corresponding path program 4 times [2021-05-21 20:21:49,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:49,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061268480] [2021-05-21 20:21:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:49,640 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:49,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:49,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061268480] [2021-05-21 20:21:49,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061268480] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:49,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:49,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:49,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734602891] [2021-05-21 20:21:49,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:49,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:49,642 INFO L87 Difference]: Start difference. First operand 166 states and 437 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:49,687 INFO L93 Difference]: Finished difference Result 297 states and 725 transitions. [2021-05-21 20:21:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:49,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:49,689 INFO L225 Difference]: With dead ends: 297 [2021-05-21 20:21:49,689 INFO L226 Difference]: Without dead ends: 248 [2021-05-21 20:21:49,690 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-05-21 20:21:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 162. [2021-05-21 20:21:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.652173913043478) internal successors, (427), 161 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 427 transitions. [2021-05-21 20:21:49,696 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 427 transitions. Word has length 17 [2021-05-21 20:21:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:49,697 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 427 transitions. [2021-05-21 20:21:49,697 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 427 transitions. [2021-05-21 20:21:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:49,698 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:49,698 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:49,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 20:21:49,699 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:49,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:49,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1120579375, now seen corresponding path program 5 times [2021-05-21 20:21:49,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:49,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421765134] [2021-05-21 20:21:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:49,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:49,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:49,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421765134] [2021-05-21 20:21:49,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421765134] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:49,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:49,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:49,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953366672] [2021-05-21 20:21:49,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:49,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:49,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:49,802 INFO L87 Difference]: Start difference. First operand 162 states and 427 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:49,833 INFO L93 Difference]: Finished difference Result 332 states and 818 transitions. [2021-05-21 20:21:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:49,835 INFO L225 Difference]: With dead ends: 332 [2021-05-21 20:21:49,835 INFO L226 Difference]: Without dead ends: 278 [2021-05-21 20:21:49,836 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-05-21 20:21:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 177. [2021-05-21 20:21:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.602272727272727) internal successors, (458), 176 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 458 transitions. [2021-05-21 20:21:49,843 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 458 transitions. Word has length 17 [2021-05-21 20:21:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:49,843 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 458 transitions. [2021-05-21 20:21:49,843 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 458 transitions. [2021-05-21 20:21:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:49,844 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:49,844 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:49,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 20:21:49,844 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1448962257, now seen corresponding path program 6 times [2021-05-21 20:21:49,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:49,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034057902] [2021-05-21 20:21:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:21:49,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:49,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034057902] [2021-05-21 20:21:49,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034057902] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:49,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:49,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:49,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925903132] [2021-05-21 20:21:49,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:49,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:49,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:49,943 INFO L87 Difference]: Start difference. First operand 177 states and 458 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:49,990 INFO L93 Difference]: Finished difference Result 323 states and 785 transitions. [2021-05-21 20:21:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:49,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:49,993 INFO L225 Difference]: With dead ends: 323 [2021-05-21 20:21:49,993 INFO L226 Difference]: Without dead ends: 257 [2021-05-21 20:21:49,994 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-21 20:21:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 156. [2021-05-21 20:21:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.6516129032258067) internal successors, (411), 155 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 411 transitions. [2021-05-21 20:21:50,000 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 411 transitions. Word has length 17 [2021-05-21 20:21:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,000 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 411 transitions. [2021-05-21 20:21:50,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 411 transitions. [2021-05-21 20:21:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,004 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,004 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 20:21:50,005 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash -815299857, now seen corresponding path program 7 times [2021-05-21 20:21:50,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665246214] [2021-05-21 20:21:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,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:21:50,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665246214] [2021-05-21 20:21:50,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665246214] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938216559] [2021-05-21 20:21:50,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,094 INFO L87 Difference]: Start difference. First operand 156 states and 411 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,128 INFO L93 Difference]: Finished difference Result 290 states and 704 transitions. [2021-05-21 20:21:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,130 INFO L225 Difference]: With dead ends: 290 [2021-05-21 20:21:50,130 INFO L226 Difference]: Without dead ends: 251 [2021-05-21 20:21:50,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-05-21 20:21:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 156. [2021-05-21 20:21:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.6258064516129034) internal successors, (407), 155 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 407 transitions. [2021-05-21 20:21:50,136 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 407 transitions. Word has length 17 [2021-05-21 20:21:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,136 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 407 transitions. [2021-05-21 20:21:50,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 407 transitions. [2021-05-21 20:21:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,137 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,137 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 20:21:50,137 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1529411793, now seen corresponding path program 8 times [2021-05-21 20:21:50,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656417827] [2021-05-21 20:21:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,216 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:50,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656417827] [2021-05-21 20:21:50,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656417827] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521305474] [2021-05-21 20:21:50,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,223 INFO L87 Difference]: Start difference. First operand 156 states and 407 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,258 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2021-05-21 20:21:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,260 INFO L225 Difference]: With dead ends: 305 [2021-05-21 20:21:50,260 INFO L226 Difference]: Without dead ends: 243 [2021-05-21 20:21:50,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-05-21 20:21:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2021-05-21 20:21:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.6054421768707483) internal successors, (383), 147 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 383 transitions. [2021-05-21 20:21:50,266 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 383 transitions. Word has length 17 [2021-05-21 20:21:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,266 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 383 transitions. [2021-05-21 20:21:50,266 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 383 transitions. [2021-05-21 20:21:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,267 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,267 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 20:21:50,267 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash 192998127, now seen corresponding path program 9 times [2021-05-21 20:21:50,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68698694] [2021-05-21 20:21:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:21:50,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68698694] [2021-05-21 20:21:50,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68698694] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262905841] [2021-05-21 20:21:50,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,348 INFO L87 Difference]: Start difference. First operand 148 states and 383 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,388 INFO L93 Difference]: Finished difference Result 267 states and 641 transitions. [2021-05-21 20:21:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,390 INFO L225 Difference]: With dead ends: 267 [2021-05-21 20:21:50,390 INFO L226 Difference]: Without dead ends: 228 [2021-05-21 20:21:50,390 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-05-21 20:21:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2021-05-21 20:21:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.589403973509934) internal successors, (391), 151 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 391 transitions. [2021-05-21 20:21:50,396 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 391 transitions. Word has length 17 [2021-05-21 20:21:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,396 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 391 transitions. [2021-05-21 20:21:50,396 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 391 transitions. [2021-05-21 20:21:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,397 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,397 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,397 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 20:21:50,398 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1503575313, now seen corresponding path program 10 times [2021-05-21 20:21:50,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231452295] [2021-05-21 20:21:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,468 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:50,468 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,469 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231452295] [2021-05-21 20:21:50,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231452295] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164552360] [2021-05-21 20:21:50,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,471 INFO L87 Difference]: Start difference. First operand 152 states and 391 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,516 INFO L93 Difference]: Finished difference Result 239 states and 584 transitions. [2021-05-21 20:21:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,518 INFO L225 Difference]: With dead ends: 239 [2021-05-21 20:21:50,518 INFO L226 Difference]: Without dead ends: 192 [2021-05-21 20:21:50,518 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-05-21 20:21:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2021-05-21 20:21:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.5918367346938775) internal successors, (381), 147 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 381 transitions. [2021-05-21 20:21:50,525 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 381 transitions. Word has length 17 [2021-05-21 20:21:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,526 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 381 transitions. [2021-05-21 20:21:50,526 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 381 transitions. [2021-05-21 20:21:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,527 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,527 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,527 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 20:21:50,527 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1736251311, now seen corresponding path program 11 times [2021-05-21 20:21:50,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623103685] [2021-05-21 20:21:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,604 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:50,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623103685] [2021-05-21 20:21:50,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623103685] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267845525] [2021-05-21 20:21:50,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,605 INFO L87 Difference]: Start difference. First operand 148 states and 381 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,638 INFO L93 Difference]: Finished difference Result 288 states and 697 transitions. [2021-05-21 20:21:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,642 INFO L225 Difference]: With dead ends: 288 [2021-05-21 20:21:50,642 INFO L226 Difference]: Without dead ends: 234 [2021-05-21 20:21:50,643 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-05-21 20:21:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 158. [2021-05-21 20:21:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.5605095541401273) internal successors, (402), 157 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 402 transitions. [2021-05-21 20:21:50,648 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 402 transitions. Word has length 17 [2021-05-21 20:21:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,648 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 402 transitions. [2021-05-21 20:21:50,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 402 transitions. [2021-05-21 20:21:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,649 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,649 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,649 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 20:21:50,649 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1648314577, now seen corresponding path program 12 times [2021-05-21 20:21:50,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525340622] [2021-05-21 20:21:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,711 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:50,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525340622] [2021-05-21 20:21:50,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525340622] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351515029] [2021-05-21 20:21:50,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,713 INFO L87 Difference]: Start difference. First operand 158 states and 402 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,751 INFO L93 Difference]: Finished difference Result 245 states and 595 transitions. [2021-05-21 20:21:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,753 INFO L225 Difference]: With dead ends: 245 [2021-05-21 20:21:50,753 INFO L226 Difference]: Without dead ends: 188 [2021-05-21 20:21:50,754 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-05-21 20:21:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2021-05-21 20:21:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.5944055944055946) internal successors, (371), 143 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 371 transitions. [2021-05-21 20:21:50,758 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 371 transitions. Word has length 17 [2021-05-21 20:21:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,759 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 371 transitions. [2021-05-21 20:21:50,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 371 transitions. [2021-05-21 20:21:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,761 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,761 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 20:21:50,761 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash 601862097, now seen corresponding path program 13 times [2021-05-21 20:21:50,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891202403] [2021-05-21 20:21:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,832 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:50,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891202403] [2021-05-21 20:21:50,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891202403] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551336033] [2021-05-21 20:21:50,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,836 INFO L87 Difference]: Start difference. First operand 144 states and 371 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,867 INFO L93 Difference]: Finished difference Result 261 states and 622 transitions. [2021-05-21 20:21:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,870 INFO L225 Difference]: With dead ends: 261 [2021-05-21 20:21:50,870 INFO L226 Difference]: Without dead ends: 222 [2021-05-21 20:21:50,870 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-05-21 20:21:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 144. [2021-05-21 20:21:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.5664335664335662) internal successors, (367), 143 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 367 transitions. [2021-05-21 20:21:50,876 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 367 transitions. Word has length 17 [2021-05-21 20:21:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:50,877 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 367 transitions. [2021-05-21 20:21:50,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 367 transitions. [2021-05-21 20:21:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:50,877 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:50,877 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:50,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 20:21:50,877 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash -416081967, now seen corresponding path program 14 times [2021-05-21 20:21:50,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:50,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887491560] [2021-05-21 20:21:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:50,953 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:50,954 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:50,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887491560] [2021-05-21 20:21:50,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887491560] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:50,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:50,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:50,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954924171] [2021-05-21 20:21:50,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:50,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:50,955 INFO L87 Difference]: Start difference. First operand 144 states and 367 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:50,997 INFO L93 Difference]: Finished difference Result 267 states and 635 transitions. [2021-05-21 20:21:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:50,998 INFO L225 Difference]: With dead ends: 267 [2021-05-21 20:21:50,998 INFO L226 Difference]: Without dead ends: 218 [2021-05-21 20:21:50,999 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-05-21 20:21:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 140. [2021-05-21 20:21:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.568345323741007) internal successors, (357), 139 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 357 transitions. [2021-05-21 20:21:51,003 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 357 transitions. Word has length 17 [2021-05-21 20:21:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,004 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 357 transitions. [2021-05-21 20:21:51,004 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 357 transitions. [2021-05-21 20:21:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,004 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,004 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 20:21:51,005 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1441474897, now seen corresponding path program 15 times [2021-05-21 20:21:51,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912757649] [2021-05-21 20:21:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,058 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:51,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912757649] [2021-05-21 20:21:51,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912757649] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926442888] [2021-05-21 20:21:51,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,060 INFO L87 Difference]: Start difference. First operand 140 states and 357 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,088 INFO L93 Difference]: Finished difference Result 247 states and 583 transitions. [2021-05-21 20:21:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,089 INFO L225 Difference]: With dead ends: 247 [2021-05-21 20:21:51,089 INFO L226 Difference]: Without dead ends: 208 [2021-05-21 20:21:51,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-05-21 20:21:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2021-05-21 20:21:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.5419847328244276) internal successors, (333), 131 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 333 transitions. [2021-05-21 20:21:51,093 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 333 transitions. Word has length 17 [2021-05-21 20:21:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,093 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 333 transitions. [2021-05-21 20:21:51,094 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 333 transitions. [2021-05-21 20:21:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,094 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,094 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 20:21:51,094 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash -422512687, now seen corresponding path program 16 times [2021-05-21 20:21:51,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626300832] [2021-05-21 20:21:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,149 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:51,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626300832] [2021-05-21 20:21:51,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626300832] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666347655] [2021-05-21 20:21:51,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,151 INFO L87 Difference]: Start difference. First operand 132 states and 333 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,188 INFO L93 Difference]: Finished difference Result 219 states and 526 transitions. [2021-05-21 20:21:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,189 INFO L225 Difference]: With dead ends: 219 [2021-05-21 20:21:51,189 INFO L226 Difference]: Without dead ends: 172 [2021-05-21 20:21:51,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-05-21 20:21:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2021-05-21 20:21:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.543307086614173) internal successors, (323), 127 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 323 transitions. [2021-05-21 20:21:51,193 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 323 transitions. Word has length 17 [2021-05-21 20:21:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,193 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 323 transitions. [2021-05-21 20:21:51,193 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 323 transitions. [2021-05-21 20:21:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,193 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,193 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 20:21:51,194 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1264414673, now seen corresponding path program 17 times [2021-05-21 20:21:51,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501853008] [2021-05-21 20:21:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,249 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:51,249 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501853008] [2021-05-21 20:21:51,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501853008] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186967269] [2021-05-21 20:21:51,250 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,250 INFO L87 Difference]: Start difference. First operand 128 states and 323 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,293 INFO L93 Difference]: Finished difference Result 223 states and 540 transitions. [2021-05-21 20:21:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,294 INFO L225 Difference]: With dead ends: 223 [2021-05-21 20:21:51,294 INFO L226 Difference]: Without dead ends: 178 [2021-05-21 20:21:51,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-05-21 20:21:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 134. [2021-05-21 20:21:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.526315789473684) internal successors, (336), 133 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 336 transitions. [2021-05-21 20:21:51,299 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 336 transitions. Word has length 17 [2021-05-21 20:21:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,299 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 336 transitions. [2021-05-21 20:21:51,299 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 336 transitions. [2021-05-21 20:21:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,300 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,300 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,301 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 20:21:51,301 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash 936031791, now seen corresponding path program 18 times [2021-05-21 20:21:51,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142250933] [2021-05-21 20:21:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,357 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:51,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142250933] [2021-05-21 20:21:51,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142250933] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69385095] [2021-05-21 20:21:51,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,359 INFO L87 Difference]: Start difference. First operand 134 states and 336 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,392 INFO L93 Difference]: Finished difference Result 177 states and 432 transitions. [2021-05-21 20:21:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,394 INFO L225 Difference]: With dead ends: 177 [2021-05-21 20:21:51,394 INFO L226 Difference]: Without dead ends: 126 [2021-05-21 20:21:51,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-05-21 20:21:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-05-21 20:21:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.552) internal successors, (319), 125 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 319 transitions. [2021-05-21 20:21:51,397 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 319 transitions. Word has length 17 [2021-05-21 20:21:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,397 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 319 transitions. [2021-05-21 20:21:51,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 319 transitions. [2021-05-21 20:21:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,398 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,398 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 20:21:51,398 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1679709363, now seen corresponding path program 19 times [2021-05-21 20:21:51,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333480538] [2021-05-21 20:21:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,456 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:51,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333480538] [2021-05-21 20:21:51,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333480538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128586051] [2021-05-21 20:21:51,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,458 INFO L87 Difference]: Start difference. First operand 126 states and 319 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,484 INFO L93 Difference]: Finished difference Result 212 states and 507 transitions. [2021-05-21 20:21:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,485 INFO L225 Difference]: With dead ends: 212 [2021-05-21 20:21:51,486 INFO L226 Difference]: Without dead ends: 158 [2021-05-21 20:21:51,486 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-05-21 20:21:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2021-05-21 20:21:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.464) internal successors, (308), 125 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 308 transitions. [2021-05-21 20:21:51,490 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 308 transitions. Word has length 17 [2021-05-21 20:21:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,490 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 308 transitions. [2021-05-21 20:21:51,490 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 308 transitions. [2021-05-21 20:21:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,490 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,490 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-21 20:21:51,491 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1351326481, now seen corresponding path program 20 times [2021-05-21 20:21:51,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464611198] [2021-05-21 20:21:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,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:21:51,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464611198] [2021-05-21 20:21:51,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464611198] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67887471] [2021-05-21 20:21:51,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,569 INFO L87 Difference]: Start difference. First operand 126 states and 308 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,604 INFO L93 Difference]: Finished difference Result 203 states and 474 transitions. [2021-05-21 20:21:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,606 INFO L225 Difference]: With dead ends: 203 [2021-05-21 20:21:51,606 INFO L226 Difference]: Without dead ends: 143 [2021-05-21 20:21:51,606 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-21 20:21:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2021-05-21 20:21:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.4545454545454546) internal successors, (270), 110 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 270 transitions. [2021-05-21 20:21:51,611 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 270 transitions. Word has length 17 [2021-05-21 20:21:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,611 INFO L482 AbstractCegarLoop]: Abstraction has 111 states and 270 transitions. [2021-05-21 20:21:51,611 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 270 transitions. [2021-05-21 20:21:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,612 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,612 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-21 20:21:51,612 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash -363627631, now seen corresponding path program 21 times [2021-05-21 20:21:51,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510055109] [2021-05-21 20:21:51,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,673 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:51,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510055109] [2021-05-21 20:21:51,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510055109] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607369461] [2021-05-21 20:21:51,674 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,675 INFO L87 Difference]: Start difference. First operand 111 states and 270 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,701 INFO L93 Difference]: Finished difference Result 174 states and 399 transitions. [2021-05-21 20:21:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,702 INFO L225 Difference]: With dead ends: 174 [2021-05-21 20:21:51,702 INFO L226 Difference]: Without dead ends: 120 [2021-05-21 20:21:51,702 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-21 20:21:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 88. [2021-05-21 20:21:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.310344827586207) internal successors, (201), 87 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 201 transitions. [2021-05-21 20:21:51,705 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 201 transitions. Word has length 17 [2021-05-21 20:21:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,705 INFO L482 AbstractCegarLoop]: Abstraction has 88 states and 201 transitions. [2021-05-21 20:21:51,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 201 transitions. [2021-05-21 20:21:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,706 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,706 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,706 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-21 20:21:51,706 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1855122543, now seen corresponding path program 22 times [2021-05-21 20:21:51,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,707 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463762831] [2021-05-21 20:21:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,761 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:51,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463762831] [2021-05-21 20:21:51,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463762831] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192506728] [2021-05-21 20:21:51,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,763 INFO L87 Difference]: Start difference. First operand 88 states and 201 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,800 INFO L93 Difference]: Finished difference Result 131 states and 297 transitions. [2021-05-21 20:21:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,801 INFO L225 Difference]: With dead ends: 131 [2021-05-21 20:21:51,801 INFO L226 Difference]: Without dead ends: 78 [2021-05-21 20:21:51,801 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-21 20:21:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-21 20:21:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.272727272727273) internal successors, (175), 77 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 175 transitions. [2021-05-21 20:21:51,804 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 175 transitions. Word has length 17 [2021-05-21 20:21:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,804 INFO L482 AbstractCegarLoop]: Abstraction has 78 states and 175 transitions. [2021-05-21 20:21:51,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 175 transitions. [2021-05-21 20:21:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,805 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,805 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-21 20:21:51,805 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash -40818065, now seen corresponding path program 23 times [2021-05-21 20:21:51,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316506754] [2021-05-21 20:21:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,861 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:51,862 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316506754] [2021-05-21 20:21:51,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316506754] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752805874] [2021-05-21 20:21:51,862 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,864 INFO L87 Difference]: Start difference. First operand 78 states and 175 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,897 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2021-05-21 20:21:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,898 INFO L225 Difference]: With dead ends: 109 [2021-05-21 20:21:51,898 INFO L226 Difference]: Without dead ends: 64 [2021-05-21 20:21:51,899 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-21 20:21:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-05-21 20:21:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 63 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 132 transitions. [2021-05-21 20:21:51,900 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 132 transitions. Word has length 17 [2021-05-21 20:21:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,900 INFO L482 AbstractCegarLoop]: Abstraction has 64 states and 132 transitions. [2021-05-21 20:21:51,900 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 132 transitions. [2021-05-21 20:21:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-21 20:21:51,901 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:21:51,901 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:21:51,901 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-21 20:21:51,901 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:21:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:21:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1630752815, now seen corresponding path program 24 times [2021-05-21 20:21:51,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:21:51,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109927954] [2021-05-21 20:21:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:21:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:21:51,962 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:51,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:21:51,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109927954] [2021-05-21 20:21:51,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109927954] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:21:51,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:21:51,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:21:51,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93572476] [2021-05-21 20:21:51,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:21:51,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:21:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:21:51,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:21:51,963 INFO L87 Difference]: Start difference. First operand 64 states and 132 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:21:51,991 INFO L93 Difference]: Finished difference Result 63 states and 131 transitions. [2021-05-21 20:21:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:21:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-05-21 20:21:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:21:51,991 INFO L225 Difference]: With dead ends: 63 [2021-05-21 20:21:51,991 INFO L226 Difference]: Without dead ends: 0 [2021-05-21 20:21:51,991 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:21:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-21 20:21:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-21 20:21:51,992 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:21:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-21 20:21:51,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2021-05-21 20:21:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:21:51,992 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-21 20:21:51,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:21:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-21 20:21:51,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-21 20:21:51,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-21 20:21:51,994 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-21 20:21:51,996 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.05 08:21:51 BasicIcfg [2021-05-21 20:21:51,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-21 20:21:51,997 INFO L168 Benchmark]: Toolchain (without parser) took 4092.90 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 323.4 MB in the beginning and 306.5 MB in the end (delta: 16.9 MB). Peak memory consumption was 88.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:21:51,997 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 343.9 MB. Free memory was 324.4 MB in the beginning and 324.3 MB in the end (delta: 72.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:21:51,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.28 ms. Allocated memory is still 343.9 MB. Free memory was 323.4 MB in the beginning and 321.9 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:21:51,997 INFO L168 Benchmark]: Boogie Preprocessor took 10.14 ms. Allocated memory is still 343.9 MB. Free memory was 321.9 MB in the beginning and 321.0 MB in the end (delta: 880.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:21:51,998 INFO L168 Benchmark]: RCFGBuilder took 185.70 ms. Allocated memory is still 343.9 MB. Free memory was 320.9 MB in the beginning and 311.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. [2021-05-21 20:21:51,998 INFO L168 Benchmark]: TraceAbstraction took 3870.06 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 311.0 MB in the beginning and 306.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 77.6 MB. Max. memory is 16.0 GB. [2021-05-21 20:21:51,999 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 343.9 MB. Free memory was 324.4 MB in the beginning and 324.3 MB in the end (delta: 72.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 22.28 ms. Allocated memory is still 343.9 MB. Free memory was 323.4 MB in the beginning and 321.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 10.14 ms. Allocated memory is still 343.9 MB. Free memory was 321.9 MB in the beginning and 321.0 MB in the end (delta: 880.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 185.70 ms. Allocated memory is still 343.9 MB. Free memory was 320.9 MB in the beginning and 311.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3870.06 ms. Allocated memory was 343.9 MB in the beginning and 413.1 MB in the end (delta: 69.2 MB). Free memory was 311.0 MB in the beginning and 306.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 77.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3668.6ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 42.8ms, AutomataDifference: 1101.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 76.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1010 SDtfs, 1212 SDslu, 1379 SDs, 0 SdLazy, 327 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 275.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1486.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 240.0ms AutomataMinimizationTime, 27 MinimizatonAttempts, 1410 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.8ms SsaConstructionTime, 79.9ms SatisfiabilityAnalysisTime, 1848.9ms InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 6156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...