/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 12:29:21,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 12:29:21,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 12:29:21,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 12:29:21,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 12:29:21,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 12:29:21,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 12:29:21,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 12:29:21,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 12:29:21,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 12:29:21,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 12:29:21,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 12:29:21,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 12:29:21,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 12:29:21,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 12:29:21,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 12:29:21,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 12:29:21,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 12:29:21,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 12:29:21,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 12:29:21,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 12:29:21,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 12:29:21,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 12:29:21,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 12:29:21,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 12:29:21,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 12:29:21,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 12:29:21,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 12:29:21,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 12:29:21,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 12:29:21,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 12:29:21,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 12:29:21,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 12:29:21,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 12:29:21,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 12:29:21,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 12:29:21,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 12:29:21,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 12:29:21,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 12:29:21,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 12:29:21,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 12:29:21,486 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-08-21 12:29:21,515 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 12:29:21,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 12:29:21,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 12:29:21,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 12:29:21,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 12:29:21,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 12:29:21,519 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 12:29:21,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 12:29:21,519 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 12:29:21,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 12:29:21,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 12:29:21,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 12:29:21,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 12:29:21,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 12:29:21,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 12:29:21,520 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 12:29:21,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 12:29:21,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 12:29:21,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 12:29:21,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 12:29:21,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 12:29:21,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 12:29:21,522 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 12:29:21,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 12:29:21,522 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 12:29:21,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 12:29:21,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 12:29:21,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 12:29:21,791 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-08-21 12:29:21,792 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-08-21 12:29:21,793 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 12:29:21,793 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 12:29:21,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 12:29:21,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-08-21 12:29:21,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 12:29:21,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 12:29:21,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 12:29:21,837 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,842 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 12:29:21,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 12:29:21,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 12:29:21,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 12:29:21,854 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,854 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,856 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,856 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,861 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,863 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,863 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 12:29:21,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 12:29:21,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 12:29:21,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 12:29:21,866 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 12:29:21" (1/1) ... [2021-08-21 12:29:21,871 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 12:29:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 12:29:21,920 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 12:29:21,923 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 12:29:21,958 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-08-21 12:29:21,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-08-21 12:29:21,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-08-21 12:29:21,959 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-08-21 12:29:21,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-08-21 12:29:21,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-08-21 12:29:21,959 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-08-21 12:29:21,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 12:29:21,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 12:29:21,961 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-08-21 12:29:21,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-08-21 12:29:21,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-08-21 12:29:21,961 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-08-21 12:29:21,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-08-21 12:29:21,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-08-21 12:29:21,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-08-21 12:29:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-08-21 12:29:21,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-08-21 12:29:21,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-08-21 12:29:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-08-21 12:29:21,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-08-21 12:29:21,965 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 12:29:22,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 12:29:22,183 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-21 12:29:22,185 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 12:29:22 BoogieIcfgContainer [2021-08-21 12:29:22,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 12:29:22,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 12:29:22,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 12:29:22,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 12:29:22,188 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 12:29:21" (1/2) ... [2021-08-21 12:29:22,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247953a2 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 12:29:22, skipping insertion in model container [2021-08-21 12:29:22,189 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 12:29:22" (2/2) ... [2021-08-21 12:29:22,189 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-08-21 12:29:22,192 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 12:29:22,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 12:29:22,193 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-21 12:29:22,193 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 12:29:22,317 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-08-21 12:29:22,387 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 12:29:22,391 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 12:29:22,392 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-08-21 12:29:22,398 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-08-21 12:29:23,145 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 0 states have call successors, (0), 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 12:29:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 0 states have call successors, (0), 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 12:29:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-21 12:29:23,297 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:23,298 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 12:29:23,298 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 12:29:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 513493419, now seen corresponding path program 1 times [2021-08-21 12:29:23,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:23,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551732898] [2021-08-21 12:29:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:23,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 12:29:23,546 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 12:29:23,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 12:29:23,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551732898] [2021-08-21 12:29:23,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551732898] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 12:29:23,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 12:29:23,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 12:29:23,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653862300] [2021-08-21 12:29:23,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 12:29:23,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 12:29:23,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 12:29:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:23,583 INFO L87 Difference]: Start difference. First operand has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 0 states have call successors, (0), 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 12:29:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 12:29:23,807 INFO L93 Difference]: Finished difference Result 11214 states and 45854 transitions. [2021-08-21 12:29:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 12:29:23,808 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 12:29:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 12:29:23,963 INFO L225 Difference]: With dead ends: 11214 [2021-08-21 12:29:23,963 INFO L226 Difference]: Without dead ends: 11193 [2021-08-21 12:29:23,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2021-08-21 12:29:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10962. [2021-08-21 12:29:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10962 states, 10961 states have (on average 4.090958854119149) internal successors, (44841), 10961 states have internal predecessors, (44841), 0 states have call successors, (0), 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 12:29:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 44841 transitions. [2021-08-21 12:29:24,537 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 44841 transitions. Word has length 23 [2021-08-21 12:29:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 12:29:24,539 INFO L470 AbstractCegarLoop]: Abstraction has 10962 states and 44841 transitions. [2021-08-21 12:29:24,539 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 12:29:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 44841 transitions. [2021-08-21 12:29:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 12:29:24,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:24,640 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 12:29:24,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 12:29:24,640 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 12:29:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2098976562, now seen corresponding path program 1 times [2021-08-21 12:29:24,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:24,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785281413] [2021-08-21 12:29:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:24,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 12:29:24,686 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 12:29:24,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 12:29:24,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785281413] [2021-08-21 12:29:24,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785281413] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 12:29:24,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 12:29:24,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 12:29:24,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200379417] [2021-08-21 12:29:24,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 12:29:24,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 12:29:24,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 12:29:24,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:24,692 INFO L87 Difference]: Start difference. First operand 10962 states and 44841 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 12:29:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 12:29:24,857 INFO L93 Difference]: Finished difference Result 13038 states and 52625 transitions. [2021-08-21 12:29:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 12:29:24,857 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 12:29:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 12:29:25,000 INFO L225 Difference]: With dead ends: 13038 [2021-08-21 12:29:25,005 INFO L226 Difference]: Without dead ends: 12721 [2021-08-21 12:29:25,006 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 12:29:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12721 states. [2021-08-21 12:29:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12721 to 11889. [2021-08-21 12:29:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11888 states have (on average 4.034909152086137) internal successors, (47967), 11888 states have internal predecessors, (47967), 0 states have call successors, (0), 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 12:29:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 47967 transitions. [2021-08-21 12:29:25,385 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 47967 transitions. Word has length 31 [2021-08-21 12:29:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 12:29:25,385 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 47967 transitions. [2021-08-21 12:29:25,386 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 12:29:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 47967 transitions. [2021-08-21 12:29:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 12:29:25,419 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:25,419 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 12:29:25,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 12:29:25,420 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 12:29:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2052651792, now seen corresponding path program 1 times [2021-08-21 12:29:25,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:25,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218657687] [2021-08-21 12:29:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:25,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 12:29:25,439 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 12:29:25,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 12:29:25,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218657687] [2021-08-21 12:29:25,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218657687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 12:29:25,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 12:29:25,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 12:29:25,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022959963] [2021-08-21 12:29:25,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 12:29:25,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 12:29:25,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 12:29:25,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:25,441 INFO L87 Difference]: Start difference. First operand 11889 states and 47967 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 12:29:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 12:29:25,634 INFO L93 Difference]: Finished difference Result 11681 states and 45149 transitions. [2021-08-21 12:29:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 12:29:25,634 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 12:29:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 12:29:25,668 INFO L225 Difference]: With dead ends: 11681 [2021-08-21 12:29:25,668 INFO L226 Difference]: Without dead ends: 9378 [2021-08-21 12:29:25,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2021-08-21 12:29:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9378. [2021-08-21 12:29:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9377 states have (on average 3.84099392129679) internal successors, (36017), 9377 states have internal predecessors, (36017), 0 states have call successors, (0), 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 12:29:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 36017 transitions. [2021-08-21 12:29:26,008 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 36017 transitions. Word has length 31 [2021-08-21 12:29:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 12:29:26,008 INFO L470 AbstractCegarLoop]: Abstraction has 9378 states and 36017 transitions. [2021-08-21 12:29:26,008 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 12:29:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 36017 transitions. [2021-08-21 12:29:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 12:29:26,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:26,037 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 12:29:26,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 12:29:26,037 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 12:29:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1264094886, now seen corresponding path program 1 times [2021-08-21 12:29:26,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:26,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120523463] [2021-08-21 12:29:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:26,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 12:29:26,091 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 12:29:26,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 12:29:26,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120523463] [2021-08-21 12:29:26,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120523463] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 12:29:26,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 12:29:26,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 12:29:26,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758895628] [2021-08-21 12:29:26,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 12:29:26,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 12:29:26,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 12:29:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:26,093 INFO L87 Difference]: Start difference. First operand 9378 states and 36017 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 12:29:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 12:29:26,260 INFO L93 Difference]: Finished difference Result 11158 states and 41887 transitions. [2021-08-21 12:29:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 12:29:26,260 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 12:29:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 12:29:26,335 INFO L225 Difference]: With dead ends: 11158 [2021-08-21 12:29:26,335 INFO L226 Difference]: Without dead ends: 10600 [2021-08-21 12:29:26,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2021-08-21 12:29:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10244. [2021-08-21 12:29:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10243 states have (on average 3.7574929219955093) internal successors, (38488), 10243 states have internal predecessors, (38488), 0 states have call successors, (0), 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 12:29:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 38488 transitions. [2021-08-21 12:29:26,655 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 38488 transitions. Word has length 31 [2021-08-21 12:29:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 12:29:26,655 INFO L470 AbstractCegarLoop]: Abstraction has 10244 states and 38488 transitions. [2021-08-21 12:29:26,655 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 12:29:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 38488 transitions. [2021-08-21 12:29:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-21 12:29:26,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:26,673 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 12:29:26,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 12:29:26,673 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 12:29:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash 550542672, now seen corresponding path program 1 times [2021-08-21 12:29:26,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:26,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700983290] [2021-08-21 12:29:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:26,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 12:29:26,714 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 12:29:26,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 12:29:26,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700983290] [2021-08-21 12:29:26,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700983290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 12:29:26,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 12:29:26,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 12:29:26,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949088394] [2021-08-21 12:29:26,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 12:29:26,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 12:29:26,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 12:29:26,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:26,716 INFO L87 Difference]: Start difference. First operand 10244 states and 38488 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 12:29:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 12:29:26,760 INFO L93 Difference]: Finished difference Result 9700 states and 34735 transitions. [2021-08-21 12:29:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 12:29:26,761 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 12:29:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 12:29:26,784 INFO L225 Difference]: With dead ends: 9700 [2021-08-21 12:29:26,784 INFO L226 Difference]: Without dead ends: 8001 [2021-08-21 12:29:26,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2021-08-21 12:29:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2021-08-21 12:29:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 3.590375) internal successors, (28723), 8000 states have internal predecessors, (28723), 0 states have call successors, (0), 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 12:29:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 28723 transitions. [2021-08-21 12:29:27,040 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 28723 transitions. Word has length 31 [2021-08-21 12:29:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 12:29:27,040 INFO L470 AbstractCegarLoop]: Abstraction has 8001 states and 28723 transitions. [2021-08-21 12:29:27,040 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 12:29:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 28723 transitions. [2021-08-21 12:29:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-21 12:29:27,055 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:27,055 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 12:29:27,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 12:29:27,056 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 12:29:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash 48999775, now seen corresponding path program 1 times [2021-08-21 12:29:27,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:27,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924653819] [2021-08-21 12:29:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:27,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 12:29:27,089 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 12:29:27,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 12:29:27,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924653819] [2021-08-21 12:29:27,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924653819] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 12:29:27,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 12:29:27,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 12:29:27,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472643428] [2021-08-21 12:29:27,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 12:29:27,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 12:29:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 12:29:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:27,091 INFO L87 Difference]: Start difference. First operand 8001 states and 28723 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 12:29:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 12:29:27,128 INFO L93 Difference]: Finished difference Result 6666 states and 23386 transitions. [2021-08-21 12:29:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 12:29:27,129 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 12:29:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 12:29:27,152 INFO L225 Difference]: With dead ends: 6666 [2021-08-21 12:29:27,152 INFO L226 Difference]: Without dead ends: 6666 [2021-08-21 12:29:27,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 12:29:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2021-08-21 12:29:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6666. [2021-08-21 12:29:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 6665 states have (on average 3.508777194298575) internal successors, (23386), 6665 states have internal predecessors, (23386), 0 states have call successors, (0), 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 12:29:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 23386 transitions. [2021-08-21 12:29:27,265 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 23386 transitions. Word has length 39 [2021-08-21 12:29:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 12:29:27,265 INFO L470 AbstractCegarLoop]: Abstraction has 6666 states and 23386 transitions. [2021-08-21 12:29:27,265 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 12:29:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 23386 transitions. [2021-08-21 12:29:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-21 12:29:27,278 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 12:29:27,278 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 12:29:27,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 12:29:27,278 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 12:29:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 12:29:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 938050459, now seen corresponding path program 2 times [2021-08-21 12:29:27,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 12:29:27,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646812621] [2021-08-21 12:29:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 12:29:27,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 12:29:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 12:29:27,432 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 12:29:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 12:29:27,459 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 12:29:27,460 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 12:29:27,460 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err1INUSE_VIOLATION [2021-08-21 12:29:27,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err2INUSE_VIOLATION [2021-08-21 12:29:27,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION [2021-08-21 12:29:27,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION [2021-08-21 12:29:27,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 12:29:27,468 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 12:29:27,468 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 12:29:27,488 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 12:29:27 BasicIcfg [2021-08-21 12:29:27,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 12:29:27,489 INFO L168 Benchmark]: Toolchain (without parser) took 5661.91 ms. Allocated memory was 196.1 MB in the beginning and 4.9 GB in the end (delta: 4.7 GB). Free memory was 175.4 MB in the beginning and 4.5 GB in the end (delta: -4.3 GB). Peak memory consumption was 382.4 MB. Max. memory is 8.0 GB. [2021-08-21 12:29:27,490 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 196.1 MB. Free memory was 176.8 MB in the beginning and 176.7 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 12:29:27,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.34 ms. Allocated memory is still 196.1 MB. Free memory was 175.4 MB in the beginning and 173.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-21 12:29:27,490 INFO L168 Benchmark]: Boogie Preprocessor took 15.71 ms. Allocated memory is still 196.1 MB. Free memory was 173.9 MB in the beginning and 172.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-21 12:29:27,491 INFO L168 Benchmark]: RCFGBuilder took 320.08 ms. Allocated memory is still 196.1 MB. Free memory was 172.8 MB in the beginning and 156.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-08-21 12:29:27,491 INFO L168 Benchmark]: TraceAbstraction took 5302.12 ms. Allocated memory was 196.1 MB in the beginning and 4.9 GB in the end (delta: 4.7 GB). Free memory was 156.3 MB in the beginning and 4.5 GB in the end (delta: -4.4 GB). Peak memory consumption was 363.5 MB. Max. memory is 8.0 GB. [2021-08-21 12:29:27,493 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 196.1 MB. Free memory was 176.8 MB in the beginning and 176.7 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 20.34 ms. Allocated memory is still 196.1 MB. Free memory was 175.4 MB in the beginning and 173.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 15.71 ms. Allocated memory is still 196.1 MB. Free memory was 173.9 MB in the beginning and 172.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 320.08 ms. Allocated memory is still 196.1 MB. Free memory was 172.8 MB in the beginning and 156.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5302.12 ms. Allocated memory was 196.1 MB in the beginning and 4.9 GB in the end (delta: 4.7 GB). Free memory was 156.3 MB in the beginning and 4.5 GB in the end (delta: -4.4 GB). Peak memory consumption was 363.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); 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] [L73] 3 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L74] 3 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L75] 3 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L88] 4 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L89] 4 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L90] 4 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L76] 3 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L77] 3 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L78] 3 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L91] 4 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L79] 3 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L92] 4 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L93] 4 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L94] 4 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L95] 4 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L80] 3 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L108] JOIN 3 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L109] JOIN 4 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, 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, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, 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, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L65] JOIN 5 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L66] JOIN 6 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=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_12=-1, temp_13=0, temp_14=-1, temp_15=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_12=-1, temp_13=0, temp_14=-1, temp_15=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_12=-1, temp_13=0, temp_14=-1, temp_15=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_12=-1, temp_13=0, temp_14=-1, temp_15=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: 5079.3ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 356.3ms, AutomataDifference: 1328.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 754.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 515 SDtfs, 206 SDslu, 251 SDs, 0 SdLazy, 37 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11889occurred in iteration=2, 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: 1967.5ms AutomataMinimizationTime, 6 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 23.0ms SsaConstructionTime, 232.0ms SatisfiabilityAnalysisTime, 205.0ms InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 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 12:29:27,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...