/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/bench/exp2x6.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 21:40:12,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 21:40:12,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 21:40:12,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 21:40:12,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 21:40:12,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 21:40:12,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 21:40:12,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 21:40:12,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 21:40:12,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 21:40:12,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 21:40:12,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 21:40:12,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 21:40:12,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 21:40:12,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 21:40:12,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 21:40:12,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 21:40:12,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 21:40:12,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 21:40:12,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 21:40:12,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 21:40:12,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 21:40:12,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 21:40:12,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 21:40:12,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 21:40:12,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 21:40:12,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 21:40:12,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 21:40:12,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 21:40:12,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 21:40:12,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 21:40:12,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 21:40:12,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 21:40:12,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 21:40:12,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 21:40:12,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 21:40:12,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 21:40:12,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 21:40:12,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 21:40:12,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 21:40:12,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 21:40:12,825 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-03-10 21:40:12,869 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 21:40:12,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 21:40:12,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 21:40:12,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 21:40:12,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 21:40:12,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 21:40:12,871 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 21:40:12,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 21:40:12,871 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 21:40:12,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 21:40:12,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 21:40:12,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 21:40:12,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 21:40:12,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 21:40:12,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 21:40:12,872 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 21:40:12,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 21:40:12,873 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 21:40:12,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 21:40:12,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 21:40:12,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 21:40:12,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 21:40:12,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 21:40:12,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 21:40:12,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 21:40:12,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 21:40:12,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 21:40:12,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 21:40:12,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 21:40:12,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 21:40:12,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 21:40:12,875 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-03-10 21:40:13,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 21:40:13,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 21:40:13,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 21:40:13,201 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-10 21:40:13,203 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-10 21:40:13,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl [2021-03-10 21:40:13,204 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl' [2021-03-10 21:40:13,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 21:40:13,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-10 21:40:13,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 21:40:13,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 21:40:13,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 21:40:13,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 21:40:13,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 21:40:13,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 21:40:13,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 21:40:13,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/1) ... [2021-03-10 21:40:13,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 21:40:13,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 21:40:13,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 21:40:13,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 21:40:13,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (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-03-10 21:40:13,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-10 21:40:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-10 21:40:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-10 21:40:13,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-10 21:40:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-10 21:40:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-10 21:40:13,361 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-10 21:40:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 21:40:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 21:40:13,361 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-10 21:40:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-10 21:40:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-10 21:40:13,361 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-10 21:40:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-10 21:40:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-10 21:40:13,362 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 21:40:13,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 21:40:13,518 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-10 21:40:13,519 INFO L202 PluginConnector]: Adding new model exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 09:40:13 BoogieIcfgContainer [2021-03-10 21:40:13,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 21:40:13,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 21:40:13,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 21:40:13,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 21:40:13,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:13" (1/2) ... [2021-03-10 21:40:13,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6d36ef and model type exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 09:40:13, skipping insertion in model container [2021-03-10 21:40:13,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 09:40:13" (2/2) ... [2021-03-10 21:40:13,525 INFO L111 eAbstractionObserver]: Analyzing ICFG exp2x6.wvr.bpl [2021-03-10 21:40:13,529 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 21:40:13,530 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 21:40:13,532 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-10 21:40:13,533 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 21:40:13,569 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-03-10 21:40:13,583 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-10 21:40:13,598 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 21:40:13,598 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 21:40:13,598 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 21:40:13,599 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 21:40:13,599 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 21:40:13,599 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 21:40:13,599 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 21:40:13,599 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 21:40:13,607 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 45 transitions, 122 flow [2021-03-10 21:40:13,971 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (12677), 3205 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (12677), 3205 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:40:14,020 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:14,022 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:14,024 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash -176416249, now seen corresponding path program 1 times [2021-03-10 21:40:14,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:14,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124694130] [2021-03-10 21:40:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:14,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124694130] [2021-03-10 21:40:14,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:14,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 21:40:14,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084245818] [2021-03-10 21:40:14,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 21:40:14,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 21:40:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 21:40:14,309 INFO L87 Difference]: Start difference. First operand has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (12677), 3205 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:14,431 INFO L93 Difference]: Finished difference Result 3629 states and 14324 transitions. [2021-03-10 21:40:14,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 21:40:14,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-10 21:40:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:14,513 INFO L225 Difference]: With dead ends: 3629 [2021-03-10 21:40:14,513 INFO L226 Difference]: Without dead ends: 3598 [2021-03-10 21:40:14,514 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 21:40:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2021-03-10 21:40:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3333. [2021-03-10 21:40:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 3.952280912364946) internal successors, (13169), 3332 states have internal predecessors, (13169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 13169 transitions. [2021-03-10 21:40:14,741 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 13169 transitions. Word has length 19 [2021-03-10 21:40:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:14,742 INFO L480 AbstractCegarLoop]: Abstraction has 3333 states and 13169 transitions. [2021-03-10 21:40:14,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 13169 transitions. [2021-03-10 21:40:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:14,753 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:14,753 INFO L519 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] [2021-03-10 21:40:14,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 21:40:14,754 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:14,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1596364547, now seen corresponding path program 1 times [2021-03-10 21:40:14,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:14,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047909284] [2021-03-10 21:40:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:14,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047909284] [2021-03-10 21:40:14,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377855516] [2021-03-10 21:40:14,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:14,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-03-10 21:40:14,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:40:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:14,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:40:14,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-03-10 21:40:14,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678111125] [2021-03-10 21:40:14,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:14,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:14,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:14,954 INFO L87 Difference]: Start difference. First operand 3333 states and 13169 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:15,076 INFO L93 Difference]: Finished difference Result 6091 states and 23571 transitions. [2021-03-10 21:40:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:15,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:15,124 INFO L225 Difference]: With dead ends: 6091 [2021-03-10 21:40:15,124 INFO L226 Difference]: Without dead ends: 6091 [2021-03-10 21:40:15,125 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2021-03-10 21:40:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3780. [2021-03-10 21:40:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3779 states have (on average 3.988885948663668) internal successors, (15074), 3779 states have internal predecessors, (15074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 15074 transitions. [2021-03-10 21:40:15,418 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 15074 transitions. Word has length 24 [2021-03-10 21:40:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:15,419 INFO L480 AbstractCegarLoop]: Abstraction has 3780 states and 15074 transitions. [2021-03-10 21:40:15,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 15074 transitions. [2021-03-10 21:40:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:15,438 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:15,439 INFO L519 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] [2021-03-10 21:40:15,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-03-10 21:40:15,655 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash 787684274, now seen corresponding path program 1 times [2021-03-10 21:40:15,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:15,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107249375] [2021-03-10 21:40:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:15,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107249375] [2021-03-10 21:40:15,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:15,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:15,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227627453] [2021-03-10 21:40:15,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:15,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:15,701 INFO L87 Difference]: Start difference. First operand 3780 states and 15074 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:15,878 INFO L93 Difference]: Finished difference Result 4891 states and 19118 transitions. [2021-03-10 21:40:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:15,913 INFO L225 Difference]: With dead ends: 4891 [2021-03-10 21:40:15,913 INFO L226 Difference]: Without dead ends: 4883 [2021-03-10 21:40:15,913 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2021-03-10 21:40:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3892. [2021-03-10 21:40:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 3.9671035723464403) internal successors, (15436), 3891 states have internal predecessors, (15436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 15436 transitions. [2021-03-10 21:40:16,109 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 15436 transitions. Word has length 24 [2021-03-10 21:40:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:16,109 INFO L480 AbstractCegarLoop]: Abstraction has 3892 states and 15436 transitions. [2021-03-10 21:40:16,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 15436 transitions. [2021-03-10 21:40:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:16,123 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:16,123 INFO L519 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] [2021-03-10 21:40:16,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 21:40:16,123 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1247895235, now seen corresponding path program 1 times [2021-03-10 21:40:16,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:16,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687530515] [2021-03-10 21:40:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:16,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687530515] [2021-03-10 21:40:16,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808091972] [2021-03-10 21:40:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:16,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-03-10 21:40:16,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:40:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:16,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:40:16,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-03-10 21:40:16,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066175675] [2021-03-10 21:40:16,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:16,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:16,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:16,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:16,367 INFO L87 Difference]: Start difference. First operand 3892 states and 15436 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:16,519 INFO L93 Difference]: Finished difference Result 6588 states and 25636 transitions. [2021-03-10 21:40:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:16,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:16,554 INFO L225 Difference]: With dead ends: 6588 [2021-03-10 21:40:16,554 INFO L226 Difference]: Without dead ends: 6588 [2021-03-10 21:40:16,555 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2021-03-10 21:40:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 4463. [2021-03-10 21:40:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4463 states, 4462 states have (on average 4.017480950246526) internal successors, (17926), 4462 states have internal predecessors, (17926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 17926 transitions. [2021-03-10 21:40:16,789 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 17926 transitions. Word has length 24 [2021-03-10 21:40:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:16,789 INFO L480 AbstractCegarLoop]: Abstraction has 4463 states and 17926 transitions. [2021-03-10 21:40:16,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 17926 transitions. [2021-03-10 21:40:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:16,804 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:16,804 INFO L519 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] [2021-03-10 21:40:17,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:17,019 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:17,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 4371448, now seen corresponding path program 1 times [2021-03-10 21:40:17,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:17,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586192701] [2021-03-10 21:40:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:17,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586192701] [2021-03-10 21:40:17,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:17,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:17,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858945538] [2021-03-10 21:40:17,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:17,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:17,067 INFO L87 Difference]: Start difference. First operand 4463 states and 17926 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:17,228 INFO L93 Difference]: Finished difference Result 5640 states and 22182 transitions. [2021-03-10 21:40:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:17,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:17,256 INFO L225 Difference]: With dead ends: 5640 [2021-03-10 21:40:17,256 INFO L226 Difference]: Without dead ends: 5622 [2021-03-10 21:40:17,257 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2021-03-10 21:40:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 4591. [2021-03-10 21:40:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4590 states have (on average 3.9971677559912853) internal successors, (18347), 4590 states have internal predecessors, (18347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 18347 transitions. [2021-03-10 21:40:17,428 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 18347 transitions. Word has length 24 [2021-03-10 21:40:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:17,428 INFO L480 AbstractCegarLoop]: Abstraction has 4591 states and 18347 transitions. [2021-03-10 21:40:17,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 18347 transitions. [2021-03-10 21:40:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:17,446 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:17,446 INFO L519 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] [2021-03-10 21:40:17,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 21:40:17,447 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 979513020, now seen corresponding path program 2 times [2021-03-10 21:40:17,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:17,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630482344] [2021-03-10 21:40:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:17,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630482344] [2021-03-10 21:40:17,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:17,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:17,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990593480] [2021-03-10 21:40:17,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:17,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:17,493 INFO L87 Difference]: Start difference. First operand 4591 states and 18347 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:17,587 INFO L93 Difference]: Finished difference Result 5958 states and 23476 transitions. [2021-03-10 21:40:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:17,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:17,614 INFO L225 Difference]: With dead ends: 5958 [2021-03-10 21:40:17,614 INFO L226 Difference]: Without dead ends: 5958 [2021-03-10 21:40:17,615 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2021-03-10 21:40:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 5142. [2021-03-10 21:40:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5142 states, 5141 states have (on average 3.9941645594242363) internal successors, (20534), 5141 states have internal predecessors, (20534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 20534 transitions. [2021-03-10 21:40:17,823 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 20534 transitions. Word has length 24 [2021-03-10 21:40:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:17,823 INFO L480 AbstractCegarLoop]: Abstraction has 5142 states and 20534 transitions. [2021-03-10 21:40:17,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 20534 transitions. [2021-03-10 21:40:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:17,840 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:17,840 INFO L519 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] [2021-03-10 21:40:17,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 21:40:17,841 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1301374515, now seen corresponding path program 2 times [2021-03-10 21:40:17,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:17,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396145962] [2021-03-10 21:40:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:17,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396145962] [2021-03-10 21:40:17,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:17,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:17,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414716699] [2021-03-10 21:40:17,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:17,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:17,865 INFO L87 Difference]: Start difference. First operand 5142 states and 20534 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:17,974 INFO L93 Difference]: Finished difference Result 5957 states and 23318 transitions. [2021-03-10 21:40:17,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:17,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:18,002 INFO L225 Difference]: With dead ends: 5957 [2021-03-10 21:40:18,002 INFO L226 Difference]: Without dead ends: 5926 [2021-03-10 21:40:18,003 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2021-03-10 21:40:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5271. [2021-03-10 21:40:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 5270 states have (on average 3.97438330170778) internal successors, (20945), 5270 states have internal predecessors, (20945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 20945 transitions. [2021-03-10 21:40:18,215 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 20945 transitions. Word has length 24 [2021-03-10 21:40:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:18,215 INFO L480 AbstractCegarLoop]: Abstraction has 5271 states and 20945 transitions. [2021-03-10 21:40:18,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 20945 transitions. [2021-03-10 21:40:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:18,231 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:18,232 INFO L519 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] [2021-03-10 21:40:18,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 21:40:18,232 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1091376970, now seen corresponding path program 2 times [2021-03-10 21:40:18,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:18,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997124196] [2021-03-10 21:40:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:18,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997124196] [2021-03-10 21:40:18,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:18,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:18,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845928002] [2021-03-10 21:40:18,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:18,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:18,284 INFO L87 Difference]: Start difference. First operand 5271 states and 20945 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:18,400 INFO L93 Difference]: Finished difference Result 7039 states and 27626 transitions. [2021-03-10 21:40:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:18,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:18,433 INFO L225 Difference]: With dead ends: 7039 [2021-03-10 21:40:18,433 INFO L226 Difference]: Without dead ends: 7039 [2021-03-10 21:40:18,434 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2021-03-10 21:40:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5864. [2021-03-10 21:40:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 3.980897151628859) internal successors, (23340), 5863 states have internal predecessors, (23340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 23340 transitions. [2021-03-10 21:40:18,651 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 23340 transitions. Word has length 24 [2021-03-10 21:40:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:18,651 INFO L480 AbstractCegarLoop]: Abstraction has 5864 states and 23340 transitions. [2021-03-10 21:40:18,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 23340 transitions. [2021-03-10 21:40:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-03-10 21:40:18,667 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:18,667 INFO L519 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] [2021-03-10 21:40:18,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 21:40:18,667 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 815941149, now seen corresponding path program 2 times [2021-03-10 21:40:18,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:18,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270647804] [2021-03-10 21:40:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:18,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270647804] [2021-03-10 21:40:18,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:18,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:18,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689674356] [2021-03-10 21:40:18,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:18,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:18,689 INFO L87 Difference]: Start difference. First operand 5864 states and 23340 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:18,782 INFO L93 Difference]: Finished difference Result 6971 states and 27116 transitions. [2021-03-10 21:40:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-03-10 21:40:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:18,807 INFO L225 Difference]: With dead ends: 6971 [2021-03-10 21:40:18,807 INFO L226 Difference]: Without dead ends: 6943 [2021-03-10 21:40:18,808 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6943 states. [2021-03-10 21:40:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6943 to 6067. [2021-03-10 21:40:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6067 states, 6066 states have (on average 3.9658753709198815) internal successors, (24057), 6066 states have internal predecessors, (24057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6067 states to 6067 states and 24057 transitions. [2021-03-10 21:40:19,157 INFO L78 Accepts]: Start accepts. Automaton has 6067 states and 24057 transitions. Word has length 24 [2021-03-10 21:40:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:19,157 INFO L480 AbstractCegarLoop]: Abstraction has 6067 states and 24057 transitions. [2021-03-10 21:40:19,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6067 states and 24057 transitions. [2021-03-10 21:40:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-10 21:40:19,175 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:19,175 INFO L519 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] [2021-03-10 21:40:19,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 21:40:19,175 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash -746670468, now seen corresponding path program 1 times [2021-03-10 21:40:19,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:19,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349177988] [2021-03-10 21:40:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:19,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349177988] [2021-03-10 21:40:19,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329219029] [2021-03-10 21:40:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:40:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:19,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:19,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:40:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:20,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:40:20,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 10 [2021-03-10 21:40:20,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033702192] [2021-03-10 21:40:20,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:40:20,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:40:20,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:40:20,011 INFO L87 Difference]: Start difference. First operand 6067 states and 24057 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:20,941 INFO L93 Difference]: Finished difference Result 8499 states and 32997 transitions. [2021-03-10 21:40:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:40:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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 29 [2021-03-10 21:40:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:20,962 INFO L225 Difference]: With dead ends: 8499 [2021-03-10 21:40:20,962 INFO L226 Difference]: Without dead ends: 8363 [2021-03-10 21:40:20,962 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 162.3ms TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:40:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2021-03-10 21:40:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 6744. [2021-03-10 21:40:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6744 states, 6743 states have (on average 3.9549162094023433) internal successors, (26668), 6743 states have internal predecessors, (26668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 26668 transitions. [2021-03-10 21:40:21,174 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 26668 transitions. Word has length 29 [2021-03-10 21:40:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:21,174 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 26668 transitions. [2021-03-10 21:40:21,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 26668 transitions. [2021-03-10 21:40:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-10 21:40:21,193 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:21,193 INFO L519 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] [2021-03-10 21:40:21,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-03-10 21:40:21,407 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1040906004, now seen corresponding path program 2 times [2021-03-10 21:40:21,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:21,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723484427] [2021-03-10 21:40:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:40:21,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723484427] [2021-03-10 21:40:21,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319981437] [2021-03-10 21:40:21,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:21,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:40:21,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:40:21,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:40:21,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:40:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:21,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:40:21,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 11 [2021-03-10 21:40:21,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33338004] [2021-03-10 21:40:21,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 21:40:21,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 21:40:21,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:40:21,995 INFO L87 Difference]: Start difference. First operand 6744 states and 26668 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:23,151 INFO L93 Difference]: Finished difference Result 10094 states and 39061 transitions. [2021-03-10 21:40:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:40:23,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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 29 [2021-03-10 21:40:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:23,176 INFO L225 Difference]: With dead ends: 10094 [2021-03-10 21:40:23,176 INFO L226 Difference]: Without dead ends: 9890 [2021-03-10 21:40:23,177 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 227.9ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:40:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9890 states. [2021-03-10 21:40:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9890 to 7521. [2021-03-10 21:40:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7521 states, 7520 states have (on average 3.9558510638297872) internal successors, (29748), 7520 states have internal predecessors, (29748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7521 states to 7521 states and 29748 transitions. [2021-03-10 21:40:23,404 INFO L78 Accepts]: Start accepts. Automaton has 7521 states and 29748 transitions. Word has length 29 [2021-03-10 21:40:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:23,405 INFO L480 AbstractCegarLoop]: Abstraction has 7521 states and 29748 transitions. [2021-03-10 21:40:23,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 7521 states and 29748 transitions. [2021-03-10 21:40:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-10 21:40:23,430 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:23,430 INFO L519 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] [2021-03-10 21:40:23,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:23,645 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash 984395042, now seen corresponding path program 3 times [2021-03-10 21:40:23,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:23,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060424486] [2021-03-10 21:40:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:40:23,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060424486] [2021-03-10 21:40:23,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151719897] [2021-03-10 21:40:23,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:40:23,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:40:23,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:40:23,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:40:23,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:40:24,149 WARN L340 FreeRefinementEngine]: Global settings require throwing the following exception [2021-03-10 21:40:24,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-03-10 21:40:24,372 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected aux_div_aux_div_aux_mod_x1_24_53_119 already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:585) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:76) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:212) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:585) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:76) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:408) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:312) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:328) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.access$1(DualJunctionDer.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:231) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:149) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:127) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:862) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:828) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:746) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:383) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:315) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.convert(QuantifierPusher.java:227) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate(QuantifierPusher.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate(QuantifierPusher.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$LiveVariablesPostprocessorForward.postprocess(TraceCheckSpWp.java:539) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:63) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateAllErrorsAtOnce(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-03-10 21:40:24,375 INFO L168 Benchmark]: Toolchain (without parser) took 11135.82 ms. Allocated memory was 255.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 236.8 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 507.2 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:24,375 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 2.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:24,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.01 ms. Allocated memory is still 255.9 MB. Free memory was 236.3 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:24,376 INFO L168 Benchmark]: Boogie Preprocessor took 21.66 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 233.8 MB in the end (delta: 986.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 21:40:24,376 INFO L168 Benchmark]: RCFGBuilder took 224.44 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 238.3 MB in the end (delta: -4.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:24,376 INFO L168 Benchmark]: TraceAbstraction took 10853.65 ms. Allocated memory was 255.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 237.6 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 506.4 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:24,376 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 2.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 26.01 ms. Allocated memory is still 255.9 MB. Free memory was 236.3 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.66 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 233.8 MB in the end (delta: 986.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 224.44 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 238.3 MB in the end (delta: -4.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10853.65 ms. Allocated memory was 255.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 237.6 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 506.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected aux_div_aux_div_aux_mod_x1_24_53_119 already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected aux_div_aux_div_aux_mod_x1_24_53_119 already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:198) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...