/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 22:37:44,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 22:37:44,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 22:37:45,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 22:37:45,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 22:37:45,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 22:37:45,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 22:37:45,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 22:37:45,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 22:37:45,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 22:37:45,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 22:37:45,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 22:37:45,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 22:37:45,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 22:37:45,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 22:37:45,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 22:37:45,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 22:37:45,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 22:37:45,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 22:37:45,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 22:37:45,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 22:37:45,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 22:37:45,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 22:37:45,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 22:37:45,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 22:37:45,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 22:37:45,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 22:37:45,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 22:37:45,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 22:37:45,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 22:37:45,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 22:37:45,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 22:37:45,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 22:37:45,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 22:37:45,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 22:37:45,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 22:37:45,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 22:37:45,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 22:37:45,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 22:37:45,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 22:37:45,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 22:37:45,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 22:37:45,115 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 22:37:45,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 22:37:45,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 22:37:45,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 22:37:45,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 22:37:45,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 22:37:45,119 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 22:37:45,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 22:37:45,120 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 22:37:45,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 22:37:45,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 22:37:45,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 22:37:45,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 22:37:45,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 22:37:45,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 22:37:45,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 22:37:45,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 22:37:45,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 22:37:45,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 22:37:45,443 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 22:37:45,444 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 22:37:45,445 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-06-05 22:37:45,445 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl' [2021-06-05 22:37:45,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 22:37:45,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 22:37:45,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 22:37:45,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 22:37:45,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 22:37:45,497 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 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,502 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 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 22:37:45,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 22:37:45,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 22:37:45,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 22:37:45,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... [2021-06-05 22:37:45,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 22:37:45,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 22:37:45,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 22:37:45,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 22:37:45,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 22:37:45,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 22:37:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 22:37:45,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 22:37:45,580 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 22:37:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 22:37:45,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 22:37:45,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 22:37:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 22:37:45,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 22:37:45,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 22:37:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 22:37:45,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 22:37:45,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-05 22:37:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-05 22:37:45,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-05 22:37:45,583 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 22:37:45,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 22:37:45,752 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 22:37:45,753 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:37:45 BoogieIcfgContainer [2021-06-05 22:37:45,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 22:37:45,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 22:37:45,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 22:37:45,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 22:37:45,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:37:45" (1/2) ... [2021-06-05 22:37:45,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356798af and model type ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:37:45, skipping insertion in model container [2021-06-05 22:37:45,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:37:45" (2/2) ... [2021-06-05 22:37:45,760 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.bpl [2021-06-05 22:37:45,765 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 22:37:45,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 22:37:45,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 22:37:45,766 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 22:37:45,849 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 22:37:45,882 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 22:37:45,898 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 22:37:45,898 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 22:37:45,899 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 22:37:45,899 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 22:37:45,899 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 22:37:45,899 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 22:37:45,899 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 22:37:45,899 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 22:37:45,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 38 transitions, 108 flow [2021-06-05 22:37:46,070 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2078 states, 2076 states have (on average 3.352601156069364) internal successors, (6960), 2077 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 2078 states, 2076 states have (on average 3.352601156069364) internal successors, (6960), 2077 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:46,104 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:46,105 INFO L554 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-06-05 22:37:46,105 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash 787356711, now seen corresponding path program 1 times [2021-06-05 22:37:46,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:46,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690849079] [2021-06-05 22:37:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:46,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:46,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690849079] [2021-06-05 22:37:46,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690849079] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:46,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:46,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:37:46,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12585238] [2021-06-05 22:37:46,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:37:46,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:37:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:37:46,341 INFO L87 Difference]: Start difference. First operand has 2078 states, 2076 states have (on average 3.352601156069364) internal successors, (6960), 2077 states have internal predecessors, (6960), 0 states have call successors, (0), 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-06-05 22:37:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:46,555 INFO L93 Difference]: Finished difference Result 4667 states and 14949 transitions. [2021-06-05 22:37:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:37:46,557 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-06-05 22:37:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:46,606 INFO L225 Difference]: With dead ends: 4667 [2021-06-05 22:37:46,606 INFO L226 Difference]: Without dead ends: 4667 [2021-06-05 22:37:46,607 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2021-06-05 22:37:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 2700. [2021-06-05 22:37:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 3.277510188958874) internal successors, (8846), 2699 states have internal predecessors, (8846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8846 transitions. [2021-06-05 22:37:46,819 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8846 transitions. Word has length 32 [2021-06-05 22:37:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:46,820 INFO L482 AbstractCegarLoop]: Abstraction has 2700 states and 8846 transitions. [2021-06-05 22:37:46,820 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-06-05 22:37:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8846 transitions. [2021-06-05 22:37:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:46,832 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:46,832 INFO L554 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-06-05 22:37:46,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 22:37:46,833 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:46,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1842621179, now seen corresponding path program 2 times [2021-06-05 22:37:46,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:46,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238097470] [2021-06-05 22:37:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:46,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:46,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238097470] [2021-06-05 22:37:46,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238097470] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:46,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:46,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:37:46,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890887058] [2021-06-05 22:37:46,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:37:46,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:37:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:37:47,002 INFO L87 Difference]: Start difference. First operand 2700 states and 8846 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-06-05 22:37:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:47,127 INFO L93 Difference]: Finished difference Result 3934 states and 12791 transitions. [2021-06-05 22:37:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:37:47,127 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-06-05 22:37:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:47,142 INFO L225 Difference]: With dead ends: 3934 [2021-06-05 22:37:47,142 INFO L226 Difference]: Without dead ends: 2423 [2021-06-05 22:37:47,143 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:37:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-06-05 22:37:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2021-06-05 22:37:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2422 states have (on average 3.1643270024772914) internal successors, (7664), 2422 states have internal predecessors, (7664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 7664 transitions. [2021-06-05 22:37:47,224 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 7664 transitions. Word has length 32 [2021-06-05 22:37:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:47,225 INFO L482 AbstractCegarLoop]: Abstraction has 2423 states and 7664 transitions. [2021-06-05 22:37:47,225 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-06-05 22:37:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 7664 transitions. [2021-06-05 22:37:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:47,234 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:47,235 INFO L554 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-06-05 22:37:47,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 22:37:47,235 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1286075353, now seen corresponding path program 3 times [2021-06-05 22:37:47,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:47,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551985248] [2021-06-05 22:37:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:47,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:47,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551985248] [2021-06-05 22:37:47,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551985248] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:47,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:47,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:37:47,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904411201] [2021-06-05 22:37:47,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:37:47,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:37:47,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:37:47,314 INFO L87 Difference]: Start difference. First operand 2423 states and 7664 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-06-05 22:37:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:47,421 INFO L93 Difference]: Finished difference Result 3808 states and 11495 transitions. [2021-06-05 22:37:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:37:47,422 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-06-05 22:37:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:47,441 INFO L225 Difference]: With dead ends: 3808 [2021-06-05 22:37:47,441 INFO L226 Difference]: Without dead ends: 3752 [2021-06-05 22:37:47,442 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2021-06-05 22:37:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2380. [2021-06-05 22:37:47,514 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-06-05 22:37:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7259 transitions. [2021-06-05 22:37:47,524 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7259 transitions. Word has length 32 [2021-06-05 22:37:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:47,525 INFO L482 AbstractCegarLoop]: Abstraction has 2380 states and 7259 transitions. [2021-06-05 22:37:47,525 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-06-05 22:37:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7259 transitions. [2021-06-05 22:37:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:47,533 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:47,534 INFO L554 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-06-05 22:37:47,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 22:37:47,534 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:47,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:47,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2011746665, now seen corresponding path program 4 times [2021-06-05 22:37:47,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:47,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469557011] [2021-06-05 22:37:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:47,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:47,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469557011] [2021-06-05 22:37:47,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469557011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:47,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:47,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:37:47,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487531891] [2021-06-05 22:37:47,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:37:47,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:37:47,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:47,582 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-06-05 22:37:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:47,714 INFO L93 Difference]: Finished difference Result 4077 states and 12080 transitions. [2021-06-05 22:37:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:37:47,714 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-06-05 22:37:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:47,735 INFO L225 Difference]: With dead ends: 4077 [2021-06-05 22:37:47,735 INFO L226 Difference]: Without dead ends: 4041 [2021-06-05 22:37:47,735 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2021-06-05 22:37:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 2490. [2021-06-05 22:37:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2489 states have (on average 3.0168742466854157) internal successors, (7509), 2489 states have internal predecessors, (7509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 7509 transitions. [2021-06-05 22:37:47,842 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 7509 transitions. Word has length 32 [2021-06-05 22:37:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:47,842 INFO L482 AbstractCegarLoop]: Abstraction has 2490 states and 7509 transitions. [2021-06-05 22:37:47,843 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-06-05 22:37:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 7509 transitions. [2021-06-05 22:37:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:47,849 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:47,849 INFO L554 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-06-05 22:37:47,849 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 22:37:47,849 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash -825173561, now seen corresponding path program 5 times [2021-06-05 22:37:47,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:47,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328362984] [2021-06-05 22:37:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:47,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:47,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328362984] [2021-06-05 22:37:47,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328362984] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:47,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:47,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:47,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846023324] [2021-06-05 22:37:47,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:47,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:47,900 INFO L87 Difference]: Start difference. First operand 2490 states and 7509 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-06-05 22:37:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:48,074 INFO L93 Difference]: Finished difference Result 4317 states and 12598 transitions. [2021-06-05 22:37:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:48,075 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-06-05 22:37:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:48,088 INFO L225 Difference]: With dead ends: 4317 [2021-06-05 22:37:48,088 INFO L226 Difference]: Without dead ends: 4233 [2021-06-05 22:37:48,089 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2021-06-05 22:37:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2600. [2021-06-05 22:37:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2599 states have (on average 2.981916121585225) internal successors, (7750), 2599 states have internal predecessors, (7750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 7750 transitions. [2021-06-05 22:37:48,172 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 7750 transitions. Word has length 32 [2021-06-05 22:37:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:48,173 INFO L482 AbstractCegarLoop]: Abstraction has 2600 states and 7750 transitions. [2021-06-05 22:37:48,173 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-06-05 22:37:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 7750 transitions. [2021-06-05 22:37:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:48,179 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:48,179 INFO L554 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-06-05 22:37:48,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 22:37:48,180 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:48,180 INFO L82 PathProgramCache]: Analyzing trace with hash 963710857, now seen corresponding path program 6 times [2021-06-05 22:37:48,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:48,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380512338] [2021-06-05 22:37:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:48,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:48,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380512338] [2021-06-05 22:37:48,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380512338] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:48,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:48,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:37:48,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914789232] [2021-06-05 22:37:48,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:37:48,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:48,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:37:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:48,220 INFO L87 Difference]: Start difference. First operand 2600 states and 7750 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-06-05 22:37:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:48,358 INFO L93 Difference]: Finished difference Result 4214 states and 12236 transitions. [2021-06-05 22:37:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:37:48,359 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-06-05 22:37:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:48,379 INFO L225 Difference]: With dead ends: 4214 [2021-06-05 22:37:48,379 INFO L226 Difference]: Without dead ends: 4134 [2021-06-05 22:37:48,379 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2021-06-05 22:37:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 2536. [2021-06-05 22:37:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 2.967258382642998) internal successors, (7522), 2535 states have internal predecessors, (7522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 7522 transitions. [2021-06-05 22:37:48,505 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 7522 transitions. Word has length 32 [2021-06-05 22:37:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:48,505 INFO L482 AbstractCegarLoop]: Abstraction has 2536 states and 7522 transitions. [2021-06-05 22:37:48,510 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-06-05 22:37:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 7522 transitions. [2021-06-05 22:37:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:48,517 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:48,517 INFO L554 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-06-05 22:37:48,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 22:37:48,518 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1616434151, now seen corresponding path program 7 times [2021-06-05 22:37:48,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:48,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448950519] [2021-06-05 22:37:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:48,589 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:48,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448950519] [2021-06-05 22:37:48,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448950519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:48,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:48,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:48,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087819165] [2021-06-05 22:37:48,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:48,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:48,592 INFO L87 Difference]: Start difference. First operand 2536 states and 7522 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-06-05 22:37:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:48,785 INFO L93 Difference]: Finished difference Result 4317 states and 12421 transitions. [2021-06-05 22:37:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:48,786 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-06-05 22:37:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:48,798 INFO L225 Difference]: With dead ends: 4317 [2021-06-05 22:37:48,798 INFO L226 Difference]: Without dead ends: 4149 [2021-06-05 22:37:48,799 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2021-06-05 22:37:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2547. [2021-06-05 22:37:48,876 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-06-05 22:37:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 7529 transitions. [2021-06-05 22:37:48,885 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 7529 transitions. Word has length 32 [2021-06-05 22:37:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:48,886 INFO L482 AbstractCegarLoop]: Abstraction has 2547 states and 7529 transitions. [2021-06-05 22:37:48,886 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-06-05 22:37:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 7529 transitions. [2021-06-05 22:37:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:48,893 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:48,893 INFO L554 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-06-05 22:37:48,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 22:37:48,894 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1231933723, now seen corresponding path program 8 times [2021-06-05 22:37:48,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:48,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038381070] [2021-06-05 22:37:48,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:48,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:48,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038381070] [2021-06-05 22:37:48,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038381070] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:48,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:48,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:37:48,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056648164] [2021-06-05 22:37:48,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:37:48,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:37:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:37:48,954 INFO L87 Difference]: Start difference. First operand 2547 states and 7529 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-06-05 22:37:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:49,051 INFO L93 Difference]: Finished difference Result 3325 states and 9273 transitions. [2021-06-05 22:37:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:37:49,051 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-06-05 22:37:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:49,060 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 22:37:49,060 INFO L226 Difference]: Without dead ends: 3249 [2021-06-05 22:37:49,060 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.6ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2021-06-05 22:37:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2124. [2021-06-05 22:37:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 2.7960433349034384) internal successors, (5936), 2123 states have internal predecessors, (5936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 5936 transitions. [2021-06-05 22:37:49,116 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 5936 transitions. Word has length 32 [2021-06-05 22:37:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:49,118 INFO L482 AbstractCegarLoop]: Abstraction has 2124 states and 5936 transitions. [2021-06-05 22:37:49,118 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-06-05 22:37:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 5936 transitions. [2021-06-05 22:37:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:49,123 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:49,123 INFO L554 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-06-05 22:37:49,123 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 22:37:49,123 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 937806951, now seen corresponding path program 9 times [2021-06-05 22:37:49,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:49,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775652554] [2021-06-05 22:37:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:49,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:49,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775652554] [2021-06-05 22:37:49,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775652554] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:49,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:49,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:49,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463158778] [2021-06-05 22:37:49,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:49,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:49,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:49,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:49,183 INFO L87 Difference]: Start difference. First operand 2124 states and 5936 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-06-05 22:37:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:49,319 INFO L93 Difference]: Finished difference Result 2967 states and 7732 transitions. [2021-06-05 22:37:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:49,320 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-06-05 22:37:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:49,327 INFO L225 Difference]: With dead ends: 2967 [2021-06-05 22:37:49,327 INFO L226 Difference]: Without dead ends: 2753 [2021-06-05 22:37:49,327 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2021-06-05 22:37:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1853. [2021-06-05 22:37:49,364 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-06-05 22:37:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4983 transitions. [2021-06-05 22:37:49,372 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4983 transitions. Word has length 32 [2021-06-05 22:37:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:49,372 INFO L482 AbstractCegarLoop]: Abstraction has 1853 states and 4983 transitions. [2021-06-05 22:37:49,372 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-06-05 22:37:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4983 transitions. [2021-06-05 22:37:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:49,376 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:49,376 INFO L554 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-06-05 22:37:49,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 22:37:49,376 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash -305941813, now seen corresponding path program 10 times [2021-06-05 22:37:49,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:49,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826492197] [2021-06-05 22:37:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:49,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:49,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826492197] [2021-06-05 22:37:49,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826492197] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:49,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:49,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:37:49,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360697725] [2021-06-05 22:37:49,420 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:37:49,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:49,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:37:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:49,421 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-06-05 22:37:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:49,555 INFO L93 Difference]: Finished difference Result 3075 states and 8070 transitions. [2021-06-05 22:37:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:37:49,555 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-06-05 22:37:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:49,563 INFO L225 Difference]: With dead ends: 3075 [2021-06-05 22:37:49,563 INFO L226 Difference]: Without dead ends: 3039 [2021-06-05 22:37:49,563 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:37:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2021-06-05 22:37:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1770. [2021-06-05 22:37:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 2.6602600339174676) internal successors, (4706), 1769 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 4706 transitions. [2021-06-05 22:37:49,615 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 4706 transitions. Word has length 32 [2021-06-05 22:37:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:49,615 INFO L482 AbstractCegarLoop]: Abstraction has 1770 states and 4706 transitions. [2021-06-05 22:37:49,615 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-06-05 22:37:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 4706 transitions. [2021-06-05 22:37:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:49,619 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:49,619 INFO L554 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-06-05 22:37:49,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 22:37:49,619 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1152105257, now seen corresponding path program 11 times [2021-06-05 22:37:49,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:49,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037237288] [2021-06-05 22:37:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:49,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:49,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037237288] [2021-06-05 22:37:49,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037237288] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:49,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:49,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:49,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303299540] [2021-06-05 22:37:49,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:49,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:49,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:49,685 INFO L87 Difference]: Start difference. First operand 1770 states and 4706 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-06-05 22:37:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:49,847 INFO L93 Difference]: Finished difference Result 2951 states and 7706 transitions. [2021-06-05 22:37:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:49,847 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-06-05 22:37:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:49,853 INFO L225 Difference]: With dead ends: 2951 [2021-06-05 22:37:49,853 INFO L226 Difference]: Without dead ends: 2867 [2021-06-05 22:37:49,853 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2021-06-05 22:37:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1710. [2021-06-05 22:37:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 2.641895845523698) internal successors, (4515), 1709 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4515 transitions. [2021-06-05 22:37:49,892 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4515 transitions. Word has length 32 [2021-06-05 22:37:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:49,893 INFO L482 AbstractCegarLoop]: Abstraction has 1710 states and 4515 transitions. [2021-06-05 22:37:49,893 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-06-05 22:37:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4515 transitions. [2021-06-05 22:37:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:49,897 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:49,898 INFO L554 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-06-05 22:37:49,898 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 22:37:49,898 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash -82367707, now seen corresponding path program 12 times [2021-06-05 22:37:49,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:49,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627686155] [2021-06-05 22:37:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:49,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:49,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627686155] [2021-06-05 22:37:49,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627686155] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:49,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:49,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:37:49,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266464888] [2021-06-05 22:37:49,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:37:49,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:49,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:37:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:37:49,955 INFO L87 Difference]: Start difference. First operand 1710 states and 4515 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-06-05 22:37:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:50,186 INFO L93 Difference]: Finished difference Result 2931 states and 7585 transitions. [2021-06-05 22:37:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:37:50,187 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-06-05 22:37:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:50,192 INFO L225 Difference]: With dead ends: 2931 [2021-06-05 22:37:50,192 INFO L226 Difference]: Without dead ends: 2856 [2021-06-05 22:37:50,193 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 69.8ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:37:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2021-06-05 22:37:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1711. [2021-06-05 22:37:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1710 states have (on average 2.6187134502923977) internal successors, (4478), 1710 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 4478 transitions. [2021-06-05 22:37:50,230 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 4478 transitions. Word has length 32 [2021-06-05 22:37:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:50,230 INFO L482 AbstractCegarLoop]: Abstraction has 1711 states and 4478 transitions. [2021-06-05 22:37:50,230 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-06-05 22:37:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 4478 transitions. [2021-06-05 22:37:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:50,233 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:50,233 INFO L554 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-06-05 22:37:50,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 22:37:50,233 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2009032939, now seen corresponding path program 13 times [2021-06-05 22:37:50,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:50,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133840522] [2021-06-05 22:37:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:50,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:50,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133840522] [2021-06-05 22:37:50,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133840522] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:50,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:50,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 22:37:50,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139641945] [2021-06-05 22:37:50,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:37:50,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:50,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:37:50,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:50,271 INFO L87 Difference]: Start difference. First operand 1711 states and 4478 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-06-05 22:37:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:50,408 INFO L93 Difference]: Finished difference Result 2936 states and 7562 transitions. [2021-06-05 22:37:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:37:50,408 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-06-05 22:37:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:50,415 INFO L225 Difference]: With dead ends: 2936 [2021-06-05 22:37:50,415 INFO L226 Difference]: Without dead ends: 2888 [2021-06-05 22:37:50,416 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:37:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-06-05 22:37:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1687. [2021-06-05 22:37:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 2.601423487544484) internal successors, (4386), 1686 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4386 transitions. [2021-06-05 22:37:50,454 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4386 transitions. Word has length 32 [2021-06-05 22:37:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:50,454 INFO L482 AbstractCegarLoop]: Abstraction has 1687 states and 4386 transitions. [2021-06-05 22:37:50,454 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-06-05 22:37:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4386 transitions. [2021-06-05 22:37:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:50,457 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:50,457 INFO L554 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-06-05 22:37:50,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 22:37:50,458 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1633211063, now seen corresponding path program 14 times [2021-06-05 22:37:50,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:50,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521787638] [2021-06-05 22:37:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:50,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:50,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521787638] [2021-06-05 22:37:50,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521787638] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:50,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:50,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:50,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793298908] [2021-06-05 22:37:50,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:50,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:50,497 INFO L87 Difference]: Start difference. First operand 1687 states and 4386 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-06-05 22:37:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:50,651 INFO L93 Difference]: Finished difference Result 2900 states and 7440 transitions. [2021-06-05 22:37:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:50,652 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-06-05 22:37:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:50,658 INFO L225 Difference]: With dead ends: 2900 [2021-06-05 22:37:50,658 INFO L226 Difference]: Without dead ends: 2732 [2021-06-05 22:37:50,658 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2021-06-05 22:37:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1615. [2021-06-05 22:37:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 2.587360594795539) internal successors, (4176), 1614 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 4176 transitions. [2021-06-05 22:37:50,691 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 4176 transitions. Word has length 32 [2021-06-05 22:37:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:50,691 INFO L482 AbstractCegarLoop]: Abstraction has 1615 states and 4176 transitions. [2021-06-05 22:37:50,691 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-06-05 22:37:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 4176 transitions. [2021-06-05 22:37:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:50,694 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:50,694 INFO L554 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-06-05 22:37:50,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 22:37:50,695 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash 903157061, now seen corresponding path program 15 times [2021-06-05 22:37:50,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:50,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740928530] [2021-06-05 22:37:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:50,739 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:50,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740928530] [2021-06-05 22:37:50,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740928530] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:50,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:50,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:37:50,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476584756] [2021-06-05 22:37:50,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:37:50,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:37:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:37:50,740 INFO L87 Difference]: Start difference. First operand 1615 states and 4176 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-06-05 22:37:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:50,949 INFO L93 Difference]: Finished difference Result 2846 states and 7269 transitions. [2021-06-05 22:37:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:37:50,949 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-06-05 22:37:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:50,955 INFO L225 Difference]: With dead ends: 2846 [2021-06-05 22:37:50,955 INFO L226 Difference]: Without dead ends: 2642 [2021-06-05 22:37:50,955 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 68.3ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:37:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2021-06-05 22:37:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 1525. [2021-06-05 22:37:50,985 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-06-05 22:37:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 3961 transitions. [2021-06-05 22:37:50,988 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 3961 transitions. Word has length 32 [2021-06-05 22:37:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:50,989 INFO L482 AbstractCegarLoop]: Abstraction has 1525 states and 3961 transitions. [2021-06-05 22:37:50,989 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-06-05 22:37:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 3961 transitions. [2021-06-05 22:37:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:50,991 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:50,991 INFO L554 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-06-05 22:37:50,991 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 22:37:50,991 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash 106050727, now seen corresponding path program 16 times [2021-06-05 22:37:50,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:50,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625218142] [2021-06-05 22:37:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:51,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:51,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625218142] [2021-06-05 22:37:51,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625218142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:51,025 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:51,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:51,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804922574] [2021-06-05 22:37:51,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:51,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:51,026 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-06-05 22:37:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:51,159 INFO L93 Difference]: Finished difference Result 2648 states and 6780 transitions. [2021-06-05 22:37:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:51,160 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-06-05 22:37:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:51,165 INFO L225 Difference]: With dead ends: 2648 [2021-06-05 22:37:51,166 INFO L226 Difference]: Without dead ends: 2576 [2021-06-05 22:37:51,166 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-06-05 22:37:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1464. [2021-06-05 22:37:51,193 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-06-05 22:37:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 3745 transitions. [2021-06-05 22:37:51,196 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 3745 transitions. Word has length 32 [2021-06-05 22:37:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:51,196 INFO L482 AbstractCegarLoop]: Abstraction has 1464 states and 3745 transitions. [2021-06-05 22:37:51,196 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-06-05 22:37:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 3745 transitions. [2021-06-05 22:37:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:51,198 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:51,199 INFO L554 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-06-05 22:37:51,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 22:37:51,199 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash 522378757, now seen corresponding path program 17 times [2021-06-05 22:37:51,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:51,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671530792] [2021-06-05 22:37:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:51,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:51,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671530792] [2021-06-05 22:37:51,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671530792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:51,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:51,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:37:51,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557109055] [2021-06-05 22:37:51,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:37:51,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:51,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:37:51,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:37:51,249 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-06-05 22:37:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:51,443 INFO L93 Difference]: Finished difference Result 2588 states and 6572 transitions. [2021-06-05 22:37:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:37:51,444 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-06-05 22:37:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:51,449 INFO L225 Difference]: With dead ends: 2588 [2021-06-05 22:37:51,449 INFO L226 Difference]: Without dead ends: 2505 [2021-06-05 22:37:51,449 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:37:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-06-05 22:37:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1418. [2021-06-05 22:37:51,475 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-06-05 22:37:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3652 transitions. [2021-06-05 22:37:51,478 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3652 transitions. Word has length 32 [2021-06-05 22:37:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:51,478 INFO L482 AbstractCegarLoop]: Abstraction has 1418 states and 3652 transitions. [2021-06-05 22:37:51,478 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-06-05 22:37:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3652 transitions. [2021-06-05 22:37:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:51,481 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:51,481 INFO L554 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-06-05 22:37:51,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 22:37:51,481 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682419, now seen corresponding path program 18 times [2021-06-05 22:37:51,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:51,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956294417] [2021-06-05 22:37:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:51,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:51,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956294417] [2021-06-05 22:37:51,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956294417] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:51,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:51,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:37:51,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125459993] [2021-06-05 22:37:51,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 22:37:51,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 22:37:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 22:37:51,508 INFO L87 Difference]: Start difference. First operand 1418 states and 3652 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-06-05 22:37:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:51,586 INFO L93 Difference]: Finished difference Result 1501 states and 3704 transitions. [2021-06-05 22:37:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:37:51,587 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-06-05 22:37:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:51,589 INFO L225 Difference]: With dead ends: 1501 [2021-06-05 22:37:51,589 INFO L226 Difference]: Without dead ends: 1329 [2021-06-05 22:37:51,589 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:37:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-06-05 22:37:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 754. [2021-06-05 22:37:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.4674634794156707) internal successors, (1858), 753 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1858 transitions. [2021-06-05 22:37:51,604 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1858 transitions. Word has length 32 [2021-06-05 22:37:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:51,604 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 1858 transitions. [2021-06-05 22:37:51,604 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-06-05 22:37:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1858 transitions. [2021-06-05 22:37:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:51,605 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:51,605 INFO L554 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-06-05 22:37:51,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 22:37:51,605 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1438292239, now seen corresponding path program 19 times [2021-06-05 22:37:51,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:51,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371384384] [2021-06-05 22:37:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:51,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:51,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371384384] [2021-06-05 22:37:51,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371384384] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:51,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:51,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:37:51,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593938898] [2021-06-05 22:37:51,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:37:51,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:51,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:37:51,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:37:51,640 INFO L87 Difference]: Start difference. First operand 754 states and 1858 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-06-05 22:37:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:51,751 INFO L93 Difference]: Finished difference Result 478 states and 1000 transitions. [2021-06-05 22:37:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 22:37:51,752 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-06-05 22:37:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:51,752 INFO L225 Difference]: With dead ends: 478 [2021-06-05 22:37:51,752 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 22:37:51,753 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 37.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:37:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 22:37:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2021-06-05 22:37:51,755 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-06-05 22:37:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 349 transitions. [2021-06-05 22:37:51,756 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 349 transitions. Word has length 32 [2021-06-05 22:37:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:51,756 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 349 transitions. [2021-06-05 22:37:51,756 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-06-05 22:37:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 349 transitions. [2021-06-05 22:37:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 22:37:51,756 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:37:51,757 INFO L554 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-06-05 22:37:51,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 22:37:51,757 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:37:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:37:51,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2002098131, now seen corresponding path program 20 times [2021-06-05 22:37:51,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:37:51,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859625937] [2021-06-05 22:37:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:37:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:37:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:37:51,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:37:51,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859625937] [2021-06-05 22:37:51,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859625937] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:37:51,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:37:51,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:37:51,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227637835] [2021-06-05 22:37:51,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:37:51,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:37:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:37:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:37:51,799 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-06-05 22:37:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:37:51,887 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2021-06-05 22:37:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:37:51,887 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-06-05 22:37:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:37:51,887 INFO L225 Difference]: With dead ends: 105 [2021-06-05 22:37:51,888 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 22:37:51,888 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 54.9ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:37:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 22:37:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 22:37:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:37:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 22:37:51,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-06-05 22:37:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:37:51,888 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 22:37:51,888 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-06-05 22:37:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 22:37:51,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 22:37:51,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 22:37:51,891 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 22:37:51,893 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:37:51 BasicIcfg [2021-06-05 22:37:51,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 22:37:51,893 INFO L168 Benchmark]: Toolchain (without parser) took 6406.16 ms. Allocated memory was 320.9 MB in the beginning and 461.4 MB in the end (delta: 140.5 MB). Free memory was 300.4 MB in the beginning and 359.4 MB in the end (delta: -59.0 MB). Peak memory consumption was 83.6 MB. Max. memory is 16.0 GB. [2021-06-05 22:37:51,894 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 320.9 MB. Free memory was 301.5 MB in the beginning and 301.4 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 22:37:51,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.17 ms. Allocated memory is still 320.9 MB. Free memory was 300.3 MB in the beginning and 298.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 22:37:51,894 INFO L168 Benchmark]: Boogie Preprocessor took 11.43 ms. Allocated memory is still 320.9 MB. Free memory was 298.8 MB in the beginning and 297.9 MB in the end (delta: 918.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 22:37:51,894 INFO L168 Benchmark]: RCFGBuilder took 231.33 ms. Allocated memory is still 320.9 MB. Free memory was 297.8 MB in the beginning and 284.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-05 22:37:51,894 INFO L168 Benchmark]: TraceAbstraction took 6137.86 ms. Allocated memory was 320.9 MB in the beginning and 461.4 MB in the end (delta: 140.5 MB). Free memory was 283.5 MB in the beginning and 359.4 MB in the end (delta: -75.9 MB). Peak memory consumption was 64.7 MB. Max. memory is 16.0 GB. [2021-06-05 22:37:51,895 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.13 ms. Allocated memory is still 320.9 MB. Free memory was 301.5 MB in the beginning and 301.4 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 21.17 ms. Allocated memory is still 320.9 MB. Free memory was 300.3 MB in the beginning and 298.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 11.43 ms. Allocated memory is still 320.9 MB. Free memory was 298.8 MB in the beginning and 297.9 MB in the end (delta: 918.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 231.33 ms. Allocated memory is still 320.9 MB. Free memory was 297.8 MB in the beginning and 284.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6137.86 ms. Allocated memory was 320.9 MB in the beginning and 461.4 MB in the end (delta: 140.5 MB). Free memory was 283.5 MB in the beginning and 359.4 MB in the end (delta: -75.9 MB). Peak memory consumption was 64.7 MB. Max. memory is 16.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: 5992.8ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 121.4ms, AutomataDifference: 3228.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 170.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1031 SDtfs, 1435 SDslu, 3257 SDs, 0 SdLazy, 3289 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1580.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 772.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2700occurred in iteration=1, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1172.0ms AutomataMinimizationTime, 20 MinimizatonAttempts, 21600 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.4ms SsaConstructionTime, 141.4ms SatisfiabilityAnalysisTime, 897.4ms InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 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...