/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/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 15:50:19,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 15:50:19,298 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 15:50:19,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 15:50:19,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 15:50:19,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 15:50:19,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 15:50:19,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 15:50:19,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 15:50:19,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 15:50:19,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 15:50:19,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 15:50:19,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 15:50:19,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 15:50:19,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:50:19,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:50:19,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:50:19,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 15:50:19,323 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 15:50:19,323 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 15:50:19,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 15:50:19,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 15:50:19,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 15:50:19,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 15:50:19,567 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 15:50:19,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-14 15:50:20,898 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f83075d/2fecbb59685247529dec2be4c2d04353/FLAG9bea0e267 [2025-04-14 15:50:21,112 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 15:50:21,113 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-14 15:50:21,124 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f83075d/2fecbb59685247529dec2be4c2d04353/FLAG9bea0e267 [2025-04-14 15:50:21,948 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f83075d/2fecbb59685247529dec2be4c2d04353 [2025-04-14 15:50:21,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 15:50:21,952 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 15:50:21,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 15:50:21,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 15:50:21,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 15:50:21,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:50:21" (1/1) ... [2025-04-14 15:50:21,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7275d8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:21, skipping insertion in model container [2025-04-14 15:50:21,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:50:21" (1/1) ... [2025-04-14 15:50:21,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 15:50:22,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2025-04-14 15:50:22,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:50:22,157 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 15:50:22,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2025-04-14 15:50:22,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:50:22,194 INFO L204 MainTranslator]: Completed translation [2025-04-14 15:50:22,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22 WrapperNode [2025-04-14 15:50:22,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 15:50:22,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 15:50:22,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 15:50:22,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 15:50:22,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,220 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-04-14 15:50:22,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 15:50:22,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 15:50:22,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 15:50:22,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 15:50:22,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 15:50:22,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 15:50:22,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 15:50:22,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 15:50:22,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (1/1) ... [2025-04-14 15:50:22,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:50:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:50:22,268 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 15:50:22,270 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 15:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 15:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 15:50:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 15:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 15:50:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 15:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 15:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 15:50:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 15:50:22,288 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 15:50:22,341 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 15:50:22,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 15:50:22,440 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 15:50:22,440 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 15:50:22,511 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 15:50:22,511 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 15:50:22,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:50:22 BoogieIcfgContainer [2025-04-14 15:50:22,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 15:50:22,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 15:50:22,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 15:50:22,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 15:50:22,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:50:21" (1/3) ... [2025-04-14 15:50:22,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24253907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:50:22, skipping insertion in model container [2025-04-14 15:50:22,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:50:22" (2/3) ... [2025-04-14 15:50:22,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24253907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:50:22, skipping insertion in model container [2025-04-14 15:50:22,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:50:22" (3/3) ... [2025-04-14 15:50:22,518 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-04-14 15:50:22,528 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 15:50:22,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 17 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 15:50:22,531 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 15:50:22,570 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 15:50:22,603 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:50:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 15:50:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:50:22,606 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 15:50:22,608 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 15:50:22,660 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:50:22,676 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 15:50:22,681 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;@7e416eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:50:22,682 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 15:50:22,815 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:50:22,816 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:50:22,816 INFO L139 ounterexampleChecker]: Examining path program with hash 278792276, occurence #1 [2025-04-14 15:50:22,816 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:50:22,816 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:50:22,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:50:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash -634803934, now seen corresponding path program 1 times [2025-04-14 15:50:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:50:22,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518649890] [2025-04-14 15:50:22,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:50:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:50:22,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 15:50:22,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 15:50:22,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:50:22,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:23,311 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 15:50:23,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:50:23,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518649890] [2025-04-14 15:50:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518649890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:50:23,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:50:23,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 15:50:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302318107] [2025-04-14 15:50:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:50:23,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 15:50:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:50:23,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 15:50:23,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-14 15:50:23,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:23,336 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:50:23,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 15:50:23,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:23,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:23,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 15:50:23,393 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:50:23,393 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:50:23,393 INFO L139 ounterexampleChecker]: Examining path program with hash 278792276, occurence #2 [2025-04-14 15:50:23,393 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:50:23,393 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:50:23,408 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:23,408 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:50:23,408 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:23,408 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 15:50:23,408 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:23,409 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:50:23,409 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:50:23,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:50:23,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1759028197, now seen corresponding path program 2 times [2025-04-14 15:50:23,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:50:23,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517298620] [2025-04-14 15:50:23,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:50:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:50:23,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 15:50:23,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 15:50:23,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:50:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:23,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:50:23,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517298620] [2025-04-14 15:50:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517298620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:50:23,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942979497] [2025-04-14 15:50:23,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:50:23,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:50:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:50:23,697 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 15:50:23,699 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 15:50:23,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 15:50:23,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 15:50:23,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:50:23,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:23,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 15:50:23,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:50:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:23,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:50:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942979497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:50:24,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:50:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-04-14 15:50:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220676506] [2025-04-14 15:50:24,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:50:24,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 15:50:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:50:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 15:50:24,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-14 15:50:24,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:24,137 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:50:24,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 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 15:50:24,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:24,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:24,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:24,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:50:24,359 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 15:50:24,555 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 15:50:24,555 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:50:24,555 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:50:24,555 INFO L139 ounterexampleChecker]: Examining path program with hash 278792276, occurence #3 [2025-04-14 15:50:24,555 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:50:24,555 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:50:24,555 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:24,556 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:50:24,556 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:24,556 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 15:50:24,556 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:24,556 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:50:24,556 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:50:24,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:50:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 487110718, now seen corresponding path program 1 times [2025-04-14 15:50:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:50:24,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585258381] [2025-04-14 15:50:24,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:50:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:50:24,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 15:50:24,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 15:50:24,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:50:24,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:25,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:50:25,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585258381] [2025-04-14 15:50:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585258381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:50:25,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255796008] [2025-04-14 15:50:25,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:50:25,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:50:25,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:50:25,308 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 15:50:25,312 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 15:50:25,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 15:50:25,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 15:50:25,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:50:25,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:25,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 15:50:25,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:50:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:25,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:50:30,015 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x_2~0 4294967296))) (let ((.cse1 (+ .cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 2) 4294967296))) (.cse0 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296)) (.cse2 (+ (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) 1))) (and (forall ((v_z_12 Int)) (or (< .cse0 v_z_12) (< .cse1 (+ (mod (+ (* v_z_12 2) c_~x_1~0) 4294967296) 4294967297)) (< v_z_12 .cse2))) (forall ((v_z_13 Int)) (let ((.cse3 (mod (+ (* v_z_13 2) c_~x_1~0) 4294967296))) (or (< .cse0 v_z_13) (< (+ .cse3 4294967294) (+ .cse4 .cse5)) (< v_z_13 .cse2) (< .cse1 (+ .cse3 1))))) (forall ((v_z_10 Int)) (or (< .cse0 v_z_10) (< (mod (+ (* v_z_10 2) c_~x_1~0) 4294967296) (+ 2 .cse4 .cse5)) (< v_z_10 .cse2)))))) is different from false [2025-04-14 15:50:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-14 15:50:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255796008] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:50:30,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:50:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2025-04-14 15:50:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549711801] [2025-04-14 15:50:30,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:50:30,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 15:50:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:50:30,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 15:50:30,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=267, Unknown=1, NotChecked=34, Total=380 [2025-04-14 15:50:30,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:30,240 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:50:30,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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 15:50:30,240 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:30,240 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:50:30,240 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:31,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:31,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:50:31,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 15:50:31,053 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 15:50:31,248 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 15:50:31,248 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:50:31,248 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:50:31,249 INFO L139 ounterexampleChecker]: Examining path program with hash 278792276, occurence #4 [2025-04-14 15:50:31,249 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:50:31,249 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:50:31,249 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:31,249 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:50:31,249 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:31,249 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 15:50:31,249 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:31,249 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:50:31,249 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:50:31,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:50:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1218397794, now seen corresponding path program 2 times [2025-04-14 15:50:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:50:31,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732200827] [2025-04-14 15:50:31,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:50:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:50:31,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 15:50:31,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 15:50:31,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:50:31,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:50:32,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732200827] [2025-04-14 15:50:32,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732200827] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:50:32,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67448061] [2025-04-14 15:50:32,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:50:32,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:50:32,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:50:32,184 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 15:50:32,186 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 15:50:32,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 15:50:32,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 15:50:32,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:50:32,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:32,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-14 15:50:32,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:50:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:32,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:50:37,700 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_thread1Thread1of1ForFork1_~i~0 4) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296)) (.cse1 (mod c_~x_2~0 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 3) 4294967296))) (let ((.cse3 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse8 (+ .cse1 .cse2)) (.cse4 (+ (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) 1)) (.cse6 (< .cse9 (+ .cse5 1))) (.cse7 (+ .cse1 .cse9))) (and (forall ((v_z_20 Int)) (let ((.cse0 (mod (+ (* v_z_20 4) c_~x_1~0) 4294967296))) (or (< .cse0 (+ 2 .cse1 .cse2)) (< .cse3 v_z_20) (< v_z_20 .cse4) (< .cse0 (+ 2 .cse1 .cse5))))) (or .cse6 (forall ((v_z_20 Int)) (or (< .cse3 v_z_20) (< .cse7 (+ 4294967297 (mod (+ (* v_z_20 4) c_~x_1~0) 4294967296))) (< v_z_20 .cse4)))) (or (forall ((v_z_20 Int)) (or (< .cse3 v_z_20) (< .cse7 (+ (mod (+ (* v_z_20 4) c_~x_1~0) 4294967296) 1)) (< v_z_20 .cse4))) .cse6 (< 4294967294 .cse8)) (or (forall ((v_z_20 Int)) (or (< .cse3 v_z_20) (< (+ 4294967294 (mod (+ (* v_z_20 4) c_~x_1~0) 4294967296)) .cse8) (< v_z_20 .cse4))) .cse6 (< .cse7 4294967296))))) is different from false [2025-04-14 15:50:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-14 15:50:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67448061] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:50:38,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:50:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 25 [2025-04-14 15:50:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950710326] [2025-04-14 15:50:38,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:50:38,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 15:50:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:50:38,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 15:50:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2025-04-14 15:50:38,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:38,037 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:50:38,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 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 15:50:38,037 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:38,037 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:50:38,037 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 15:50:38,037 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:50:51,392 WARN L286 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 89 DAG size of output: 82 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:50:52,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:50:52,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:50:52,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 15:50:52,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 15:50:52,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 15:50:52,864 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 15:50:52,864 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:50:52,864 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:50:52,864 INFO L139 ounterexampleChecker]: Examining path program with hash 278792276, occurence #5 [2025-04-14 15:50:52,864 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:50:52,864 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:50:52,865 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:52,865 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:50:52,865 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:52,865 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 15:50:52,865 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:50:52,865 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:50:52,865 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:50:52,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:50:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1506518409, now seen corresponding path program 3 times [2025-04-14 15:50:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:50:52,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64871702] [2025-04-14 15:50:52,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:50:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:50:52,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-04-14 15:50:52,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 15:50:52,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 15:50:52,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:50:53,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64871702] [2025-04-14 15:50:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64871702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:50:53,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297178613] [2025-04-14 15:50:53,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:50:53,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:50:53,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:50:53,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 15:50:53,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 15:50:53,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-04-14 15:50:53,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 15:50:53,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 15:50:53,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:50:53,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 15:50:53,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:50:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:50:54,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:51:49,343 WARN L286 SmtUtils]: Spent 19.68s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:52:50,522 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse2 (+ .cse1 6)) (.cse5 (+ .cse1 8)) (.cse0 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (or (< 4294967295 v_z_32) (< (+ .cse0 v_z_32) (+ .cse1 4294967304)) (not (= (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)) 1)))) (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse3 (+ .cse0 v_z_31))) (or (< .cse2 .cse3) (not (= (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)) 1)) (< 4294967295 .cse3) (< v_z_31 0)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse4 (+ .cse0 v_z_32))) (or (< .cse4 .cse5) (< v_z_32 0) (not (= (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)) 1)) (< 4294967295 .cse4)))) (forall ((v_z_29 Int) (v_y_29 Int)) (let ((.cse6 (+ .cse0 v_z_29))) (or (not (= (+ (* 3067833783 v_z_29) (* v_y_29 4294967296)) 1)) (< .cse2 .cse6) (< .cse6 4294967296)))) (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse7 (+ .cse0 v_z_31))) (or (not (= (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)) 1)) (< (+ 4294967302 .cse1) .cse7) (< .cse7 4294967296) (< 4294967295 v_z_31) (< .cse7 .cse5))))))) is different from false [2025-04-14 15:53:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:53:10,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297178613] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:53:10,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:53:10,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2025-04-14 15:53:10,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486511800] [2025-04-14 15:53:10,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:53:10,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 15:53:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:53:10,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 15:53:10,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1037, Unknown=5, NotChecked=66, Total=1260 [2025-04-14 15:53:10,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:53:10,618 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:53:10,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 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 15:53:10,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:53:10,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:53:10,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 15:53:10,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 15:53:10,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:53:14,746 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse2 (+ .cse1 6)) (.cse5 (+ .cse1 8)) (.cse0 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (or (< 4294967295 v_z_32) (< (+ .cse0 v_z_32) (+ .cse1 4294967304)) (not (= (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)) 1)))) (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse3 (+ .cse0 v_z_31))) (or (< .cse2 .cse3) (not (= (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)) 1)) (< 4294967295 .cse3) (< v_z_31 0)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse4 (+ .cse0 v_z_32))) (or (< .cse4 .cse5) (< v_z_32 0) (not (= (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)) 1)) (< 4294967295 .cse4)))) (forall ((v_z_29 Int) (v_y_29 Int)) (let ((.cse6 (+ .cse0 v_z_29))) (or (not (= (+ (* 3067833783 v_z_29) (* v_y_29 4294967296)) 1)) (< .cse2 .cse6) (< .cse6 4294967296)))) (= c_~x_2~0 0) (= c_~x_1~0 0) (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse7 (+ .cse0 v_z_31))) (or (not (= (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)) 1)) (< (+ 4294967302 .cse1) .cse7) (< .cse7 4294967296) (< 4294967295 v_z_31) (< .cse7 .cse5))))))) is different from false [2025-04-14 15:53:18,953 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread1Thread1of1ForFork1_~i~0 6) 4294967296)) (.cse2 (mod c_~x_2~0 4294967296)) (.cse8 (mod (+ 7 c_thread1Thread1of1ForFork1_~i~0) 4294967296))) (let ((.cse0 (< .cse8 (+ (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) 1))) (.cse6 (+ .cse8 .cse2)) (.cse5 (+ 2 .cse2 .cse3)) (.cse1 (mod c_~x_1~0 4294967296))) (and (or .cse0 (and (forall ((v_z_32 Int) (v_y_32 Int)) (or (< 4294967295 v_z_32) (< (+ .cse1 v_z_32) (+ .cse2 .cse3 4294967298)) (not (= (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)) 1)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse4 (+ .cse1 v_z_32))) (or (< .cse4 .cse5) (< v_z_32 0) (not (= (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)) 1)) (< 4294967295 .cse4)))))) (= c_~x_2~0 0) (or .cse0 (and (forall ((v_z_29 Int) (v_y_29 Int)) (or (not (= (+ (* 3067833783 v_z_29) (* v_y_29 4294967296)) 1)) (< .cse6 (+ .cse1 v_z_29 4294967297)) (< v_z_29 0))) (forall ((v_z_29 Int) (v_y_29 Int)) (or (not (= (+ (* 3067833783 v_z_29) (* v_y_29 4294967296)) 1)) (< .cse6 (+ .cse1 v_z_29 1)) (< 4294967295 v_z_29) (< (+ .cse1 v_z_29) 4294967296))))) (or .cse0 (and (forall ((v_z_31 Int) (v_y_31 Int)) (or (not (= (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)) 1)) (< 4294967295 (+ .cse1 v_z_31)) (< v_z_31 0) (< .cse6 (+ .cse1 v_z_31 1)) (< (+ .cse1 v_z_31 4294967294) (+ .cse2 .cse3)))) (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse7 (+ .cse1 v_z_31))) (or (not (= (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)) 1)) (< .cse7 .cse5) (< .cse7 4294967296) (< 4294967295 v_z_31) (< (+ .cse8 4294967295 .cse2) .cse7)))))) (= c_thread1Thread1of1ForFork1_~i~0 0) (= c_~x_1~0 0)))) is different from false [2025-04-14 15:53:23,153 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse14 (mod (+ 7 c_thread1Thread1of1ForFork1_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296)) (.cse7 (mod (+ c_thread1Thread1of1ForFork1_~i~0 6) 4294967296))) (let ((.cse3 (+ 2 .cse6 .cse7)) (.cse1 (+ (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) 1)) (.cse11 (+ .cse14 .cse6)) (.cse4 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse5 (mod c_~x_1~0 4294967296)) (.cse9 (< .cse14 (+ (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) 1)))) (and (or (and (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse0 (+ (* v_y_32 4294967296) (* 3067833783 v_z_32))) (.cse2 (+ .cse5 v_z_32))) (or (< .cse0 .cse1) (< .cse2 .cse3) (< v_z_32 0) (< .cse4 .cse0) (< 4294967295 .cse2)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse8 (+ (* v_y_32 4294967296) (* 3067833783 v_z_32)))) (or (< 4294967295 v_z_32) (< (+ .cse5 v_z_32) (+ .cse6 .cse7 4294967298)) (< .cse8 .cse1) (< .cse4 .cse8))))) .cse9) (or .cse9 (and (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse10 (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)))) (or (< .cse10 .cse1) (< 4294967295 (+ .cse5 v_z_31)) (< v_z_31 0) (< .cse11 (+ .cse5 v_z_31 1)) (< (+ .cse5 v_z_31 4294967294) (+ .cse6 .cse7)) (< .cse4 .cse10)))) (forall ((v_z_31 Int) (v_y_31 Int)) (let ((.cse12 (+ .cse5 v_z_31)) (.cse13 (+ (* 3067833783 v_z_31) (* v_y_31 4294967296)))) (or (< .cse12 .cse3) (< .cse13 .cse1) (< .cse12 4294967296) (< 4294967295 v_z_31) (< (+ .cse14 4294967295 .cse6) .cse12) (< .cse4 .cse13)))))) (= c_~x_2~0 0) (or (and (forall ((v_z_29 Int) (v_y_29 Int)) (let ((.cse15 (+ (* 3067833783 v_z_29) (* v_y_29 4294967296)))) (or (< .cse15 .cse1) (< .cse11 (+ .cse5 v_z_29 4294967297)) (< .cse4 .cse15) (< v_z_29 0)))) (forall ((v_z_29 Int) (v_y_29 Int)) (let ((.cse16 (+ (* 3067833783 v_z_29) (* v_y_29 4294967296)))) (or (< .cse16 .cse1) (< .cse11 (+ .cse5 v_z_29 1)) (< .cse4 .cse16) (< 4294967295 v_z_29) (< (+ .cse5 v_z_29) 4294967296))))) .cse9) (= c_thread1Thread1of1ForFork1_~i~0 0) (= c_~x_1~0 0) (= c_thread2Thread1of1ForFork0_~i~1 0)))) is different from false [2025-04-14 15:53:32,353 WARN L286 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:53:39,733 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:53:53,169 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:54:06,167 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 109 DAG size of output: 107 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:54:09,277 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:54:09,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:54:09,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:54:09,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 15:54:09,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 15:54:09,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 15:54:09,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 15:54:09,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:54:09,487 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:54:09,487 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:54:09,487 INFO L139 ounterexampleChecker]: Examining path program with hash 278792276, occurence #6 [2025-04-14 15:54:09,487 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:54:09,487 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:54:09,487 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:54:09,487 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:54:09,487 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:54:09,487 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 15:54:09,487 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:54:09,487 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:54:09,487 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:54:09,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:54:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash -107079554, now seen corresponding path program 4 times [2025-04-14 15:54:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:54:09,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282257405] [2025-04-14 15:54:09,488 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 15:54:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:54:09,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 15:54:09,523 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 15:54:09,523 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 15:54:09,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:54:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:54:11,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:54:11,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282257405] [2025-04-14 15:54:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282257405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:54:11,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424081273] [2025-04-14 15:54:11,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 15:54:11,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:54:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:54:11,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 15:54:11,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 15:54:11,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 15:54:11,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 15:54:11,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 15:54:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:54:11,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-14 15:54:11,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:54:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:54:20,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:55:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:55:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424081273] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:55:16,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:55:16,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 55 [2025-04-14 15:55:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187513360] [2025-04-14 15:55:16,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:55:16,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-14 15:55:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:55:16,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-14 15:55:16,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2736, Unknown=4, NotChecked=0, Total=3080 [2025-04-14 15:55:16,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:55:16,542 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:55:16,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 55 states have internal predecessors, (71), 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 15:55:16,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:55:16,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 15:55:16,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 15:55:16,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 15:55:16,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-14 15:55:16,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:55:20,789 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~b~0 4294967296))) (let ((.cse7 (mod (+ c_thread1Thread1of1ForFork1_~i~0 12) 4294967296)) (.cse5 (mod (+ 7 c_thread1Thread1of1ForFork1_~i~0) 4294967296)) (.cse1 (mod (+ c_thread1Thread1of1ForFork1_~i~0 6) 4294967296)) (.cse3 (mod (+ 5 c_thread1Thread1of1ForFork1_~i~0) 4294967296)) (.cse4 (mod (+ c_thread1Thread1of1ForFork1_~i~0 8) 4294967296)) (.cse11 (mod (+ c_thread1Thread1of1ForFork1_~i~0 9) 4294967296)) (.cse9 (mod (+ c_thread1Thread1of1ForFork1_~i~0 4) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork1_~i~0 10) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork1_~i~0 11) 4294967296)) (.cse13 (mod (+ c_thread1Thread1of1ForFork1_~i~0 2) 4294967296)) (.cse14 (mod (+ c_thread1Thread1of1ForFork1_~i~0 3) 4294967296)) (.cse0 (mod c_~x_2~0 4294967296)) (.cse8 (< .cse2 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) 1))) (.cse12 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (or (= .cse0 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 .cse2) (< .cse2 (+ .cse3 1))) (or (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) .cse0) (< .cse4 .cse2) (< .cse2 (+ .cse5 1))) (or (< .cse2 (+ .cse6 1)) (< .cse7 .cse2) (= (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296) .cse0)) (or (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 13) 4294967296) .cse2) (< .cse2 (+ .cse7 1)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) (mod c_~a~0 4294967296)) .cse8 (= (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296) .cse0)) (or (= .cse0 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse5 .cse2) (< .cse2 (+ .cse1 1))) (or (< .cse2 (+ .cse9 1)) (< .cse3 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) .cse0)) (= c_~x_2~0 0) (or (< .cse10 .cse2) (< .cse2 (+ .cse11 1)) (= .cse0 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (< .cse2 (+ .cse4 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) .cse0) (< .cse11 .cse2)) (or (< .cse2 (+ .cse12 1)) (< .cse13 .cse2) (= .cse0 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296))) (or (= .cse0 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse9 .cse2) (< .cse2 (+ .cse14 1))) (or (< .cse2 (+ .cse10 1)) (< .cse6 .cse2) (= .cse0 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296))) (= c_~x_1~0 0) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) .cse0) (< .cse2 (+ .cse13 1)) (< .cse14 .cse2)) (or (= .cse0 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) .cse8 (< .cse12 .cse2))))) is different from false Received shutdown request... [2025-04-14 16:05:04,235 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:05:04,237 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:05:04,240 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:05:05,245 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 16:05:05,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 16:05:05,439 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 16:05:05,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 16:05:05,459 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-14 16:05:05,461 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 16:05:05,461 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 16:05:05,461 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 16:05:05,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 16:05:05,466 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2] [2025-04-14 16:05:05,468 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 16:05:05,468 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 16:05:05,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:05:05 BasicIcfg [2025-04-14 16:05:05,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 16:05:05,470 INFO L158 Benchmark]: Toolchain (without parser) took 883518.75ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 99.5MB in the beginning and 129.4MB in the end (delta: -29.9MB). Peak memory consumption was 130.2MB. Max. memory is 8.0GB. [2025-04-14 16:05:05,470 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:05:05,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 85.0MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 16:05:05,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.25ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:05:05,471 INFO L158 Benchmark]: Boogie Preprocessor took 14.37ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.8MB in the end (delta: 775.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 16:05:05,471 INFO L158 Benchmark]: IcfgBuilder took 275.86ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 64.0MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 16:05:05,471 INFO L158 Benchmark]: TraceAbstraction took 882956.62ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 64.0MB in the beginning and 129.4MB in the end (delta: -65.4MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. [2025-04-14 16:05:05,472 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.15ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 85.0MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.25ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.37ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.8MB in the end (delta: 775.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 275.86ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 64.0MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 882956.62ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 64.0MB in the beginning and 129.4MB in the end (delta: -65.4MB). Peak memory consumption was 96.7MB. 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: 431, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 122, dependent conditional: 120, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 88, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 88, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 311, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 88, unknown conditional: 0, unknown unconditional: 88] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 225, Maximal queried relation: 0, Independence queries for same thread: 120, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 14, Number of trivial persistent sets: 11, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 431, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 122, dependent conditional: 120, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 225, independent unconditional: 84, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 88, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 88, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 311, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 88, unknown conditional: 0, unknown unconditional: 88] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 225, Maximal queried relation: 0, Independence queries for same thread: 120 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 25 locations, 28 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 882.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 663.4s, 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: 99, 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.5s SatisfiabilityAnalysisTime, 217.8s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 292 ConstructedInterpolants, 15 QuantifiedInterpolants, 10431 SizeOfPredicates, 30 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/315 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]: 15, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown