/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy6.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-06 00:39:17,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-06 00:39:17,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-06 00:39:17,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-06 00:39:17,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-06 00:39:17,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-06 00:39:17,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-06 00:39:17,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-06 00:39:17,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-06 00:39:17,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-06 00:39:17,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-06 00:39:17,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-06 00:39:17,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-06 00:39:17,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-06 00:39:17,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-06 00:39:17,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-06 00:39:17,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-06 00:39:17,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-06 00:39:17,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-06 00:39:17,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-06 00:39:17,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-06 00:39:17,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-06 00:39:17,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-06 00:39:17,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-06 00:39:17,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-06 00:39:17,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-06 00:39:17,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-06 00:39:17,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-06 00:39:17,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-06 00:39:17,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-06 00:39:17,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-06 00:39:17,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-06 00:39:17,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-06 00:39:17,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-06 00:39:17,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-06 00:39:17,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-06 00:39:17,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-06 00:39:17,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-06 00:39:17,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-06 00:39:17,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-06 00:39:17,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-06 00:39:17,301 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-06 00:39:17,316 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-06 00:39:17,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-06 00:39:17,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-06 00:39:17,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-06 00:39:17,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-06 00:39:17,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-06 00:39:17,318 INFO L138 SettingsManager]: * Use SBE=true [2021-06-06 00:39:17,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-06 00:39:17,318 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-06 00:39:17,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-06 00:39:17,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-06 00:39:17,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-06 00:39:17,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-06 00:39:17,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-06 00:39:17,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-06 00:39:17,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-06 00:39:17,321 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-06 00:39:17,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-06 00:39:17,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-06 00:39:17,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-06 00:39:17,559 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-06 00:39:17,560 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-06 00:39:17,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy6.wvr.bpl [2021-06-06 00:39:17,561 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy6.wvr.bpl' [2021-06-06 00:39:17,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-06 00:39:17,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-06 00:39:17,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-06 00:39:17,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-06 00:39:17,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-06 00:39:17,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-06 00:39:17,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-06 00:39:17,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-06 00:39:17,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-06 00:39:17,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/1) ... [2021-06-06 00:39:17,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-06 00:39:17,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-06 00:39:17,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-06 00:39:17,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-06 00:39:17,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (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-06 00:39:17,662 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-06 00:39:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-06 00:39:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-06 00:39:17,662 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-06 00:39:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-06 00:39:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-06 00:39:17,662 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-06 00:39:17,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-06 00:39:17,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-06 00:39:17,663 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-06 00:39:17,850 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-06 00:39:17,851 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-06 00:39:17,852 INFO L202 PluginConnector]: Adding new model easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 12:39:17 BoogieIcfgContainer [2021-06-06 00:39:17,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-06 00:39:17,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-06 00:39:17,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-06 00:39:17,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-06 00:39:17,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 12:39:17" (1/2) ... [2021-06-06 00:39:17,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200abba4 and model type easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.06 12:39:17, skipping insertion in model container [2021-06-06 00:39:17,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 12:39:17" (2/2) ... [2021-06-06 00:39:17,857 INFO L111 eAbstractionObserver]: Analyzing ICFG easy6.wvr.bpl [2021-06-06 00:39:17,869 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-06 00:39:17,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-06 00:39:17,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-06 00:39:17,870 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-06 00:39:17,922 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-06 00:39:17,940 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-06 00:39:17,961 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 00:39:17,961 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 00:39:17,961 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 00:39:17,961 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 00:39:17,961 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 00:39:17,962 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 00:39:17,962 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 00:39:17,962 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-06 00:39:17,974 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 35 transitions, 86 flow [2021-06-06 00:39:18,003 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154 states, 152 states have (on average 1.7960526315789473) internal successors, (273), 153 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-06 00:39:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 152 states have (on average 1.7960526315789473) internal successors, (273), 153 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-06 00:39:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:18,015 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:18,016 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:18,016 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -914189483, now seen corresponding path program 1 times [2021-06-06 00:39:18,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:18,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854703813] [2021-06-06 00:39:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 00:39:18,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:18,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854703813] [2021-06-06 00:39:18,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854703813] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:18,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:18,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-06 00:39:18,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992644364] [2021-06-06 00:39:18,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-06 00:39:18,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-06 00:39:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-06 00:39:18,229 INFO L87 Difference]: Start difference. First operand has 154 states, 152 states have (on average 1.7960526315789473) internal successors, (273), 153 states have internal predecessors, (273), 0 states have call successors, (0), 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 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:18,317 INFO L93 Difference]: Finished difference Result 202 states and 341 transitions. [2021-06-06 00:39:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-06 00:39:18,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:18,324 INFO L225 Difference]: With dead ends: 202 [2021-06-06 00:39:18,324 INFO L226 Difference]: Without dead ends: 154 [2021-06-06 00:39:18,325 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 74.1ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-06 00:39:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-06-06 00:39:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2021-06-06 00:39:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.7416666666666667) internal successors, (209), 120 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-06 00:39:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 209 transitions. [2021-06-06 00:39:18,354 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 209 transitions. Word has length 31 [2021-06-06 00:39:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:18,354 INFO L482 AbstractCegarLoop]: Abstraction has 121 states and 209 transitions. [2021-06-06 00:39:18,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 209 transitions. [2021-06-06 00:39:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:18,356 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:18,356 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:18,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-06 00:39:18,356 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1150170667, now seen corresponding path program 2 times [2021-06-06 00:39:18,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:18,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645939513] [2021-06-06 00:39:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:18,403 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-06 00:39:18,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:18,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645939513] [2021-06-06 00:39:18,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645939513] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:18,404 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:18,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-06 00:39:18,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966237001] [2021-06-06 00:39:18,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-06 00:39:18,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-06 00:39:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-06 00:39:18,407 INFO L87 Difference]: Start difference. First operand 121 states and 209 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:18,500 INFO L93 Difference]: Finished difference Result 228 states and 387 transitions. [2021-06-06 00:39:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-06 00:39:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:18,503 INFO L225 Difference]: With dead ends: 228 [2021-06-06 00:39:18,503 INFO L226 Difference]: Without dead ends: 193 [2021-06-06 00:39:18,505 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-06 00:39:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-06 00:39:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 106. [2021-06-06 00:39:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.7047619047619047) internal successors, (179), 105 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-06 00:39:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 179 transitions. [2021-06-06 00:39:18,523 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 179 transitions. Word has length 31 [2021-06-06 00:39:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:18,523 INFO L482 AbstractCegarLoop]: Abstraction has 106 states and 179 transitions. [2021-06-06 00:39:18,523 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 179 transitions. [2021-06-06 00:39:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:18,524 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:18,524 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:18,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-06 00:39:18,524 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash 628560125, now seen corresponding path program 3 times [2021-06-06 00:39:18,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:18,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788017417] [2021-06-06 00:39:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:18,552 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-06 00:39:18,552 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:18,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788017417] [2021-06-06 00:39:18,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788017417] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:18,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:18,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 00:39:18,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269282891] [2021-06-06 00:39:18,553 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 00:39:18,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 00:39:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 00:39:18,554 INFO L87 Difference]: Start difference. First operand 106 states and 179 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:18,557 INFO L93 Difference]: Finished difference Result 100 states and 167 transitions. [2021-06-06 00:39:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 00:39:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:18,558 INFO L225 Difference]: With dead ends: 100 [2021-06-06 00:39:18,558 INFO L226 Difference]: Without dead ends: 100 [2021-06-06 00:39:18,558 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 00:39:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-06-06 00:39:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-06-06 00:39:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.6868686868686869) internal successors, (167), 99 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-06 00:39:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 167 transitions. [2021-06-06 00:39:18,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 167 transitions. Word has length 31 [2021-06-06 00:39:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:18,562 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 167 transitions. [2021-06-06 00:39:18,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 167 transitions. [2021-06-06 00:39:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:18,563 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:18,563 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:18,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-06 00:39:18,563 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash -88600699, now seen corresponding path program 4 times [2021-06-06 00:39:18,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:18,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308240641] [2021-06-06 00:39:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:18,616 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-06 00:39:18,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:18,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308240641] [2021-06-06 00:39:18,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308240641] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:18,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:18,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-06 00:39:18,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122905247] [2021-06-06 00:39:18,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-06 00:39:18,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:18,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-06 00:39:18,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-06 00:39:18,618 INFO L87 Difference]: Start difference. First operand 100 states and 167 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:18,667 INFO L93 Difference]: Finished difference Result 131 states and 210 transitions. [2021-06-06 00:39:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-06 00:39:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:18,668 INFO L225 Difference]: With dead ends: 131 [2021-06-06 00:39:18,668 INFO L226 Difference]: Without dead ends: 94 [2021-06-06 00:39:18,669 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 53.0ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-06 00:39:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-06-06 00:39:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2021-06-06 00:39:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 78 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-06 00:39:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 125 transitions. [2021-06-06 00:39:18,671 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 125 transitions. Word has length 31 [2021-06-06 00:39:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:18,671 INFO L482 AbstractCegarLoop]: Abstraction has 79 states and 125 transitions. [2021-06-06 00:39:18,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 125 transitions. [2021-06-06 00:39:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:18,672 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:18,672 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:18,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-06 00:39:18,673 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:18,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash 538045003, now seen corresponding path program 5 times [2021-06-06 00:39:18,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:18,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173342828] [2021-06-06 00:39:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:18,748 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-06 00:39:18,748 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:18,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173342828] [2021-06-06 00:39:18,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173342828] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:18,748 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:18,748 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:18,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096497322] [2021-06-06 00:39:18,749 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:18,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:18,750 INFO L87 Difference]: Start difference. First operand 79 states and 125 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:18,872 INFO L93 Difference]: Finished difference Result 214 states and 334 transitions. [2021-06-06 00:39:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-06 00:39:18,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:18,874 INFO L225 Difference]: With dead ends: 214 [2021-06-06 00:39:18,874 INFO L226 Difference]: Without dead ends: 208 [2021-06-06 00:39:18,874 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-06-06 00:39:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 90. [2021-06-06 00:39:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.595505617977528) internal successors, (142), 89 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-06 00:39:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2021-06-06 00:39:18,883 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 31 [2021-06-06 00:39:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:18,884 INFO L482 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2021-06-06 00:39:18,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2021-06-06 00:39:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:18,889 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:18,889 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:18,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-06 00:39:18,889 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash 593498699, now seen corresponding path program 6 times [2021-06-06 00:39:18,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:18,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426783765] [2021-06-06 00:39:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:18,957 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-06 00:39:18,958 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:18,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426783765] [2021-06-06 00:39:18,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426783765] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:18,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:18,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:18,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199006137] [2021-06-06 00:39:18,959 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:18,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:18,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:18,959 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,070 INFO L93 Difference]: Finished difference Result 201 states and 310 transitions. [2021-06-06 00:39:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-06 00:39:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,072 INFO L225 Difference]: With dead ends: 201 [2021-06-06 00:39:19,072 INFO L226 Difference]: Without dead ends: 187 [2021-06-06 00:39:19,072 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-06-06 00:39:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 80. [2021-06-06 00:39:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 79 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-06 00:39:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2021-06-06 00:39:19,082 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 31 [2021-06-06 00:39:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,083 INFO L482 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2021-06-06 00:39:19,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2021-06-06 00:39:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,087 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,087 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-06 00:39:19,087 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1972958505, now seen corresponding path program 7 times [2021-06-06 00:39:19,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787289799] [2021-06-06 00:39:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 00:39:19,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:19,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787289799] [2021-06-06 00:39:19,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787289799] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:19,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:19,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:19,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817286961] [2021-06-06 00:39:19,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:19,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:19,151 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,274 INFO L93 Difference]: Finished difference Result 200 states and 309 transitions. [2021-06-06 00:39:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-06 00:39:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,275 INFO L225 Difference]: With dead ends: 200 [2021-06-06 00:39:19,275 INFO L226 Difference]: Without dead ends: 194 [2021-06-06 00:39:19,275 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-06 00:39:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 91. [2021-06-06 00:39:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.6) internal successors, (144), 90 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-06 00:39:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2021-06-06 00:39:19,278 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 31 [2021-06-06 00:39:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,278 INFO L482 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2021-06-06 00:39:19,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2021-06-06 00:39:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,278 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,278 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-06 00:39:19,279 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2028412201, now seen corresponding path program 8 times [2021-06-06 00:39:19,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585345082] [2021-06-06 00:39:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:19,355 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-06 00:39:19,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:19,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585345082] [2021-06-06 00:39:19,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585345082] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:19,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:19,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:19,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717924940] [2021-06-06 00:39:19,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:19,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:19,357 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,455 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2021-06-06 00:39:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-06 00:39:19,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,456 INFO L225 Difference]: With dead ends: 187 [2021-06-06 00:39:19,456 INFO L226 Difference]: Without dead ends: 175 [2021-06-06 00:39:19,457 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 100.7ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-06-06 00:39:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 83. [2021-06-06 00:39:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 82 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-06 00:39:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2021-06-06 00:39:19,459 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 31 [2021-06-06 00:39:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,459 INFO L482 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2021-06-06 00:39:19,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2021-06-06 00:39:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,460 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,460 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-06 00:39:19,460 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 440382761, now seen corresponding path program 9 times [2021-06-06 00:39:19,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505981781] [2021-06-06 00:39:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:19,470 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-06 00:39:19,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:19,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505981781] [2021-06-06 00:39:19,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505981781] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:19,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:19,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 00:39:19,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240219853] [2021-06-06 00:39:19,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 00:39:19,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 00:39:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 00:39:19,471 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,473 INFO L93 Difference]: Finished difference Result 82 states and 124 transitions. [2021-06-06 00:39:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 00:39:19,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,474 INFO L225 Difference]: With dead ends: 82 [2021-06-06 00:39:19,474 INFO L226 Difference]: Without dead ends: 76 [2021-06-06 00:39:19,474 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 00:39:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-06-06 00:39:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-06-06 00:39:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 75 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-06 00:39:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2021-06-06 00:39:19,476 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 31 [2021-06-06 00:39:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,476 INFO L482 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2021-06-06 00:39:19,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2021-06-06 00:39:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,476 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,477 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-06 00:39:19,477 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 205229245, now seen corresponding path program 10 times [2021-06-06 00:39:19,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689537777] [2021-06-06 00:39:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:19,529 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-06 00:39:19,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:19,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689537777] [2021-06-06 00:39:19,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689537777] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:19,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:19,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:19,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969626489] [2021-06-06 00:39:19,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:19,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:19,531 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,637 INFO L93 Difference]: Finished difference Result 98 states and 150 transitions. [2021-06-06 00:39:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-06 00:39:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,642 INFO L225 Difference]: With dead ends: 98 [2021-06-06 00:39:19,642 INFO L226 Difference]: Without dead ends: 94 [2021-06-06 00:39:19,643 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 94.3ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-06-06 00:39:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2021-06-06 00:39:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 82 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-06 00:39:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2021-06-06 00:39:19,644 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 31 [2021-06-06 00:39:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,645 INFO L482 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2021-06-06 00:39:19,645 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2021-06-06 00:39:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,645 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,645 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-06 00:39:19,646 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash 260682941, now seen corresponding path program 11 times [2021-06-06 00:39:19,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902310350] [2021-06-06 00:39:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:19,714 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-06 00:39:19,714 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:19,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902310350] [2021-06-06 00:39:19,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902310350] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:19,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:19,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:19,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106871998] [2021-06-06 00:39:19,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:19,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:19,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:19,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:19,716 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,791 INFO L93 Difference]: Finished difference Result 87 states and 130 transitions. [2021-06-06 00:39:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-06 00:39:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,792 INFO L225 Difference]: With dead ends: 87 [2021-06-06 00:39:19,792 INFO L226 Difference]: Without dead ends: 74 [2021-06-06 00:39:19,792 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 83.0ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-06-06 00:39:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-06-06 00:39:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-06 00:39:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2021-06-06 00:39:19,794 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 31 [2021-06-06 00:39:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,794 INFO L482 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2021-06-06 00:39:19,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2021-06-06 00:39:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,794 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,794 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,795 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-06 00:39:19,795 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1640142747, now seen corresponding path program 12 times [2021-06-06 00:39:19,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202663912] [2021-06-06 00:39:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:19,854 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-06 00:39:19,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:19,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202663912] [2021-06-06 00:39:19,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202663912] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:19,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:19,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:19,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602038115] [2021-06-06 00:39:19,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:19,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:19,856 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:19,933 INFO L93 Difference]: Finished difference Result 104 states and 159 transitions. [2021-06-06 00:39:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-06 00:39:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:19,934 INFO L225 Difference]: With dead ends: 104 [2021-06-06 00:39:19,934 INFO L226 Difference]: Without dead ends: 100 [2021-06-06 00:39:19,934 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-06-06 00:39:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2021-06-06 00:39:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.524390243902439) internal successors, (125), 82 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-06 00:39:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2021-06-06 00:39:19,936 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 31 [2021-06-06 00:39:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:19,936 INFO L482 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2021-06-06 00:39:19,936 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2021-06-06 00:39:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:19,937 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:19,937 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:19,937 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-06 00:39:19,937 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1695596443, now seen corresponding path program 13 times [2021-06-06 00:39:19,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:19,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225590515] [2021-06-06 00:39:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:20,001 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-06 00:39:20,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:20,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225590515] [2021-06-06 00:39:20,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225590515] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:20,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:20,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-06 00:39:20,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659460986] [2021-06-06 00:39:20,002 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-06 00:39:20,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-06 00:39:20,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-06 00:39:20,002 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:20,076 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2021-06-06 00:39:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-06 00:39:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:20,076 INFO L225 Difference]: With dead ends: 87 [2021-06-06 00:39:20,076 INFO L226 Difference]: Without dead ends: 73 [2021-06-06 00:39:20,077 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-06-06 00:39:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-06-06 00:39:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-06-06 00:39:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-06 00:39:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2021-06-06 00:39:20,078 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 31 [2021-06-06 00:39:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:20,078 INFO L482 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2021-06-06 00:39:20,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2021-06-06 00:39:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-06 00:39:20,079 INFO L546 BasicCegarLoop]: Found error trace [2021-06-06 00:39:20,079 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-06 00:39:20,079 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-06 00:39:20,079 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-06 00:39:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 00:39:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash -127865327, now seen corresponding path program 14 times [2021-06-06 00:39:20,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 00:39:20,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097356687] [2021-06-06 00:39:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 00:39:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 00:39:20,157 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-06 00:39:20,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 00:39:20,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097356687] [2021-06-06 00:39:20,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097356687] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 00:39:20,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 00:39:20,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-06 00:39:20,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082080055] [2021-06-06 00:39:20,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-06 00:39:20,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 00:39:20,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-06 00:39:20,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-06 00:39:20,158 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-06 00:39:20,189 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2021-06-06 00:39:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-06 00:39:20,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-06-06 00:39:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-06 00:39:20,190 INFO L225 Difference]: With dead ends: 43 [2021-06-06 00:39:20,190 INFO L226 Difference]: Without dead ends: 0 [2021-06-06 00:39:20,190 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-06 00:39:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-06 00:39:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-06 00:39:20,190 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-06 00:39:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-06 00:39:20,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2021-06-06 00:39:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-06 00:39:20,190 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-06 00:39:20,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-06 00:39:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-06 00:39:20,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-06 00:39:20,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-06 00:39:20,192 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-06 00:39:20,194 INFO L202 PluginConnector]: Adding new model easy6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.06 12:39:20 BasicIcfg [2021-06-06 00:39:20,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-06 00:39:20,194 INFO L168 Benchmark]: Toolchain (without parser) took 2609.89 ms. Allocated memory is still 333.4 MB. Free memory was 312.7 MB in the beginning and 299.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.0 GB. [2021-06-06 00:39:20,195 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 333.4 MB. Free memory was 313.8 MB in the beginning and 313.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-06 00:39:20,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.37 ms. Allocated memory is still 333.4 MB. Free memory was 312.7 MB in the beginning and 311.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 00:39:20,195 INFO L168 Benchmark]: Boogie Preprocessor took 10.26 ms. Allocated memory is still 333.4 MB. Free memory was 311.2 MB in the beginning and 310.3 MB in the end (delta: 893.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 00:39:20,195 INFO L168 Benchmark]: RCFGBuilder took 236.45 ms. Allocated memory is still 333.4 MB. Free memory was 310.2 MB in the beginning and 298.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. [2021-06-06 00:39:20,195 INFO L168 Benchmark]: TraceAbstraction took 2341.05 ms. Allocated memory is still 333.4 MB. Free memory was 298.1 MB in the beginning and 299.8 MB in the end (delta: -1.7 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-06 00:39:20,196 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 333.4 MB. Free memory was 313.8 MB in the beginning and 313.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 18.37 ms. Allocated memory is still 333.4 MB. Free memory was 312.7 MB in the beginning and 311.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 10.26 ms. Allocated memory is still 333.4 MB. Free memory was 311.2 MB in the beginning and 310.3 MB in the end (delta: 893.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 236.45 ms. Allocated memory is still 333.4 MB. Free memory was 310.2 MB in the beginning and 298.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2341.05 ms. Allocated memory is still 333.4 MB. Free memory was 298.1 MB in the beginning and 299.8 MB in the end (delta: -1.7 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 60]: 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 5 procedures, 60 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2231.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 25.4ms, AutomataDifference: 1101.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 41.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 540 SDtfs, 1443 SDslu, 1489 SDs, 0 SdLazy, 544 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 312.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 973.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 75.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 583 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.2ms SsaConstructionTime, 94.5ms SatisfiabilityAnalysisTime, 723.2ms InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 1626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...