/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 20:40:49,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 20:40:49,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 20:40:49,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 20:40:49,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 20:40:49,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 20:40:49,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 20:40:49,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 20:40:49,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 20:40:49,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 20:40:49,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 20:40:49,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 20:40:49,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 20:40:49,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 20:40:49,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 20:40:49,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 20:40:49,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 20:40:49,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 20:40:49,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 20:40:49,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 20:40:49,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 20:40:49,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 20:40:49,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 20:40:49,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 20:40:49,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 20:40:49,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 20:40:49,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 20:40:49,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 20:40:49,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 20:40:49,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 20:40:49,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 20:40:49,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 20:40:49,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 20:40:49,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 20:40:49,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 20:40:49,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 20:40:49,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 20:40:49,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 20:40:49,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 20:40:49,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 20:40:49,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 20:40:49,986 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-12 20:40:50,006 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 20:40:50,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 20:40:50,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 20:40:50,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 20:40:50,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 20:40:50,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 20:40:50,008 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 20:40:50,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 20:40:50,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 20:40:50,010 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 20:40:50,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 20:40:50,010 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 20:40:50,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 20:40:50,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 20:40:50,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 20:40:50,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 20:40:50,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 20:40:50,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 20:40:50,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 20:40:50,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 20:40:50,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 20:40:50,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 20:40:50,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 20:40:50,012 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 20:40:50,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 20:40:50,012 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-12 20:40:50,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 20:40:50,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 20:40:50,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 20:40:50,332 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-12 20:40:50,333 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-12 20:40:50,333 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-12 20:40:50,334 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-12 20:40:50,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 20:40:50,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-12 20:40:50,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 20:40:50,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 20:40:50,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 20:40:50,378 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 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,385 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 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 20:40:50,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 20:40:50,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 20:40:50,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 20:40:50,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/1) ... [2021-06-12 20:40:50,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 20:40:50,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 20:40:50,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 20:40:50,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 20:40:50,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (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-12 20:40:50,476 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-12 20:40:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-12 20:40:50,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-12 20:40:50,477 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-12 20:40:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-12 20:40:50,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-12 20:40:50,477 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-12 20:40:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 20:40:50,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 20:40:50,477 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-12 20:40:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-12 20:40:50,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-12 20:40:50,478 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-12 20:40:50,478 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-12 20:40:50,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-12 20:40:50,478 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 20:40:50,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 20:40:50,661 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-12 20:40:50,680 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 08:40:50 BoogieIcfgContainer [2021-06-12 20:40:50,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 20:40:50,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 20:40:50,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 20:40:50,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 20:40:50,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:40:50" (1/2) ... [2021-06-12 20:40:50,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e95174 and model type ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 08:40:50, skipping insertion in model container [2021-06-12 20:40:50,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 08:40:50" (2/2) ... [2021-06-12 20:40:50,686 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.bpl [2021-06-12 20:40:50,690 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 20:40:50,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 20:40:50,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-12 20:40:50,691 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 20:40:50,751 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-12 20:40:50,767 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-12 20:40:50,781 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:40:50,781 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:40:50,781 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:40:50,781 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:40:50,782 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:40:50,782 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:40:50,782 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:40:50,782 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 20:40:50,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 38 transitions, 108 flow [2021-06-12 20:40:50,951 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-12 20:40:50,958 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-12 20:40:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:50,985 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:50,986 INFO L472 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-12 20:40:50,987 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:50,994 INFO L82 PathProgramCache]: Analyzing trace with hash 787356711, now seen corresponding path program 1 times [2021-06-12 20:40:51,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:51,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526289564] [2021-06-12 20:40:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:51,263 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-12 20:40:51,263 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:51,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526289564] [2021-06-12 20:40:51,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526289564] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:51,264 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:51,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:40:51,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050673307] [2021-06-12 20:40:51,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:40:51,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:40:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:40:51,295 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-12 20:40:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:51,522 INFO L93 Difference]: Finished difference Result 4667 states and 14949 transitions. [2021-06-12 20:40:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:40:51,524 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-12 20:40:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:51,572 INFO L225 Difference]: With dead ends: 4667 [2021-06-12 20:40:51,572 INFO L226 Difference]: Without dead ends: 4667 [2021-06-12 20:40:51,574 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2021-06-12 20:40:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 2700. [2021-06-12 20:40:51,750 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-12 20:40:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8846 transitions. [2021-06-12 20:40:51,765 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8846 transitions. Word has length 32 [2021-06-12 20:40:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:51,766 INFO L482 AbstractCegarLoop]: Abstraction has 2700 states and 8846 transitions. [2021-06-12 20:40:51,767 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-12 20:40:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8846 transitions. [2021-06-12 20:40:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:51,778 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:51,778 INFO L472 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-12 20:40:51,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 20:40:51,778 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1842621179, now seen corresponding path program 2 times [2021-06-12 20:40:51,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:51,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478364054] [2021-06-12 20:40:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:51,944 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-12 20:40:51,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:51,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478364054] [2021-06-12 20:40:51,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478364054] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:51,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:51,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:40:51,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379107921] [2021-06-12 20:40:51,947 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:40:51,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:51,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:40:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:40:51,948 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-12 20:40:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:52,007 INFO L93 Difference]: Finished difference Result 3934 states and 12791 transitions. [2021-06-12 20:40:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:40:52,008 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-12 20:40:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:52,021 INFO L225 Difference]: With dead ends: 3934 [2021-06-12 20:40:52,022 INFO L226 Difference]: Without dead ends: 2423 [2021-06-12 20:40:52,022 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:40:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-06-12 20:40:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2021-06-12 20:40:52,084 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-12 20:40:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 7664 transitions. [2021-06-12 20:40:52,095 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 7664 transitions. Word has length 32 [2021-06-12 20:40:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:52,095 INFO L482 AbstractCegarLoop]: Abstraction has 2423 states and 7664 transitions. [2021-06-12 20:40:52,096 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-12 20:40:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 7664 transitions. [2021-06-12 20:40:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:52,104 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:52,105 INFO L472 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-12 20:40:52,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 20:40:52,106 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1286075353, now seen corresponding path program 3 times [2021-06-12 20:40:52,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:52,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523979348] [2021-06-12 20:40:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:52,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:52,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523979348] [2021-06-12 20:40:52,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523979348] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:52,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:52,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:40:52,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828424503] [2021-06-12 20:40:52,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:40:52,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:40:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:40:52,163 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-12 20:40:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:52,307 INFO L93 Difference]: Finished difference Result 3808 states and 11495 transitions. [2021-06-12 20:40:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:40:52,310 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-12 20:40:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:52,330 INFO L225 Difference]: With dead ends: 3808 [2021-06-12 20:40:52,330 INFO L226 Difference]: Without dead ends: 3752 [2021-06-12 20:40:52,335 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2021-06-12 20:40:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2380. [2021-06-12 20:40:52,444 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-12 20:40:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7259 transitions. [2021-06-12 20:40:52,453 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7259 transitions. Word has length 32 [2021-06-12 20:40:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:52,454 INFO L482 AbstractCegarLoop]: Abstraction has 2380 states and 7259 transitions. [2021-06-12 20:40:52,454 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-12 20:40:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7259 transitions. [2021-06-12 20:40:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:52,462 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:52,462 INFO L472 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-12 20:40:52,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 20:40:52,463 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2011746665, now seen corresponding path program 4 times [2021-06-12 20:40:52,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:52,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995988633] [2021-06-12 20:40:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:52,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:52,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995988633] [2021-06-12 20:40:52,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995988633] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:52,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:52,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:40:52,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920293308] [2021-06-12 20:40:52,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 20:40:52,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:52,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 20:40:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:52,556 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-12 20:40:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:52,689 INFO L93 Difference]: Finished difference Result 4077 states and 12080 transitions. [2021-06-12 20:40:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:40:52,689 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-12 20:40:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:52,724 INFO L225 Difference]: With dead ends: 4077 [2021-06-12 20:40:52,725 INFO L226 Difference]: Without dead ends: 4041 [2021-06-12 20:40:52,725 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 28.0ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2021-06-12 20:40:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 2490. [2021-06-12 20:40:52,807 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-12 20:40:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 7509 transitions. [2021-06-12 20:40:52,816 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 7509 transitions. Word has length 32 [2021-06-12 20:40:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:52,817 INFO L482 AbstractCegarLoop]: Abstraction has 2490 states and 7509 transitions. [2021-06-12 20:40:52,817 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-12 20:40:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 7509 transitions. [2021-06-12 20:40:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:52,823 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:52,823 INFO L472 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-12 20:40:52,823 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 20:40:52,823 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash -825173561, now seen corresponding path program 5 times [2021-06-12 20:40:52,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:52,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981040171] [2021-06-12 20:40:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:52,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:52,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981040171] [2021-06-12 20:40:52,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981040171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:52,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:52,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:52,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506012450] [2021-06-12 20:40:52,894 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:52,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:52,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:52,895 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-12 20:40:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:53,065 INFO L93 Difference]: Finished difference Result 4317 states and 12598 transitions. [2021-06-12 20:40:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:53,065 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-12 20:40:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:53,078 INFO L225 Difference]: With dead ends: 4317 [2021-06-12 20:40:53,078 INFO L226 Difference]: Without dead ends: 4233 [2021-06-12 20:40:53,078 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2021-06-12 20:40:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2600. [2021-06-12 20:40:53,141 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-12 20:40:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 7750 transitions. [2021-06-12 20:40:53,148 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 7750 transitions. Word has length 32 [2021-06-12 20:40:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:53,149 INFO L482 AbstractCegarLoop]: Abstraction has 2600 states and 7750 transitions. [2021-06-12 20:40:53,149 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-12 20:40:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 7750 transitions. [2021-06-12 20:40:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:53,155 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:53,155 INFO L472 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-12 20:40:53,155 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 20:40:53,155 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 963710857, now seen corresponding path program 6 times [2021-06-12 20:40:53,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:53,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16209060] [2021-06-12 20:40:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:53,192 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-12 20:40:53,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:53,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16209060] [2021-06-12 20:40:53,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16209060] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:53,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:53,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:40:53,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508289783] [2021-06-12 20:40:53,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 20:40:53,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 20:40:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:53,194 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-12 20:40:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:53,303 INFO L93 Difference]: Finished difference Result 4214 states and 12236 transitions. [2021-06-12 20:40:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:40:53,303 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-12 20:40:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:53,314 INFO L225 Difference]: With dead ends: 4214 [2021-06-12 20:40:53,314 INFO L226 Difference]: Without dead ends: 4134 [2021-06-12 20:40:53,314 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 22.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2021-06-12 20:40:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 2536. [2021-06-12 20:40:53,377 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-12 20:40:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 7522 transitions. [2021-06-12 20:40:53,384 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 7522 transitions. Word has length 32 [2021-06-12 20:40:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:53,385 INFO L482 AbstractCegarLoop]: Abstraction has 2536 states and 7522 transitions. [2021-06-12 20:40:53,385 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-12 20:40:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 7522 transitions. [2021-06-12 20:40:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:53,391 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:53,391 INFO L472 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-12 20:40:53,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 20:40:53,391 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1616434151, now seen corresponding path program 7 times [2021-06-12 20:40:53,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:53,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852325279] [2021-06-12 20:40:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:53,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:53,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852325279] [2021-06-12 20:40:53,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852325279] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:53,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:53,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:53,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087298061] [2021-06-12 20:40:53,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:53,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:53,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:53,459 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-12 20:40:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:53,630 INFO L93 Difference]: Finished difference Result 4317 states and 12421 transitions. [2021-06-12 20:40:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:53,631 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-12 20:40:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:53,641 INFO L225 Difference]: With dead ends: 4317 [2021-06-12 20:40:53,641 INFO L226 Difference]: Without dead ends: 4149 [2021-06-12 20:40:53,642 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2021-06-12 20:40:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2547. [2021-06-12 20:40:53,701 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-12 20:40:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 7529 transitions. [2021-06-12 20:40:53,708 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 7529 transitions. Word has length 32 [2021-06-12 20:40:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:53,708 INFO L482 AbstractCegarLoop]: Abstraction has 2547 states and 7529 transitions. [2021-06-12 20:40:53,708 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-12 20:40:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 7529 transitions. [2021-06-12 20:40:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:53,715 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:53,715 INFO L472 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-12 20:40:53,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 20:40:53,715 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1231933723, now seen corresponding path program 8 times [2021-06-12 20:40:53,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:53,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200808967] [2021-06-12 20:40:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:53,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:53,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200808967] [2021-06-12 20:40:53,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200808967] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:53,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:53,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:40:53,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623212210] [2021-06-12 20:40:53,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:40:53,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:53,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:40:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:40:53,776 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-12 20:40:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:53,863 INFO L93 Difference]: Finished difference Result 3325 states and 9273 transitions. [2021-06-12 20:40:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:40:53,864 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-12 20:40:53,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:53,871 INFO L225 Difference]: With dead ends: 3325 [2021-06-12 20:40:53,871 INFO L226 Difference]: Without dead ends: 3249 [2021-06-12 20:40:53,871 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2021-06-12 20:40:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2124. [2021-06-12 20:40:53,913 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-12 20:40:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 5936 transitions. [2021-06-12 20:40:53,918 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 5936 transitions. Word has length 32 [2021-06-12 20:40:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:53,919 INFO L482 AbstractCegarLoop]: Abstraction has 2124 states and 5936 transitions. [2021-06-12 20:40:53,919 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-12 20:40:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 5936 transitions. [2021-06-12 20:40:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:53,923 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:53,923 INFO L472 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-12 20:40:53,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 20:40:53,924 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:53,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash 937806951, now seen corresponding path program 9 times [2021-06-12 20:40:53,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:53,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030787801] [2021-06-12 20:40:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:53,974 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-12 20:40:53,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:53,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030787801] [2021-06-12 20:40:53,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030787801] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:53,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:53,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:53,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736561914] [2021-06-12 20:40:53,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:53,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:53,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:53,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:53,976 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-12 20:40:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:54,143 INFO L93 Difference]: Finished difference Result 2967 states and 7732 transitions. [2021-06-12 20:40:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:54,143 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-12 20:40:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:54,149 INFO L225 Difference]: With dead ends: 2967 [2021-06-12 20:40:54,149 INFO L226 Difference]: Without dead ends: 2753 [2021-06-12 20:40:54,149 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2021-06-12 20:40:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1853. [2021-06-12 20:40:54,182 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-12 20:40:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4983 transitions. [2021-06-12 20:40:54,186 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4983 transitions. Word has length 32 [2021-06-12 20:40:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:54,186 INFO L482 AbstractCegarLoop]: Abstraction has 1853 states and 4983 transitions. [2021-06-12 20:40:54,186 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-12 20:40:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4983 transitions. [2021-06-12 20:40:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:54,190 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:54,190 INFO L472 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-12 20:40:54,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 20:40:54,190 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -305941813, now seen corresponding path program 10 times [2021-06-12 20:40:54,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:54,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973513324] [2021-06-12 20:40:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:54,231 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-12 20:40:54,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:54,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973513324] [2021-06-12 20:40:54,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973513324] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:54,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:54,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:40:54,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805845416] [2021-06-12 20:40:54,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 20:40:54,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 20:40:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:54,232 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-12 20:40:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:54,378 INFO L93 Difference]: Finished difference Result 3075 states and 8070 transitions. [2021-06-12 20:40:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-12 20:40:54,379 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-12 20:40:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:54,384 INFO L225 Difference]: With dead ends: 3075 [2021-06-12 20:40:54,384 INFO L226 Difference]: Without dead ends: 3039 [2021-06-12 20:40:54,385 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.0ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-12 20:40:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2021-06-12 20:40:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1770. [2021-06-12 20:40:54,420 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-12 20:40:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 4706 transitions. [2021-06-12 20:40:54,424 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 4706 transitions. Word has length 32 [2021-06-12 20:40:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:54,425 INFO L482 AbstractCegarLoop]: Abstraction has 1770 states and 4706 transitions. [2021-06-12 20:40:54,425 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-12 20:40:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 4706 transitions. [2021-06-12 20:40:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:54,429 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:54,429 INFO L472 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-12 20:40:54,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 20:40:54,429 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1152105257, now seen corresponding path program 11 times [2021-06-12 20:40:54,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:54,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133998131] [2021-06-12 20:40:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:54,469 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-12 20:40:54,469 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:54,469 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133998131] [2021-06-12 20:40:54,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133998131] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:54,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:54,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:54,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64593066] [2021-06-12 20:40:54,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:54,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:54,471 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-12 20:40:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:54,641 INFO L93 Difference]: Finished difference Result 2951 states and 7706 transitions. [2021-06-12 20:40:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:54,641 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-12 20:40:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:54,646 INFO L225 Difference]: With dead ends: 2951 [2021-06-12 20:40:54,646 INFO L226 Difference]: Without dead ends: 2867 [2021-06-12 20:40:54,647 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 37.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2021-06-12 20:40:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1710. [2021-06-12 20:40:54,701 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-12 20:40:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4515 transitions. [2021-06-12 20:40:54,705 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4515 transitions. Word has length 32 [2021-06-12 20:40:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:54,705 INFO L482 AbstractCegarLoop]: Abstraction has 1710 states and 4515 transitions. [2021-06-12 20:40:54,705 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-12 20:40:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4515 transitions. [2021-06-12 20:40:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:54,708 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:54,708 INFO L472 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-12 20:40:54,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 20:40:54,708 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash -82367707, now seen corresponding path program 12 times [2021-06-12 20:40:54,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:54,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940688185] [2021-06-12 20:40:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:54,779 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-12 20:40:54,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:54,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940688185] [2021-06-12 20:40:54,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940688185] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:54,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:54,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 20:40:54,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920469068] [2021-06-12 20:40:54,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 20:40:54,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 20:40:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 20:40:54,782 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-12 20:40:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:55,007 INFO L93 Difference]: Finished difference Result 2931 states and 7585 transitions. [2021-06-12 20:40:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 20:40:55,008 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-12 20:40:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:55,014 INFO L225 Difference]: With dead ends: 2931 [2021-06-12 20:40:55,014 INFO L226 Difference]: Without dead ends: 2856 [2021-06-12 20:40:55,014 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-12 20:40:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2021-06-12 20:40:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1711. [2021-06-12 20:40:55,045 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-12 20:40:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 4478 transitions. [2021-06-12 20:40:55,048 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 4478 transitions. Word has length 32 [2021-06-12 20:40:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:55,048 INFO L482 AbstractCegarLoop]: Abstraction has 1711 states and 4478 transitions. [2021-06-12 20:40:55,049 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-12 20:40:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 4478 transitions. [2021-06-12 20:40:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:55,051 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:55,052 INFO L472 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-12 20:40:55,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 20:40:55,052 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2009032939, now seen corresponding path program 13 times [2021-06-12 20:40:55,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:55,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403996242] [2021-06-12 20:40:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:55,097 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-12 20:40:55,097 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:55,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403996242] [2021-06-12 20:40:55,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403996242] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:55,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:55,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:40:55,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833483476] [2021-06-12 20:40:55,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 20:40:55,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 20:40:55,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:55,099 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-12 20:40:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:55,222 INFO L93 Difference]: Finished difference Result 2936 states and 7562 transitions. [2021-06-12 20:40:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-12 20:40:55,222 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-12 20:40:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:55,229 INFO L225 Difference]: With dead ends: 2936 [2021-06-12 20:40:55,229 INFO L226 Difference]: Without dead ends: 2888 [2021-06-12 20:40:55,230 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-12 20:40:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-06-12 20:40:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1687. [2021-06-12 20:40:55,261 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-12 20:40:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4386 transitions. [2021-06-12 20:40:55,264 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4386 transitions. Word has length 32 [2021-06-12 20:40:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:55,264 INFO L482 AbstractCegarLoop]: Abstraction has 1687 states and 4386 transitions. [2021-06-12 20:40:55,264 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-12 20:40:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4386 transitions. [2021-06-12 20:40:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:55,267 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:55,267 INFO L472 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-12 20:40:55,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 20:40:55,268 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1633211063, now seen corresponding path program 14 times [2021-06-12 20:40:55,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:55,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416398461] [2021-06-12 20:40:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:55,310 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-12 20:40:55,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:55,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416398461] [2021-06-12 20:40:55,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416398461] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:55,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:55,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:55,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020523517] [2021-06-12 20:40:55,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:55,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:55,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:55,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:55,311 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-12 20:40:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:55,454 INFO L93 Difference]: Finished difference Result 2900 states and 7440 transitions. [2021-06-12 20:40:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:55,455 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-12 20:40:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:55,460 INFO L225 Difference]: With dead ends: 2900 [2021-06-12 20:40:55,460 INFO L226 Difference]: Without dead ends: 2732 [2021-06-12 20:40:55,461 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2021-06-12 20:40:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1615. [2021-06-12 20:40:55,486 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-12 20:40:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 4176 transitions. [2021-06-12 20:40:55,489 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 4176 transitions. Word has length 32 [2021-06-12 20:40:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:55,489 INFO L482 AbstractCegarLoop]: Abstraction has 1615 states and 4176 transitions. [2021-06-12 20:40:55,489 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-12 20:40:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 4176 transitions. [2021-06-12 20:40:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:55,491 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:55,492 INFO L472 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-12 20:40:55,492 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 20:40:55,492 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash 903157061, now seen corresponding path program 15 times [2021-06-12 20:40:55,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:55,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530678844] [2021-06-12 20:40:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:55,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:55,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530678844] [2021-06-12 20:40:55,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530678844] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:55,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:55,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 20:40:55,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279766090] [2021-06-12 20:40:55,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 20:40:55,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:55,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 20:40:55,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 20:40:55,534 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-12 20:40:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:55,711 INFO L93 Difference]: Finished difference Result 2846 states and 7269 transitions. [2021-06-12 20:40:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 20:40:55,711 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-12 20:40:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:55,717 INFO L225 Difference]: With dead ends: 2846 [2021-06-12 20:40:55,717 INFO L226 Difference]: Without dead ends: 2642 [2021-06-12 20:40:55,719 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 66.4ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-12 20:40:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2021-06-12 20:40:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 1525. [2021-06-12 20:40:55,744 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-12 20:40:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 3961 transitions. [2021-06-12 20:40:55,747 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 3961 transitions. Word has length 32 [2021-06-12 20:40:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:55,747 INFO L482 AbstractCegarLoop]: Abstraction has 1525 states and 3961 transitions. [2021-06-12 20:40:55,747 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-12 20:40:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 3961 transitions. [2021-06-12 20:40:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:55,749 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:55,749 INFO L472 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-12 20:40:55,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 20:40:55,750 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash 106050727, now seen corresponding path program 16 times [2021-06-12 20:40:55,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:55,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224996871] [2021-06-12 20:40:55,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:55,805 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-12 20:40:55,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:55,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224996871] [2021-06-12 20:40:55,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224996871] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:55,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:55,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:55,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796941295] [2021-06-12 20:40:55,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:55,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:55,807 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-12 20:40:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:55,953 INFO L93 Difference]: Finished difference Result 2648 states and 6780 transitions. [2021-06-12 20:40:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:55,953 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-12 20:40:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:55,957 INFO L225 Difference]: With dead ends: 2648 [2021-06-12 20:40:55,957 INFO L226 Difference]: Without dead ends: 2576 [2021-06-12 20:40:55,958 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-06-12 20:40:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1464. [2021-06-12 20:40:55,980 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-12 20:40:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 3745 transitions. [2021-06-12 20:40:55,983 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 3745 transitions. Word has length 32 [2021-06-12 20:40:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:55,983 INFO L482 AbstractCegarLoop]: Abstraction has 1464 states and 3745 transitions. [2021-06-12 20:40:55,983 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-12 20:40:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 3745 transitions. [2021-06-12 20:40:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:55,986 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:55,986 INFO L472 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-12 20:40:55,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 20:40:55,986 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:55,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash 522378757, now seen corresponding path program 17 times [2021-06-12 20:40:55,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:55,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894024058] [2021-06-12 20:40:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:40:56,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:56,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894024058] [2021-06-12 20:40:56,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894024058] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:56,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:56,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 20:40:56,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542396417] [2021-06-12 20:40:56,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 20:40:56,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 20:40:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 20:40:56,033 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-12 20:40:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:56,244 INFO L93 Difference]: Finished difference Result 2588 states and 6572 transitions. [2021-06-12 20:40:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 20:40:56,244 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-12 20:40:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:56,247 INFO L225 Difference]: With dead ends: 2588 [2021-06-12 20:40:56,247 INFO L226 Difference]: Without dead ends: 2505 [2021-06-12 20:40:56,248 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 69.0ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-12 20:40:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-06-12 20:40:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1418. [2021-06-12 20:40:56,270 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-12 20:40:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3652 transitions. [2021-06-12 20:40:56,272 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3652 transitions. Word has length 32 [2021-06-12 20:40:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:56,273 INFO L482 AbstractCegarLoop]: Abstraction has 1418 states and 3652 transitions. [2021-06-12 20:40:56,273 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-12 20:40:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3652 transitions. [2021-06-12 20:40:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:56,275 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:56,275 INFO L472 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-12 20:40:56,275 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 20:40:56,275 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682419, now seen corresponding path program 18 times [2021-06-12 20:40:56,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:56,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736384686] [2021-06-12 20:40:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:56,299 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-12 20:40:56,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:56,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736384686] [2021-06-12 20:40:56,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736384686] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:56,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:56,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:40:56,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074908309] [2021-06-12 20:40:56,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:40:56,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:40:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:40:56,301 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-12 20:40:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:56,367 INFO L93 Difference]: Finished difference Result 1501 states and 3704 transitions. [2021-06-12 20:40:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:40:56,368 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-12 20:40:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:56,369 INFO L225 Difference]: With dead ends: 1501 [2021-06-12 20:40:56,369 INFO L226 Difference]: Without dead ends: 1329 [2021-06-12 20:40:56,370 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:40:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-06-12 20:40:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 754. [2021-06-12 20:40:56,381 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-12 20:40:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1858 transitions. [2021-06-12 20:40:56,383 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1858 transitions. Word has length 32 [2021-06-12 20:40:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:56,383 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 1858 transitions. [2021-06-12 20:40:56,383 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-12 20:40:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1858 transitions. [2021-06-12 20:40:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:56,384 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:56,384 INFO L472 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-12 20:40:56,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 20:40:56,385 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1438292239, now seen corresponding path program 19 times [2021-06-12 20:40:56,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:56,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184510901] [2021-06-12 20:40:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:56,420 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-12 20:40:56,420 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:56,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184510901] [2021-06-12 20:40:56,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184510901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:56,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:56,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 20:40:56,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463411988] [2021-06-12 20:40:56,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 20:40:56,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 20:40:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:40:56,421 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-12 20:40:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:56,535 INFO L93 Difference]: Finished difference Result 478 states and 1000 transitions. [2021-06-12 20:40:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 20:40:56,535 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-12 20:40:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:56,535 INFO L225 Difference]: With dead ends: 478 [2021-06-12 20:40:56,535 INFO L226 Difference]: Without dead ends: 234 [2021-06-12 20:40:56,536 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 38.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 20:40:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-12 20:40:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2021-06-12 20:40:56,538 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-12 20:40:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 349 transitions. [2021-06-12 20:40:56,539 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 349 transitions. Word has length 32 [2021-06-12 20:40:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:56,539 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 349 transitions. [2021-06-12 20:40:56,539 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-12 20:40:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 349 transitions. [2021-06-12 20:40:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-12 20:40:56,539 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:40:56,539 INFO L472 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-12 20:40:56,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 20:40:56,540 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:40:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:40:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2002098131, now seen corresponding path program 20 times [2021-06-12 20:40:56,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:40:56,540 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776730862] [2021-06-12 20:40:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:40:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:40:56,582 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-12 20:40:56,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:40:56,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776730862] [2021-06-12 20:40:56,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776730862] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:40:56,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:40:56,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 20:40:56,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454966740] [2021-06-12 20:40:56,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 20:40:56,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:40:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 20:40:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 20:40:56,583 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-12 20:40:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:40:56,678 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2021-06-12 20:40:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 20:40:56,678 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-12 20:40:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:40:56,678 INFO L225 Difference]: With dead ends: 105 [2021-06-12 20:40:56,678 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 20:40:56,679 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-12 20:40:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 20:40:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 20:40:56,679 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-12 20:40:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 20:40:56,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-06-12 20:40:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:40:56,679 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 20:40:56,679 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-12 20:40:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 20:40:56,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 20:40:56,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 20:40:56,681 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 20:40:56,683 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 08:40:56 BasicIcfg [2021-06-12 20:40:56,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 20:40:56,684 INFO L168 Benchmark]: Toolchain (without parser) took 6324.46 ms. Allocated memory was 192.9 MB in the beginning and 352.3 MB in the end (delta: 159.4 MB). Free memory was 172.8 MB in the beginning and 199.5 MB in the end (delta: -26.7 MB). Peak memory consumption was 133.7 MB. Max. memory is 8.0 GB. [2021-06-12 20:40:56,684 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 192.9 MB. Free memory is still 173.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 20:40:56,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.29 ms. Allocated memory is still 192.9 MB. Free memory was 172.7 MB in the beginning and 171.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 20:40:56,684 INFO L168 Benchmark]: Boogie Preprocessor took 18.54 ms. Allocated memory is still 192.9 MB. Free memory was 171.3 MB in the beginning and 170.4 MB in the end (delta: 928.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 20:40:56,684 INFO L168 Benchmark]: RCFGBuilder took 263.91 ms. Allocated memory is still 192.9 MB. Free memory was 170.3 MB in the beginning and 156.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-06-12 20:40:56,685 INFO L168 Benchmark]: TraceAbstraction took 6001.75 ms. Allocated memory was 192.9 MB in the beginning and 352.3 MB in the end (delta: 159.4 MB). Free memory was 156.1 MB in the beginning and 199.5 MB in the end (delta: -43.5 MB). Peak memory consumption was 117.0 MB. Max. memory is 8.0 GB. [2021-06-12 20:40:56,685 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.11 ms. Allocated memory is still 192.9 MB. Free memory is still 173.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 30.29 ms. Allocated memory is still 192.9 MB. Free memory was 172.7 MB in the beginning and 171.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 8.0 GB. * Boogie Preprocessor took 18.54 ms. Allocated memory is still 192.9 MB. Free memory was 171.3 MB in the beginning and 170.4 MB in the end (delta: 928.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 263.91 ms. Allocated memory is still 192.9 MB. Free memory was 170.3 MB in the beginning and 156.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6001.75 ms. Allocated memory was 192.9 MB in the beginning and 352.3 MB in the end (delta: 159.4 MB). Free memory was 156.1 MB in the beginning and 199.5 MB in the end (delta: -43.5 MB). Peak memory consumption was 117.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 68 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5901.0ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 114.3ms, AutomataDifference: 3155.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 169.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1031 SDtfs, 1435 SDslu, 3257 SDs, 0 SdLazy, 3289 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1644.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 796.7ms 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: 1035.3ms AutomataMinimizationTime, 20 MinimizatonAttempts, 21600 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 78.5ms SsaConstructionTime, 176.9ms SatisfiabilityAnalysisTime, 960.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...