/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:53:40,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:53:40,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:53:40,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:53:40,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:53:40,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:53:40,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:53:40,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:53:40,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:53:40,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:53:40,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:53:40,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:53:40,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:53:40,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:53:40,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:53:40,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:53:40,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:53:40,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:53:40,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:53:40,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:53:40,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:53:40,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:53:40,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:53:40,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:53:40,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:53:40,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:53:40,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:53:40,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:53:40,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:53:40,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:53:40,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:53:40,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:53:40,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:53:40,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:53:40,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:53:40,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:53:40,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:53:40,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:53:40,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:53:40,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:53:40,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:53:40,694 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-Delay.epf [2021-08-21 17:53:40,732 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:53:40,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:53:40,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:53:40,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:53:40,736 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:53:40,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:53:40,737 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:53:40,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:53:40,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:53:40,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:53:40,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:53:40,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:53:40,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:53:40,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:53:40,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:53:40,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:53:40,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:53:40,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:53:40,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:53:40,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:53:40,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:53:40,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:53:40,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:53:40,740 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:53:40,740 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-08-21 17:53:41,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:53:41,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:53:41,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:53:41,104 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-08-21 17:53:41,106 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-08-21 17:53:41,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-08-21 17:53:41,108 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-08-21 17:53:41,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:53:41,148 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-08-21 17:53:41,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:53:41,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:53:41,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:53:41,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:53:41,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:53:41,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:53:41,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:53:41,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:53:41,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:53:41,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:53:41,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:53:41,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/1) ... [2021-08-21 17:53:41,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:53:41,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:53:41,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:53:41,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:53:41,274 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-08-21 17:53:41,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-08-21 17:53:41,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-08-21 17:53:41,274 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-08-21 17:53:41,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-08-21 17:53:41,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-08-21 17:53:41,275 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-08-21 17:53:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:53:41,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:53:41,276 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-08-21 17:53:41,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-08-21 17:53:41,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-08-21 17:53:41,277 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-08-21 17:53:41,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-08-21 17:53:41,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-08-21 17:53:41,277 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-08-21 17:53:41,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-08-21 17:53:41,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-08-21 17:53:41,277 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-08-21 17:53:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-08-21 17:53:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-08-21 17:53:41,279 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:53:41,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:53:41,470 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-21 17:53:41,472 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:53:41 BoogieIcfgContainer [2021-08-21 17:53:41,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:53:41,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:53:41,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:53:41,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:53:41,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 05:53:41" (1/2) ... [2021-08-21 17:53:41,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141799c9 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:53:41, skipping insertion in model container [2021-08-21 17:53:41,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:53:41" (2/2) ... [2021-08-21 17:53:41,478 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-08-21 17:53:41,489 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:53:41,489 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:53:41,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-21 17:53:41,490 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:53:41,638 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-08-21 17:53:41,669 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:53:41,675 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:53:41,676 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-08-21 17:53:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 10820 states, 8354 states have (on average 2.390112520948049) internal successors, (19967), 10819 states have internal predecessors, (19967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-21 17:53:42,938 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:42,939 INFO L512 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] [2021-08-21 17:53:42,940 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -692224307, now seen corresponding path program 1 times [2021-08-21 17:53:42,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:42,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003473512] [2021-08-21 17:53:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:42,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:53:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:53:43,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:53:43,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003473512] [2021-08-21 17:53:43,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003473512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:53:43,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:53:43,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 17:53:43,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895098627] [2021-08-21 17:53:43,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:53:43,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:53:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:53:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:43,230 INFO L87 Difference]: Start difference. First operand has 10820 states, 8354 states have (on average 2.390112520948049) internal successors, (19967), 10819 states have internal predecessors, (19967), 0 states have call successors, (0), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:53:43,381 INFO L93 Difference]: Finished difference Result 11214 states and 20648 transitions. [2021-08-21 17:53:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:53:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-08-21 17:53:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:53:43,432 INFO L225 Difference]: With dead ends: 11214 [2021-08-21 17:53:43,432 INFO L226 Difference]: Without dead ends: 5325 [2021-08-21 17:53:43,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-08-21 17:53:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 5288. [2021-08-21 17:53:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5288 states, 5287 states have (on average 1.9532816341970871) internal successors, (10327), 5287 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 10327 transitions. [2021-08-21 17:53:43,704 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 10327 transitions. Word has length 23 [2021-08-21 17:53:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:53:43,705 INFO L470 AbstractCegarLoop]: Abstraction has 5288 states and 10327 transitions. [2021-08-21 17:53:43,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 10327 transitions. [2021-08-21 17:53:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 17:53:43,718 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:43,718 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:53:43,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:53:43,719 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash -345220622, now seen corresponding path program 1 times [2021-08-21 17:53:43,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:43,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573017746] [2021-08-21 17:53:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:43,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:53:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:53:43,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:53:43,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573017746] [2021-08-21 17:53:43,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573017746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:53:43,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:53:43,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 17:53:43,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512273127] [2021-08-21 17:53:43,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:53:43,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:53:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:53:43,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:43,806 INFO L87 Difference]: Start difference. First operand 5288 states and 10327 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:53:43,939 INFO L93 Difference]: Finished difference Result 6456 states and 12574 transitions. [2021-08-21 17:53:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:53:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-21 17:53:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:53:43,986 INFO L225 Difference]: With dead ends: 6456 [2021-08-21 17:53:43,986 INFO L226 Difference]: Without dead ends: 6264 [2021-08-21 17:53:43,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2021-08-21 17:53:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 6264. [2021-08-21 17:53:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6264 states, 6263 states have (on average 1.9452339134600032) internal successors, (12183), 6263 states have internal predecessors, (12183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 12183 transitions. [2021-08-21 17:53:44,217 INFO L78 Accepts]: Start accepts. Automaton has 6264 states and 12183 transitions. Word has length 31 [2021-08-21 17:53:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:53:44,217 INFO L470 AbstractCegarLoop]: Abstraction has 6264 states and 12183 transitions. [2021-08-21 17:53:44,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6264 states and 12183 transitions. [2021-08-21 17:53:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 17:53:44,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:44,230 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:53:44,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:53:44,231 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1023006856, now seen corresponding path program 1 times [2021-08-21 17:53:44,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:44,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155952284] [2021-08-21 17:53:44,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:44,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:53:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:53:44,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:53:44,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155952284] [2021-08-21 17:53:44,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155952284] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:53:44,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:53:44,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 17:53:44,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144292296] [2021-08-21 17:53:44,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:53:44,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:53:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:53:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,274 INFO L87 Difference]: Start difference. First operand 6264 states and 12183 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:53:44,326 INFO L93 Difference]: Finished difference Result 7324 states and 13855 transitions. [2021-08-21 17:53:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:53:44,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-21 17:53:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:53:44,357 INFO L225 Difference]: With dead ends: 7324 [2021-08-21 17:53:44,357 INFO L226 Difference]: Without dead ends: 7084 [2021-08-21 17:53:44,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2021-08-21 17:53:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 7080. [2021-08-21 17:53:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.9225879361491736) internal successors, (13610), 7079 states have internal predecessors, (13610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 13610 transitions. [2021-08-21 17:53:44,518 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 13610 transitions. Word has length 31 [2021-08-21 17:53:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:53:44,519 INFO L470 AbstractCegarLoop]: Abstraction has 7080 states and 13610 transitions. [2021-08-21 17:53:44,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 13610 transitions. [2021-08-21 17:53:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 17:53:44,531 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:44,531 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:53:44,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:53:44,531 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1465046862, now seen corresponding path program 1 times [2021-08-21 17:53:44,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:44,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331119731] [2021-08-21 17:53:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:44,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:53:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:53:44,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:53:44,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331119731] [2021-08-21 17:53:44,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331119731] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:53:44,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:53:44,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 17:53:44,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404876001] [2021-08-21 17:53:44,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:53:44,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:53:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:53:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,581 INFO L87 Difference]: Start difference. First operand 7080 states and 13610 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:53:44,618 INFO L93 Difference]: Finished difference Result 6911 states and 13245 transitions. [2021-08-21 17:53:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:53:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-21 17:53:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:53:44,651 INFO L225 Difference]: With dead ends: 6911 [2021-08-21 17:53:44,652 INFO L226 Difference]: Without dead ends: 5596 [2021-08-21 17:53:44,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2021-08-21 17:53:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2021-08-21 17:53:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.9181411974977658) internal successors, (10732), 5595 states have internal predecessors, (10732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 10732 transitions. [2021-08-21 17:53:44,826 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 10732 transitions. Word has length 31 [2021-08-21 17:53:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:53:44,827 INFO L470 AbstractCegarLoop]: Abstraction has 5596 states and 10732 transitions. [2021-08-21 17:53:44,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 10732 transitions. [2021-08-21 17:53:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 17:53:44,837 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:44,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:53:44,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:53:44,837 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 828378248, now seen corresponding path program 1 times [2021-08-21 17:53:44,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:44,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718503158] [2021-08-21 17:53:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:44,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:53:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:53:44,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:53:44,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718503158] [2021-08-21 17:53:44,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718503158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:53:44,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:53:44,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 17:53:44,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030988881] [2021-08-21 17:53:44,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:53:44,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:53:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:53:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,884 INFO L87 Difference]: Start difference. First operand 5596 states and 10732 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:53:44,920 INFO L93 Difference]: Finished difference Result 5460 states and 9504 transitions. [2021-08-21 17:53:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:53:44,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-21 17:53:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:53:44,933 INFO L225 Difference]: With dead ends: 5460 [2021-08-21 17:53:44,934 INFO L226 Difference]: Without dead ends: 4368 [2021-08-21 17:53:44,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2021-08-21 17:53:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4368. [2021-08-21 17:53:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4368 states, 4367 states have (on average 1.7694069155026333) internal successors, (7727), 4367 states have internal predecessors, (7727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 7727 transitions. [2021-08-21 17:53:45,027 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 7727 transitions. Word has length 31 [2021-08-21 17:53:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:53:45,028 INFO L470 AbstractCegarLoop]: Abstraction has 4368 states and 7727 transitions. [2021-08-21 17:53:45,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 7727 transitions. [2021-08-21 17:53:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-21 17:53:45,038 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:45,038 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:53:45,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:53:45,039 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash -728706467, now seen corresponding path program 1 times [2021-08-21 17:53:45,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:45,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664608376] [2021-08-21 17:53:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:45,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:53:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:53:45,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:53:45,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664608376] [2021-08-21 17:53:45,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664608376] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:53:45,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:53:45,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 17:53:45,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762713649] [2021-08-21 17:53:45,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:53:45,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:53:45,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:53:45,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:45,086 INFO L87 Difference]: Start difference. First operand 4368 states and 7727 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:53:45,113 INFO L93 Difference]: Finished difference Result 3792 states and 6701 transitions. [2021-08-21 17:53:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:53:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-08-21 17:53:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:53:45,127 INFO L225 Difference]: With dead ends: 3792 [2021-08-21 17:53:45,130 INFO L226 Difference]: Without dead ends: 3792 [2021-08-21 17:53:45,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:53:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2021-08-21 17:53:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3792. [2021-08-21 17:53:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 1.767607491427064) internal successors, (6701), 3791 states have internal predecessors, (6701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 6701 transitions. [2021-08-21 17:53:45,216 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 6701 transitions. Word has length 39 [2021-08-21 17:53:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:53:45,218 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 6701 transitions. [2021-08-21 17:53:45,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:53:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 6701 transitions. [2021-08-21 17:53:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-21 17:53:45,227 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:53:45,227 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:53:45,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:53:45,227 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2021-08-21 17:53:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:53:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1925433191, now seen corresponding path program 2 times [2021-08-21 17:53:45,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:53:45,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885131046] [2021-08-21 17:53:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:53:45,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:53:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:53:45,253 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:53:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:53:45,293 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:53:45,293 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:53:45,294 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT [2021-08-21 17:53:45,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0INUSE_VIOLATION [2021-08-21 17:53:45,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATION [2021-08-21 17:53:45,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION [2021-08-21 17:53:45,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION [2021-08-21 17:53:45,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3INUSE_VIOLATION [2021-08-21 17:53:45,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATION [2021-08-21 17:53:45,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err1INUSE_VIOLATION [2021-08-21 17:53:45,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err2INUSE_VIOLATION [2021-08-21 17:53:45,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION [2021-08-21 17:53:45,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION [2021-08-21 17:53:45,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:53:45,302 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:53:45,303 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:53:45,345 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:53:45 BasicIcfg [2021-08-21 17:53:45,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:53:45,347 INFO L168 Benchmark]: Toolchain (without parser) took 4197.92 ms. Allocated memory was 201.3 MB in the beginning and 575.7 MB in the end (delta: 374.3 MB). Free memory was 180.4 MB in the beginning and 330.6 MB in the end (delta: -150.2 MB). Peak memory consumption was 225.4 MB. Max. memory is 8.0 GB. [2021-08-21 17:53:45,347 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.48 ms. Allocated memory is still 201.3 MB. Free memory was 181.7 MB in the beginning and 181.6 MB in the end (delta: 76.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:53:45,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.25 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 178.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:53:45,348 INFO L168 Benchmark]: Boogie Preprocessor took 24.85 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 177.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-21 17:53:45,348 INFO L168 Benchmark]: RCFGBuilder took 269.31 ms. Allocated memory is still 201.3 MB. Free memory was 177.7 MB in the beginning and 162.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-08-21 17:53:45,349 INFO L168 Benchmark]: TraceAbstraction took 3872.00 ms. Allocated memory was 201.3 MB in the beginning and 575.7 MB in the end (delta: 374.3 MB). Free memory was 161.6 MB in the beginning and 330.6 MB in the end (delta: -169.0 MB). Peak memory consumption was 206.5 MB. Max. memory is 8.0 GB. [2021-08-21 17:53:45,350 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.48 ms. Allocated memory is still 201.3 MB. Free memory was 181.7 MB in the beginning and 181.6 MB in the end (delta: 76.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 27.25 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 178.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 24.85 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 177.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 269.31 ms. Allocated memory is still 201.3 MB. Free memory was 177.7 MB in the beginning and 162.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3872.00 ms. Allocated memory was 201.3 MB in the beginning and 575.7 MB in the end (delta: 374.3 MB). Free memory was 161.6 MB in the beginning and 330.6 MB in the end (delta: -169.0 MB). Peak memory consumption was 206.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 54634, positive: 49948, positive conditional: 49948, positive unconditional: 0, negative: 4686, negative conditional: 4686, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50918, positive: 49948, positive conditional: 0, positive unconditional: 49948, negative: 970, negative conditional: 0, negative unconditional: 970, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 944, positive: 924, positive conditional: 0, positive unconditional: 924, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 944, positive: 916, positive conditional: 0, positive unconditional: 916, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50918, positive: 49024, positive conditional: 0, positive unconditional: 49024, negative: 950, negative conditional: 0, negative unconditional: 950, unknown: 944, unknown conditional: 0, unknown unconditional: 944] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 924, Positive conditional cache size: 0, Positive unconditional cache size: 924, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Independence queries for same thread: 3716 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_6=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_6=-1, x_0=-1, x_8=-1, y_1=0, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_6=-1, x_0=-1, x_8=-1, y_1=0, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=-1, x_8=-1, y_1=0, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=0, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L65] JOIN 3 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L66] JOIN 4 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L108] JOIN 5 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] - UnprovableResult [Line: 63]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 3631.9ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 158.6ms, AutomataDifference: 688.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1166.8ms, PartialOrderReductionTime: 1152.1ms, HoareTripleCheckerStatistics: 396 SDtfs, 201 SDslu, 168 SDs, 0 SdLazy, 37 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10820occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 994.9ms AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 23.3ms SsaConstructionTime, 97.7ms SatisfiabilityAnalysisTime, 285.2ms InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-21 17:53:45,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...