/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 14:55:52,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 14:55:52,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 14:55:52,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 14:55:52,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 14:55:52,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 14:55:52,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 14:55:52,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 14:55:52,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 14:55:52,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 14:55:52,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 14:55:52,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 14:55:52,090 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 14:55:52,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 14:55:52,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 14:55:52,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 14:55:52,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 14:55:52,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 14:55:52,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 14:55:52,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:55:52,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:55:52,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:55:52,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 14:55:52,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 14:55:52,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 14:55:52,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 14:55:52,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 14:55:52,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 14:55:52,306 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 14:55:52,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-14 14:55:53,560 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8711a5714/b685c1341f6d429a8d50d785ef0bdaca/FLAG087fd038b [2025-04-14 14:55:53,762 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 14:55:53,762 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-14 14:55:53,775 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8711a5714/b685c1341f6d429a8d50d785ef0bdaca/FLAG087fd038b [2025-04-14 14:55:54,611 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8711a5714/b685c1341f6d429a8d50d785ef0bdaca [2025-04-14 14:55:54,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 14:55:54,614 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 14:55:54,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 14:55:54,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 14:55:54,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 14:55:54,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:55:54" (1/1) ... [2025-04-14 14:55:54,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d902b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:54, skipping insertion in model container [2025-04-14 14:55:54,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:55:54" (1/1) ... [2025-04-14 14:55:54,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 14:55:54,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-04-14 14:55:55,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:55:55,087 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 14:55:55,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-04-14 14:55:55,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:55:55,198 INFO L204 MainTranslator]: Completed translation [2025-04-14 14:55:55,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55 WrapperNode [2025-04-14 14:55:55,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 14:55:55,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 14:55:55,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 14:55:55,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 14:55:55,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,239 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-04-14 14:55:55,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 14:55:55,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 14:55:55,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 14:55:55,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 14:55:55,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 14:55:55,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 14:55:55,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 14:55:55,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 14:55:55,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (1/1) ... [2025-04-14 14:55:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:55:55,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:55:55,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 14:55:55,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 14:55:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 14:55:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 14:55:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-14 14:55:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-14 14:55:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 14:55:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 14:55:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 14:55:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 14:55:55,307 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 14:55:55,390 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 14:55:55,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 14:55:55,504 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 14:55:55,505 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 14:55:55,685 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 14:55:55,685 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 14:55:55,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:55:55 BoogieIcfgContainer [2025-04-14 14:55:55,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 14:55:55,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 14:55:55,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 14:55:55,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 14:55:55,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:55:54" (1/3) ... [2025-04-14 14:55:55,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1bb5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:55:55, skipping insertion in model container [2025-04-14 14:55:55,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:55:55" (2/3) ... [2025-04-14 14:55:55,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1bb5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:55:55, skipping insertion in model container [2025-04-14 14:55:55,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:55:55" (3/3) ... [2025-04-14 14:55:55,693 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-14 14:55:55,703 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 14:55:55,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 20 locations, 21 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 14:55:55,705 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 14:55:55,733 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 14:55:55,763 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:55:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 14:55:55,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:55:55,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 14:55:55,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 14:55:55,823 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:55:55,835 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 14:55:55,843 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36878677, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:55:55,843 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 14:55:55,918 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:55:55,919 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:55:55,919 INFO L139 ounterexampleChecker]: Examining path program with hash -1655060743, occurence #1 [2025-04-14 14:55:55,919 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:55:55,919 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:55:55,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:55:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1415052900, now seen corresponding path program 1 times [2025-04-14 14:55:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:55:55,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696966936] [2025-04-14 14:55:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:55:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:55:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 14:55:56,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 14:55:56,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:55:56,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:55:56,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696966936] [2025-04-14 14:55:56,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696966936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:55:56,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:55:56,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:55:56,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619500483] [2025-04-14 14:55:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:55:56,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:55:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:55:56,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:55:56,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:55:56,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:56,182 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:55:56,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-04-14 14:55:56,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:56,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:56,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 14:55:56,238 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:55:56,238 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:55:56,238 INFO L139 ounterexampleChecker]: Examining path program with hash -169981558, occurence #1 [2025-04-14 14:55:56,238 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:55:56,239 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:55:56,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:55:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash 478999818, now seen corresponding path program 1 times [2025-04-14 14:55:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:55:56,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120272473] [2025-04-14 14:55:56,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:55:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:55:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 14:55:56,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 14:55:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:55:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:56,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:55:56,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120272473] [2025-04-14 14:55:56,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120272473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:55:56,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025465968] [2025-04-14 14:55:56,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:55:56,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:55:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:55:56,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:55:56,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 14:55:56,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 14:55:56,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 14:55:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:55:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:56,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 14:55:56,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:55:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:56,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:55:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025465968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:55:56,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:55:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 14:55:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655702185] [2025-04-14 14:55:56,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:55:56,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 14:55:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:55:56,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 14:55:56,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 14:55:56,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:56,553 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:55:56,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2025-04-14 14:55:56,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:56,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:56,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:56,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:55:56,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 14:55:56,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-14 14:55:56,861 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:55:56,861 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:55:56,861 INFO L139 ounterexampleChecker]: Examining path program with hash -169981558, occurence #2 [2025-04-14 14:55:56,861 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:55:56,862 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 14:55:56,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:55:56,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 14:55:56,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:56,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 14:55:56,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:56,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 14:55:56,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:56,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 14:55:56,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:56,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 14:55:56,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:55:56,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-04-14 14:55:56,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:56,875 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:55:56,875 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:55:56,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:55:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1325380860, now seen corresponding path program 2 times [2025-04-14 14:55:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:55:56,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197840613] [2025-04-14 14:55:56,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:55:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:55:56,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-14 14:55:56,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 14:55:56,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 14:55:56,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:57,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:55:57,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197840613] [2025-04-14 14:55:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197840613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:55:57,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888811418] [2025-04-14 14:55:57,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:55:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:55:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:55:57,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:55:57,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 14:55:57,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-14 14:55:57,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 14:55:57,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 14:55:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:57,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 14:55:57,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:55:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:57,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:55:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888811418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:55:57,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:55:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-04-14 14:55:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562479601] [2025-04-14 14:55:57,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:55:57,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 14:55:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:55:57,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 14:55:57,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-04-14 14:55:57,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:57,365 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:55:57,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 19 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:55:57,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:57,366 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:55:57,366 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:57,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:57,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:55:57,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 14:55:57,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 14:55:57,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:55:57,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:55:57,817 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:55:57,818 INFO L139 ounterexampleChecker]: Examining path program with hash -741679036, occurence #1 [2025-04-14 14:55:57,818 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:55:57,818 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:55:57,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:55:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1740805947, now seen corresponding path program 3 times [2025-04-14 14:55:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:55:57,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344259836] [2025-04-14 14:55:57,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 14:55:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:55:57,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 13 equivalence classes. [2025-04-14 14:55:57,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 106 of 106 statements. [2025-04-14 14:55:57,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-04-14 14:55:57,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:55:58,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344259836] [2025-04-14 14:55:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344259836] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:55:58,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068928111] [2025-04-14 14:55:58,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 14:55:58,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:55:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:55:58,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:55:58,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 14:55:58,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 13 equivalence classes. [2025-04-14 14:55:58,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 106 of 106 statements. [2025-04-14 14:55:58,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-04-14 14:55:58,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:55:58,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 14:55:58,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:55:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:58,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:55:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:55:58,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068928111] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:55:58,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:55:58,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-04-14 14:55:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618217615] [2025-04-14 14:55:58,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:55:58,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 14:55:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:55:58,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 14:55:58,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-14 14:55:58,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:58,745 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:55:58,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 23 states have internal predecessors, (172), 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) [2025-04-14 14:55:58,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:58,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:55:58,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-14 14:55:58,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:55:58,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:55:58,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:55:58,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 14:55:58,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:55:58,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 14:55:59,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:55:59,141 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:55:59,141 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:55:59,142 INFO L139 ounterexampleChecker]: Examining path program with hash -741679036, occurence #2 [2025-04-14 14:55:59,142 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 14:55:59,142 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 41 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 49 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 14:55:59,142 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 73 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 81 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 97 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 105 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 113 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 121 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 129 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 137 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,143 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 145 [2025-04-14 14:55:59,143 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,144 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 153 [2025-04-14 14:55:59,144 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,144 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 161 [2025-04-14 14:55:59,144 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,144 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 165 [2025-04-14 14:55:59,144 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:55:59,144 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 168 [2025-04-14 14:55:59,144 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:55:59,144 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:55:59,144 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:55:59,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:55:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1238780939, now seen corresponding path program 4 times [2025-04-14 14:55:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:55:59,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367717421] [2025-04-14 14:55:59,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 14:55:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:55:59,161 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-04-14 14:55:59,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-04-14 14:55:59,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 14:55:59,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:55:59,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 14:55:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-14 14:55:59,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-14 14:55:59,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:55:59,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:55:59,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 14:55:59,300 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 14:55:59,301 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-14 14:55:59,302 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 14:55:59,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 14:55:59,306 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-04-14 14:55:59,438 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 14:55:59,439 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 14:55:59,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 14:55:59,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:55:59 BasicIcfg [2025-04-14 14:55:59,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 14:55:59,448 INFO L158 Benchmark]: Toolchain (without parser) took 4833.77ms. Allocated memory is still 155.2MB. Free memory was 104.8MB in the beginning and 35.2MB in the end (delta: 69.6MB). Peak memory consumption was 71.6MB. Max. memory is 8.0GB. [2025-04-14 14:55:59,448 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:55:59,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.56ms. Allocated memory is still 155.2MB. Free memory was 104.8MB in the beginning and 64.3MB in the end (delta: 40.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-14 14:55:59,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.73ms. Allocated memory is still 155.2MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 14:55:59,449 INFO L158 Benchmark]: Boogie Preprocessor took 21.39ms. Allocated memory is still 155.2MB. Free memory was 61.0MB in the beginning and 60.1MB in the end (delta: 916.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:55:59,449 INFO L158 Benchmark]: IcfgBuilder took 420.17ms. Allocated memory is still 155.2MB. Free memory was 60.1MB in the beginning and 97.2MB in the end (delta: -37.1MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2025-04-14 14:55:59,449 INFO L158 Benchmark]: TraceAbstraction took 3759.98ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 35.2MB in the end (delta: 61.2MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2025-04-14 14:55:59,450 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 584.56ms. Allocated memory is still 155.2MB. Free memory was 104.8MB in the beginning and 64.3MB in the end (delta: 40.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.73ms. Allocated memory is still 155.2MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.39ms. Allocated memory is still 155.2MB. Free memory was 61.0MB in the beginning and 60.1MB in the end (delta: 916.8kB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 420.17ms. Allocated memory is still 155.2MB. Free memory was 60.1MB in the beginning and 97.2MB in the end (delta: -37.1MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3759.98ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 35.2MB in the end (delta: 61.2MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 961, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 236, dependent conditional: 232, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 733, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 733, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 735, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 735, independent: 725, independent conditional: 0, independent unconditional: 725, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 735, independent: 725, independent conditional: 0, independent unconditional: 725, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 735, independent: 652, independent conditional: 0, independent unconditional: 652, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 641, Maximal queried relation: 1, Independence queries for same thread: 228, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 38, Number of trivial persistent sets: 34, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 961, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 236, dependent conditional: 232, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 733, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 733, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 735, independent: 725, independent conditional: 635, independent unconditional: 90, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 735, independent: 725, independent conditional: 0, independent unconditional: 725, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 735, independent: 725, independent conditional: 0, independent unconditional: 725, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 735, independent: 652, independent conditional: 0, independent unconditional: 652, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 641, Maximal queried relation: 1, Independence queries for same thread: 228 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\at(arg, Pre)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=0, myglobal=0, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=1, j=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=1, j=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=1, j=1, myglobal=2, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=2] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=3, myglobal=3] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=2, j=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=2, j=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=2, j=3, myglobal=4, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=3, myglobal=4] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=5, myglobal=5] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=5, myglobal=5] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=3, j=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=3, j=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, i=3, j=5, myglobal=6, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=5, myglobal=6] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=7, myglobal=7] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=7, myglobal=7] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, i=4, j=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, i=4, j=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, i=4, j=7, myglobal=8, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=7, myglobal=8] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=9, myglobal=9] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=9, myglobal=9] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, i=5, j=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, i=5, j=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, i=5, j=9, myglobal=10, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=9, myglobal=10] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=11, myglobal=11] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=11, myglobal=11] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, i=6, j=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, i=6, j=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, i=6, j=11, myglobal=12, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=11, myglobal=12] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=13, myglobal=13] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=13, myglobal=13] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, i=7, j=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, i=7, j=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, i=7, j=13, myglobal=14, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=13, myglobal=14] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=15, myglobal=15] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=15, myglobal=15] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, i=8, j=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, i=8, j=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, i=8, j=15, myglobal=16, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=15, myglobal=16] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=17, myglobal=17] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=17, myglobal=17] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, i=9, j=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, i=9, j=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, i=9, j=17, myglobal=18, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=17, myglobal=18] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=19, myglobal=19] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=19, myglobal=19] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=9, j=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=9, j=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=10, j=19, myglobal=20, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=19, myglobal=20] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=21, myglobal=21] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=21, myglobal=21] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=11, j=21, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=11, j=21, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=11, j=21, myglobal=22, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=21, myglobal=22] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=23, myglobal=23] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=23, myglobal=23] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=12, j=23, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=12, j=23, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=12, j=23, myglobal=24, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=23, myglobal=24] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=25, myglobal=25] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=25, myglobal=25] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=13, j=25, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=13, j=25, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=13, j=25, myglobal=26, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=25, myglobal=26] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=27, myglobal=27] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=27, myglobal=27] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=14, j=27, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=14, j=27, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=14, j=27, myglobal=28, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=27, myglobal=28] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=29, myglobal=29] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=29, myglobal=29] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=15, j=29, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=15, j=29, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=15, j=29, myglobal=30, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=29, myglobal=30] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=31, myglobal=31] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=31, myglobal=31] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=16, j=31, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=16, j=31, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=16, j=31, myglobal=32, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=31, myglobal=32] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=33, myglobal=33] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=33, myglobal=33] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=17, j=33, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=17, j=33, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=17, j=33, myglobal=34, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=33, myglobal=34] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=35, myglobal=35] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=35, myglobal=35] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=18, j=35, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=18, j=35, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=18, j=35, myglobal=36, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=35, myglobal=36] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=37, myglobal=37] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=37, myglobal=37] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=19, j=37, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=19, j=37, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=19, j=37, myglobal=38, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=37, myglobal=38] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, j=39, myglobal=39] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=39, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=39, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1352] COND FALSE 0 !(i<20) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\at(arg, Pre)={0:0}, \at(cond, Pre)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=39, myglobal=40] [L13] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(cond, Pre)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=39, myglobal=40] - UnprovableResult [Line: 1342]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 28 locations, 31 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 613 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1854 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 13, ConditionCalculationTime [ms]: 0, ConditionCalculations: 26, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 14:55:59,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...