/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 17:52:48,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 17:52:48,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 17:52:49,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 17:52:49,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 17:52:49,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 17:52:49,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 17:52:49,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 17:52:49,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 17:52:49,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 17:52:49,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 17:52:49,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 17:52:49,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 17:52:49,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 17:52:49,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 17:52:49,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 17:52:49,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 17:52:49,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 17:52:49,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 17:52:49,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 17:52:49,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 17:52:49,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 17:52:49,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 17:52:49,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 17:52:49,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 17:52:49,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 17:52:49,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 17:52:49,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 17:52:49,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 17:52:49,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 17:52:49,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 17:52:49,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 17:52:49,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 17:52:49,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 17:52:49,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 17:52:49,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 17:52:49,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 17:52:49,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 17:52:49,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 17:52:49,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 17:52:49,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 17:52:49,060 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-07-09 17:52:49,100 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 17:52:49,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 17:52:49,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 17:52:49,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 17:52:49,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 17:52:49,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 17:52:49,101 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 17:52:49,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 17:52:49,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 17:52:49,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 17:52:49,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 17:52:49,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 17:52:49,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 17:52:49,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 17:52:49,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 17:52:49,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 17:52:49,104 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-07-09 17:52:49,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 17:52:49,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 17:52:49,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 17:52:49,438 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-07-09 17:52:49,440 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-07-09 17:52:49,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl [2021-07-09 17:52:49,440 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl' [2021-07-09 17:52:49,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 17:52:49,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-07-09 17:52:49,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 17:52:49,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 17:52:49,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 17:52:49,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 17:52:49,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 17:52:49,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 17:52:49,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 17:52:49,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/1) ... [2021-07-09 17:52:49,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 17:52:49,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 17:52:49,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 17:52:49,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 17:52:49,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (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-07-09 17:52:49,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-07-09 17:52:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-07-09 17:52:49,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-07-09 17:52:49,595 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-07-09 17:52:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-07-09 17:52:49,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-07-09 17:52:49,595 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-07-09 17:52:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 17:52:49,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 17:52:49,595 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-07-09 17:52:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-07-09 17:52:49,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-07-09 17:52:49,596 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-07-09 17:52:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-07-09 17:52:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-07-09 17:52:49,597 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 17:52:49,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 17:52:49,733 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-07-09 17:52:49,734 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 05:52:49 BoogieIcfgContainer [2021-07-09 17:52:49,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 17:52:49,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 17:52:49,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 17:52:49,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 17:52:49,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.07 05:52:49" (1/2) ... [2021-07-09 17:52:49,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6e0dc5 and model type ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 05:52:49, skipping insertion in model container [2021-07-09 17:52:49,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 05:52:49" (2/2) ... [2021-07-09 17:52:49,739 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.bpl [2021-07-09 17:52:49,742 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 17:52:49,742 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 17:52:49,743 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-09 17:52:49,743 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 17:52:49,772 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-07-09 17:52:49,786 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-07-09 17:52:49,798 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:52:49,799 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:52:49,799 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:52:49,799 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:52:49,799 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:52:49,799 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:52:49,799 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:52:49,799 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 17:52:49,806 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 38 transitions, 108 flow [2021-07-09 17:52:49,955 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2076 states, 2075 states have (on average 3.3532530120481927) internal successors, (6958), 2075 states have internal predecessors, (6958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 2076 states, 2075 states have (on average 3.3532530120481927) internal successors, (6958), 2075 states have internal predecessors, (6958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:49,978 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:49,979 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:49,979 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1605883801, now seen corresponding path program 1 times [2021-07-09 17:52:49,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:49,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819904860] [2021-07-09 17:52:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:50,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:50,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819904860] [2021-07-09 17:52:50,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819904860] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:50,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:50,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-09 17:52:50,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240144692] [2021-07-09 17:52:50,199 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 17:52:50,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 17:52:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:52:50,217 INFO L87 Difference]: Start difference. First operand has 2076 states, 2075 states have (on average 3.3532530120481927) internal successors, (6958), 2075 states have internal predecessors, (6958), 0 states have call successors, (0), 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 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:50,345 INFO L93 Difference]: Finished difference Result 4631 states and 14853 transitions. [2021-07-09 17:52:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-09 17:52:50,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:50,409 INFO L225 Difference]: With dead ends: 4631 [2021-07-09 17:52:50,409 INFO L226 Difference]: Without dead ends: 4631 [2021-07-09 17:52:50,410 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 45.0ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2021-07-09 17:52:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 2449. [2021-07-09 17:52:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 3.2834967320261437) internal successors, (8038), 2448 states have internal predecessors, (8038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 8038 transitions. [2021-07-09 17:52:50,534 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 8038 transitions. Word has length 32 [2021-07-09 17:52:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:50,535 INFO L482 AbstractCegarLoop]: Abstraction has 2449 states and 8038 transitions. [2021-07-09 17:52:50,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 8038 transitions. [2021-07-09 17:52:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:50,541 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:50,541 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:50,542 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 17:52:50,542 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:50,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1948568667, now seen corresponding path program 2 times [2021-07-09 17:52:50,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:50,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889772510] [2021-07-09 17:52:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:50,618 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:50,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889772510] [2021-07-09 17:52:50,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889772510] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:50,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:50,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-09 17:52:50,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547051486] [2021-07-09 17:52:50,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-09 17:52:50,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-09 17:52:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-07-09 17:52:50,621 INFO L87 Difference]: Start difference. First operand 2449 states and 8038 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:50,731 INFO L93 Difference]: Finished difference Result 3557 states and 11583 transitions. [2021-07-09 17:52:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-09 17:52:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:50,744 INFO L225 Difference]: With dead ends: 3557 [2021-07-09 17:52:50,744 INFO L226 Difference]: Without dead ends: 2328 [2021-07-09 17:52:50,745 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-07-09 17:52:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2021-07-09 17:52:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2021-07-09 17:52:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2327 states have (on average 3.1637301246239793) internal successors, (7362), 2327 states have internal predecessors, (7362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 7362 transitions. [2021-07-09 17:52:50,822 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 7362 transitions. Word has length 32 [2021-07-09 17:52:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:50,822 INFO L482 AbstractCegarLoop]: Abstraction has 2328 states and 7362 transitions. [2021-07-09 17:52:50,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 7362 transitions. [2021-07-09 17:52:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:50,831 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:50,832 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:50,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 17:52:50,832 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1102189607, now seen corresponding path program 3 times [2021-07-09 17:52:50,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:50,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399918062] [2021-07-09 17:52:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:50,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:50,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399918062] [2021-07-09 17:52:50,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399918062] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:50,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:50,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-09 17:52:50,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956464298] [2021-07-09 17:52:50,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 17:52:50,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 17:52:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:52:50,969 INFO L87 Difference]: Start difference. First operand 2328 states and 7362 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:51,074 INFO L93 Difference]: Finished difference Result 3796 states and 11479 transitions. [2021-07-09 17:52:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-09 17:52:51,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:51,090 INFO L225 Difference]: With dead ends: 3796 [2021-07-09 17:52:51,090 INFO L226 Difference]: Without dead ends: 3752 [2021-07-09 17:52:51,090 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2021-07-09 17:52:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2380. [2021-07-09 17:52:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 3.051282051282051) internal successors, (7259), 2379 states have internal predecessors, (7259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7259 transitions. [2021-07-09 17:52:51,153 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7259 transitions. Word has length 32 [2021-07-09 17:52:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:51,153 INFO L482 AbstractCegarLoop]: Abstraction has 2380 states and 7259 transitions. [2021-07-09 17:52:51,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7259 transitions. [2021-07-09 17:52:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:51,158 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:51,159 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:51,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 17:52:51,159 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1186260567, now seen corresponding path program 4 times [2021-07-09 17:52:51,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:51,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122618405] [2021-07-09 17:52:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:51,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:51,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122618405] [2021-07-09 17:52:51,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122618405] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:51,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:51,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 17:52:51,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788865265] [2021-07-09 17:52:51,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:52:51,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:51,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:52:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:51,213 INFO L87 Difference]: Start difference. First operand 2380 states and 7259 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:51,309 INFO L93 Difference]: Finished difference Result 4075 states and 12124 transitions. [2021-07-09 17:52:51,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 17:52:51,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:51,324 INFO L225 Difference]: With dead ends: 4075 [2021-07-09 17:52:51,325 INFO L226 Difference]: Without dead ends: 4027 [2021-07-09 17:52:51,325 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2021-07-09 17:52:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 2348. [2021-07-09 17:52:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2347 states have (on average 3.033233915636983) internal successors, (7119), 2347 states have internal predecessors, (7119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 7119 transitions. [2021-07-09 17:52:51,379 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 7119 transitions. Word has length 32 [2021-07-09 17:52:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:51,379 INFO L482 AbstractCegarLoop]: Abstraction has 2348 states and 7119 transitions. [2021-07-09 17:52:51,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 7119 transitions. [2021-07-09 17:52:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:51,384 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:51,384 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:51,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 17:52:51,384 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash -533537273, now seen corresponding path program 5 times [2021-07-09 17:52:51,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:51,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123296809] [2021-07-09 17:52:51,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:51,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:51,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123296809] [2021-07-09 17:52:51,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123296809] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:51,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:51,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:51,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912379994] [2021-07-09 17:52:51,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:51,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:51,423 INFO L87 Difference]: Start difference. First operand 2348 states and 7119 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:51,556 INFO L93 Difference]: Finished difference Result 4192 states and 12353 transitions. [2021-07-09 17:52:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:51,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:51,567 INFO L225 Difference]: With dead ends: 4192 [2021-07-09 17:52:51,567 INFO L226 Difference]: Without dead ends: 4048 [2021-07-09 17:52:51,568 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 33.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2021-07-09 17:52:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 2389. [2021-07-09 17:52:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2388 states have (on average 3.009212730318258) internal successors, (7186), 2388 states have internal predecessors, (7186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 7186 transitions. [2021-07-09 17:52:51,641 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 7186 transitions. Word has length 32 [2021-07-09 17:52:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:51,641 INFO L482 AbstractCegarLoop]: Abstraction has 2389 states and 7186 transitions. [2021-07-09 17:52:51,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 7186 transitions. [2021-07-09 17:52:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:51,645 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:51,645 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:51,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 17:52:51,646 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash -138224759, now seen corresponding path program 6 times [2021-07-09 17:52:51,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:51,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566455938] [2021-07-09 17:52:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:51,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:51,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566455938] [2021-07-09 17:52:51,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566455938] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:51,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:51,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 17:52:51,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315252336] [2021-07-09 17:52:51,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:52:51,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:51,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:52:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:51,679 INFO L87 Difference]: Start difference. First operand 2389 states and 7186 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:51,774 INFO L93 Difference]: Finished difference Result 4046 states and 11863 transitions. [2021-07-09 17:52:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 17:52:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:51,784 INFO L225 Difference]: With dead ends: 4046 [2021-07-09 17:52:51,784 INFO L226 Difference]: Without dead ends: 4002 [2021-07-09 17:52:51,784 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2021-07-09 17:52:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 2467. [2021-07-09 17:52:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 2.981346309813463) internal successors, (7352), 2466 states have internal predecessors, (7352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 7352 transitions. [2021-07-09 17:52:51,845 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 7352 transitions. Word has length 32 [2021-07-09 17:52:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:51,845 INFO L482 AbstractCegarLoop]: Abstraction has 2467 states and 7352 transitions. [2021-07-09 17:52:51,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 7352 transitions. [2021-07-09 17:52:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:51,850 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:51,850 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:51,851 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 17:52:51,851 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:51,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1319822311, now seen corresponding path program 7 times [2021-07-09 17:52:51,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:51,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125668302] [2021-07-09 17:52:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:51,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:51,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125668302] [2021-07-09 17:52:51,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125668302] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:51,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:51,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:51,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893553232] [2021-07-09 17:52:51,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:51,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:51,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:51,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:51,886 INFO L87 Difference]: Start difference. First operand 2467 states and 7352 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:52,055 INFO L93 Difference]: Finished difference Result 4284 states and 12351 transitions. [2021-07-09 17:52:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:52,064 INFO L225 Difference]: With dead ends: 4284 [2021-07-09 17:52:52,064 INFO L226 Difference]: Without dead ends: 4176 [2021-07-09 17:52:52,065 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2021-07-09 17:52:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 2547. [2021-07-09 17:52:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 2546 states have (on average 2.9571877454831106) internal successors, (7529), 2546 states have internal predecessors, (7529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 7529 transitions. [2021-07-09 17:52:52,124 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 7529 transitions. Word has length 32 [2021-07-09 17:52:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:52,124 INFO L482 AbstractCegarLoop]: Abstraction has 2547 states and 7529 transitions. [2021-07-09 17:52:52,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 7529 transitions. [2021-07-09 17:52:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:52,130 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:52,130 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:52,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 17:52:52,130 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash -551597849, now seen corresponding path program 8 times [2021-07-09 17:52:52,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:52,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68804707] [2021-07-09 17:52:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:52,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:52,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68804707] [2021-07-09 17:52:52,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68804707] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:52,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:52,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 17:52:52,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666150312] [2021-07-09 17:52:52,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:52:52,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:52:52,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:52,162 INFO L87 Difference]: Start difference. First operand 2547 states and 7529 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:52,265 INFO L93 Difference]: Finished difference Result 3902 states and 11122 transitions. [2021-07-09 17:52:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 17:52:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:52,276 INFO L225 Difference]: With dead ends: 3902 [2021-07-09 17:52:52,276 INFO L226 Difference]: Without dead ends: 3890 [2021-07-09 17:52:52,276 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2021-07-09 17:52:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2497. [2021-07-09 17:52:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2497 states, 2496 states have (on average 2.890224358974359) internal successors, (7214), 2496 states have internal predecessors, (7214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 7214 transitions. [2021-07-09 17:52:52,339 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 7214 transitions. Word has length 32 [2021-07-09 17:52:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:52,339 INFO L482 AbstractCegarLoop]: Abstraction has 2497 states and 7214 transitions. [2021-07-09 17:52:52,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 7214 transitions. [2021-07-09 17:52:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:52,344 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:52,344 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:52,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 17:52:52,344 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 937806951, now seen corresponding path program 9 times [2021-07-09 17:52:52,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:52,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404046979] [2021-07-09 17:52:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:52,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:52,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404046979] [2021-07-09 17:52:52,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404046979] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:52,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:52,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:52,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249808460] [2021-07-09 17:52:52,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:52,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:52,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:52,380 INFO L87 Difference]: Start difference. First operand 2497 states and 7214 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:52,512 INFO L93 Difference]: Finished difference Result 2921 states and 7631 transitions. [2021-07-09 17:52:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:52,518 INFO L225 Difference]: With dead ends: 2921 [2021-07-09 17:52:52,518 INFO L226 Difference]: Without dead ends: 2719 [2021-07-09 17:52:52,518 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2021-07-09 17:52:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 1853. [2021-07-09 17:52:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 2.6906047516198703) internal successors, (4983), 1852 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4983 transitions. [2021-07-09 17:52:52,558 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4983 transitions. Word has length 32 [2021-07-09 17:52:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:52,558 INFO L482 AbstractCegarLoop]: Abstraction has 1853 states and 4983 transitions. [2021-07-09 17:52:52,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4983 transitions. [2021-07-09 17:52:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:52,561 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:52,561 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:52,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 17:52:52,562 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash -140938485, now seen corresponding path program 10 times [2021-07-09 17:52:52,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:52,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298756730] [2021-07-09 17:52:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:52,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:52,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298756730] [2021-07-09 17:52:52,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298756730] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:52,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:52,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 17:52:52,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945401193] [2021-07-09 17:52:52,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:52:52,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:52:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:52,593 INFO L87 Difference]: Start difference. First operand 1853 states and 4983 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:52,705 INFO L93 Difference]: Finished difference Result 3038 states and 7985 transitions. [2021-07-09 17:52:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-09 17:52:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:52,711 INFO L225 Difference]: With dead ends: 3038 [2021-07-09 17:52:52,711 INFO L226 Difference]: Without dead ends: 2990 [2021-07-09 17:52:52,711 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:52:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2021-07-09 17:52:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1829. [2021-07-09 17:52:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 2.6756017505470457) internal successors, (4891), 1828 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 4891 transitions. [2021-07-09 17:52:52,773 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 4891 transitions. Word has length 32 [2021-07-09 17:52:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:52,773 INFO L482 AbstractCegarLoop]: Abstraction has 1829 states and 4891 transitions. [2021-07-09 17:52:52,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 4891 transitions. [2021-07-09 17:52:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:52,776 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:52,776 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:52,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 17:52:52,776 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 511784809, now seen corresponding path program 11 times [2021-07-09 17:52:52,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:52,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366833112] [2021-07-09 17:52:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:52,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:52,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366833112] [2021-07-09 17:52:52,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366833112] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:52,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:52,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:52,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649434731] [2021-07-09 17:52:52,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:52,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:52,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:52,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:52,808 INFO L87 Difference]: Start difference. First operand 1829 states and 4891 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:52,931 INFO L93 Difference]: Finished difference Result 3002 states and 7863 transitions. [2021-07-09 17:52:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:52,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:52,936 INFO L225 Difference]: With dead ends: 3002 [2021-07-09 17:52:52,936 INFO L226 Difference]: Without dead ends: 2834 [2021-07-09 17:52:52,937 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 31.3ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-07-09 17:52:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 1757. [2021-07-09 17:52:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1756 states have (on average 2.665717539863326) internal successors, (4681), 1756 states have internal predecessors, (4681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 4681 transitions. [2021-07-09 17:52:52,965 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 4681 transitions. Word has length 32 [2021-07-09 17:52:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:52,965 INFO L482 AbstractCegarLoop]: Abstraction has 1757 states and 4681 transitions. [2021-07-09 17:52:52,965 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 4681 transitions. [2021-07-09 17:52:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:52,968 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:52,968 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:52,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 17:52:52,968 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1246814363, now seen corresponding path program 12 times [2021-07-09 17:52:52,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:52,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806753409] [2021-07-09 17:52:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:53,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:53,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806753409] [2021-07-09 17:52:53,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806753409] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:53,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:53,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 17:52:53,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023442574] [2021-07-09 17:52:53,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:52:53,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:52:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:52:53,004 INFO L87 Difference]: Start difference. First operand 1757 states and 4681 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:53,171 INFO L93 Difference]: Finished difference Result 2972 states and 7731 transitions. [2021-07-09 17:52:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 17:52:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:53,176 INFO L225 Difference]: With dead ends: 2972 [2021-07-09 17:52:53,176 INFO L226 Difference]: Without dead ends: 2792 [2021-07-09 17:52:53,176 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-07-09 17:52:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2021-07-09 17:52:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 1715. [2021-07-09 17:52:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 2.6586931155192532) internal successors, (4557), 1714 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 4557 transitions. [2021-07-09 17:52:53,203 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 4557 transitions. Word has length 32 [2021-07-09 17:52:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:53,203 INFO L482 AbstractCegarLoop]: Abstraction has 1715 states and 4557 transitions. [2021-07-09 17:52:53,204 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 4557 transitions. [2021-07-09 17:52:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:53,206 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:53,206 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:53,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 17:52:53,207 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:53,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1839054059, now seen corresponding path program 13 times [2021-07-09 17:52:53,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:53,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640453287] [2021-07-09 17:52:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:53,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:53,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640453287] [2021-07-09 17:52:53,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640453287] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:53,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:53,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 17:52:53,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014093084] [2021-07-09 17:52:53,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:52:53,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:52:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:53,235 INFO L87 Difference]: Start difference. First operand 1715 states and 4557 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:53,344 INFO L93 Difference]: Finished difference Result 2909 states and 7590 transitions. [2021-07-09 17:52:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-09 17:52:53,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:53,349 INFO L225 Difference]: With dead ends: 2909 [2021-07-09 17:52:53,349 INFO L226 Difference]: Without dead ends: 2873 [2021-07-09 17:52:53,349 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:52:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2021-07-09 17:52:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1632. [2021-07-09 17:52:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 2.6241569589209073) internal successors, (4280), 1631 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4280 transitions. [2021-07-09 17:52:53,377 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 4280 transitions. Word has length 32 [2021-07-09 17:52:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:53,377 INFO L482 AbstractCegarLoop]: Abstraction has 1632 states and 4280 transitions. [2021-07-09 17:52:53,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 4280 transitions. [2021-07-09 17:52:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:53,379 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:53,380 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:53,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 17:52:53,380 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash -997866167, now seen corresponding path program 14 times [2021-07-09 17:52:53,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:53,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310467435] [2021-07-09 17:52:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:53,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:53,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310467435] [2021-07-09 17:52:53,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310467435] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:53,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:53,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:53,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527861085] [2021-07-09 17:52:53,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:53,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:53,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:53,410 INFO L87 Difference]: Start difference. First operand 1632 states and 4280 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:53,533 INFO L93 Difference]: Finished difference Result 2785 states and 7226 transitions. [2021-07-09 17:52:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:53,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:53,538 INFO L225 Difference]: With dead ends: 2785 [2021-07-09 17:52:53,538 INFO L226 Difference]: Without dead ends: 2701 [2021-07-09 17:52:53,538 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2021-07-09 17:52:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1572. [2021-07-09 17:52:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 2.602800763844685) internal successors, (4089), 1571 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 4089 transitions. [2021-07-09 17:52:53,568 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 4089 transitions. Word has length 32 [2021-07-09 17:52:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:53,568 INFO L482 AbstractCegarLoop]: Abstraction has 1572 states and 4089 transitions. [2021-07-09 17:52:53,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 4089 transitions. [2021-07-09 17:52:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:53,570 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:53,570 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:53,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 17:52:53,571 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2062628165, now seen corresponding path program 15 times [2021-07-09 17:52:53,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:53,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443109812] [2021-07-09 17:52:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:53,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-07-09 17:52:53,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:53,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443109812] [2021-07-09 17:52:53,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443109812] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:53,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:53,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 17:52:53,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073333498] [2021-07-09 17:52:53,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:52:53,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:52:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:52:53,605 INFO L87 Difference]: Start difference. First operand 1572 states and 4089 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:53,779 INFO L93 Difference]: Finished difference Result 2741 states and 7066 transitions. [2021-07-09 17:52:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 17:52:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:53,783 INFO L225 Difference]: With dead ends: 2741 [2021-07-09 17:52:53,783 INFO L226 Difference]: Without dead ends: 2642 [2021-07-09 17:52:53,786 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 53.3ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-07-09 17:52:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2021-07-09 17:52:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 1525. [2021-07-09 17:52:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 2.5990813648293964) internal successors, (3961), 1524 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 3961 transitions. [2021-07-09 17:52:53,812 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 3961 transitions. Word has length 32 [2021-07-09 17:52:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:53,812 INFO L482 AbstractCegarLoop]: Abstraction has 1525 states and 3961 transitions. [2021-07-09 17:52:53,812 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 3961 transitions. [2021-07-09 17:52:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:53,814 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:53,814 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:53,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 17:52:53,815 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash 106050727, now seen corresponding path program 16 times [2021-07-09 17:52:53,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:53,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26623557] [2021-07-09 17:52:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:53,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:53,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26623557] [2021-07-09 17:52:53,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26623557] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:53,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:53,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:53,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723316311] [2021-07-09 17:52:53,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:53,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:53,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:53,868 INFO L87 Difference]: Start difference. First operand 1525 states and 3961 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:53,989 INFO L93 Difference]: Finished difference Result 2648 states and 6780 transitions. [2021-07-09 17:52:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:53,992 INFO L225 Difference]: With dead ends: 2648 [2021-07-09 17:52:53,993 INFO L226 Difference]: Without dead ends: 2576 [2021-07-09 17:52:53,993 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-07-09 17:52:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1464. [2021-07-09 17:52:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 2.5598086124401913) internal successors, (3745), 1463 states have internal predecessors, (3745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 3745 transitions. [2021-07-09 17:52:54,025 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 3745 transitions. Word has length 32 [2021-07-09 17:52:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:54,025 INFO L482 AbstractCegarLoop]: Abstraction has 1464 states and 3745 transitions. [2021-07-09 17:52:54,025 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 3745 transitions. [2021-07-09 17:52:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:54,027 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:54,027 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:54,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 17:52:54,028 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash 522378757, now seen corresponding path program 17 times [2021-07-09 17:52:54,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:54,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471715122] [2021-07-09 17:52:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:54,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:54,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471715122] [2021-07-09 17:52:54,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471715122] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:54,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:54,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 17:52:54,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404927179] [2021-07-09 17:52:54,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:52:54,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:54,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:52:54,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:52:54,061 INFO L87 Difference]: Start difference. First operand 1464 states and 3745 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:54,221 INFO L93 Difference]: Finished difference Result 2588 states and 6572 transitions. [2021-07-09 17:52:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 17:52:54,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:54,224 INFO L225 Difference]: With dead ends: 2588 [2021-07-09 17:52:54,224 INFO L226 Difference]: Without dead ends: 2505 [2021-07-09 17:52:54,225 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-07-09 17:52:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-07-09 17:52:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1418. [2021-07-09 17:52:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 2.5772759350741) internal successors, (3652), 1417 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3652 transitions. [2021-07-09 17:52:54,246 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3652 transitions. Word has length 32 [2021-07-09 17:52:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:54,247 INFO L482 AbstractCegarLoop]: Abstraction has 1418 states and 3652 transitions. [2021-07-09 17:52:54,247 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3652 transitions. [2021-07-09 17:52:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:54,249 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:54,249 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:54,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 17:52:54,249 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1136388017, now seen corresponding path program 18 times [2021-07-09 17:52:54,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:54,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090458595] [2021-07-09 17:52:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:54,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:54,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090458595] [2021-07-09 17:52:54,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090458595] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:54,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:54,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 17:52:54,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372119497] [2021-07-09 17:52:54,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:52:54,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:52:54,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:52:54,272 INFO L87 Difference]: Start difference. First operand 1418 states and 3652 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:54,343 INFO L93 Difference]: Finished difference Result 1974 states and 4941 transitions. [2021-07-09 17:52:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 17:52:54,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:54,346 INFO L225 Difference]: With dead ends: 1974 [2021-07-09 17:52:54,346 INFO L226 Difference]: Without dead ends: 1914 [2021-07-09 17:52:54,346 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2021-07-09 17:52:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 982. [2021-07-09 17:52:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 2.509683995922528) internal successors, (2462), 981 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2462 transitions. [2021-07-09 17:52:54,367 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2462 transitions. Word has length 32 [2021-07-09 17:52:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:54,367 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 2462 transitions. [2021-07-09 17:52:54,367 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2462 transitions. [2021-07-09 17:52:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:54,369 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:54,369 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:54,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 17:52:54,369 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1438292239, now seen corresponding path program 19 times [2021-07-09 17:52:54,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:54,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707372787] [2021-07-09 17:52:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:54,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:54,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707372787] [2021-07-09 17:52:54,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707372787] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:54,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:54,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 17:52:54,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477367491] [2021-07-09 17:52:54,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 17:52:54,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 17:52:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-07-09 17:52:54,396 INFO L87 Difference]: Start difference. First operand 982 states and 2462 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:54,478 INFO L93 Difference]: Finished difference Result 502 states and 1050 transitions. [2021-07-09 17:52:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:52:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:54,479 INFO L225 Difference]: With dead ends: 502 [2021-07-09 17:52:54,479 INFO L226 Difference]: Without dead ends: 234 [2021-07-09 17:52:54,479 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 28.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:52:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-07-09 17:52:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2021-07-09 17:52:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.1677018633540373) internal successors, (349), 161 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 349 transitions. [2021-07-09 17:52:54,482 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 349 transitions. Word has length 32 [2021-07-09 17:52:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:54,482 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 349 transitions. [2021-07-09 17:52:54,482 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 349 transitions. [2021-07-09 17:52:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-09 17:52:54,482 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:52:54,482 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:52:54,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-09 17:52:54,482 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-09 17:52:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:52:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2002098131, now seen corresponding path program 20 times [2021-07-09 17:52:54,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:52:54,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778848112] [2021-07-09 17:52:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:52:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:52:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:52:54,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:52:54,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778848112] [2021-07-09 17:52:54,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778848112] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:52:54,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:52:54,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 17:52:54,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649637030] [2021-07-09 17:52:54,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:52:54,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:52:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:52:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:52:54,515 INFO L87 Difference]: Start difference. First operand 162 states and 349 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:52:54,594 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2021-07-09 17:52:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 17:52:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-09 17:52:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:52:54,595 INFO L225 Difference]: With dead ends: 105 [2021-07-09 17:52:54,595 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 17:52:54,595 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 47.5ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-07-09 17:52:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 17:52:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 17:52:54,595 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-07-09 17:52:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 17:52:54,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-07-09 17:52:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:52:54,596 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 17:52:54,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:52:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 17:52:54,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 17:52:54,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-09 17:52:54,597 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 17:52:54,599 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 05:52:54 BasicIcfg [2021-07-09 17:52:54,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 17:52:54,599 INFO L168 Benchmark]: Toolchain (without parser) took 5135.03 ms. Allocated memory was 176.2 MB in the beginning and 490.7 MB in the end (delta: 314.6 MB). Free memory was 156.2 MB in the beginning and 375.1 MB in the end (delta: -218.9 MB). Peak memory consumption was 96.7 MB. Max. memory is 8.0 GB. [2021-07-09 17:52:54,600 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 176.2 MB. Free memory is still 157.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 17:52:54,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.63 ms. Allocated memory is still 176.2 MB. Free memory was 156.0 MB in the beginning and 154.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-07-09 17:52:54,600 INFO L168 Benchmark]: Boogie Preprocessor took 8.88 ms. Allocated memory is still 176.2 MB. Free memory was 154.6 MB in the beginning and 153.7 MB in the end (delta: 868.4 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-07-09 17:52:54,600 INFO L168 Benchmark]: RCFGBuilder took 238.45 ms. Allocated memory is still 176.2 MB. Free memory was 153.6 MB in the beginning and 139.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-07-09 17:52:54,600 INFO L168 Benchmark]: TraceAbstraction took 4863.70 ms. Allocated memory was 176.2 MB in the beginning and 490.7 MB in the end (delta: 314.6 MB). Free memory was 139.4 MB in the beginning and 375.1 MB in the end (delta: -235.7 MB). Peak memory consumption was 79.9 MB. Max. memory is 8.0 GB. [2021-07-09 17:52:54,600 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.10 ms. Allocated memory is still 176.2 MB. Free memory is still 157.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 20.63 ms. Allocated memory is still 176.2 MB. Free memory was 156.0 MB in the beginning and 154.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 8.88 ms. Allocated memory is still 176.2 MB. Free memory was 154.6 MB in the beginning and 153.7 MB in the end (delta: 868.4 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 238.45 ms. Allocated memory is still 176.2 MB. Free memory was 153.6 MB in the beginning and 139.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4863.70 ms. Allocated memory was 176.2 MB in the beginning and 490.7 MB in the end (delta: 314.6 MB). Free memory was 139.4 MB in the beginning and 375.1 MB in the end (delta: -235.7 MB). Peak memory consumption was 79.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 68 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4799.3ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 89.1ms, AutomataDifference: 2639.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 156.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1037 SDtfs, 1535 SDslu, 3231 SDs, 0 SdLazy, 3288 SolverSat, 578 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1300.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 651.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2547occurred in iteration=7, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 878.4ms AutomataMinimizationTime, 20 MinimizatonAttempts, 22320 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.0ms SsaConstructionTime, 100.1ms SatisfiabilityAnalysisTime, 739.2ms InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...