/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.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 12:28:18,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 12:28:18,280 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 12:28:18,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 12:28:18,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 12:28:18,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 12:28:18,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 12:28:18,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 12:28:18,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 12:28:18,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 12:28:18,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 12:28:18,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 12:28:18,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 12:28:18,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:28:18,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:28:18,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 12:28:18,312 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 12:28:18,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 12:28:18,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 12:28:18,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 12:28:18,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 12:28:18,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 12:28:18,538 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 12:28:18,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2025-04-14 12:28:19,807 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b976a7794/98d1586cb659475fb8ddd2224af9c290/FLAGadda4afd7 [2025-04-14 12:28:19,987 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 12:28:19,988 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2025-04-14 12:28:19,993 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b976a7794/98d1586cb659475fb8ddd2224af9c290/FLAGadda4afd7 [2025-04-14 12:28:20,858 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b976a7794/98d1586cb659475fb8ddd2224af9c290 [2025-04-14 12:28:20,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 12:28:20,861 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 12:28:20,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 12:28:20,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 12:28:20,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 12:28:20,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:28:20" (1/1) ... [2025-04-14 12:28:20,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269f5467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:20, skipping insertion in model container [2025-04-14 12:28:20,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:28:20" (1/1) ... [2025-04-14 12:28:20,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 12:28:21,049 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-dist.wvr.c[2155,2168] [2025-04-14 12:28:21,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:28:21,061 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 12:28:21,093 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-dist.wvr.c[2155,2168] [2025-04-14 12:28:21,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:28:21,106 INFO L204 MainTranslator]: Completed translation [2025-04-14 12:28:21,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21 WrapperNode [2025-04-14 12:28:21,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 12:28:21,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 12:28:21,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 12:28:21,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 12:28:21,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,135 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-04-14 12:28:21,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 12:28:21,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 12:28:21,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 12:28:21,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 12:28:21,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 12:28:21,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 12:28:21,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 12:28:21,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 12:28:21,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (1/1) ... [2025-04-14 12:28:21,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:28:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:28:21,189 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 12:28:21,195 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 12:28:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 12:28:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 12:28:21,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 12:28:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 12:28:21,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 12:28:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 12:28:21,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 12:28:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 12:28:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 12:28:21,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 12:28:21,212 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 12:28:21,278 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 12:28:21,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 12:28:21,422 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 12:28:21,422 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 12:28:21,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 12:28:21,513 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 12:28:21,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:28:21 BoogieIcfgContainer [2025-04-14 12:28:21,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 12:28:21,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 12:28:21,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 12:28:21,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 12:28:21,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:28:20" (1/3) ... [2025-04-14 12:28:21,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1415e2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:28:21, skipping insertion in model container [2025-04-14 12:28:21,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:28:21" (2/3) ... [2025-04-14 12:28:21,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1415e2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:28:21, skipping insertion in model container [2025-04-14 12:28:21,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:28:21" (3/3) ... [2025-04-14 12:28:21,523 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2025-04-14 12:28:21,536 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 12:28:21,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-dist.wvr.c that has 4 procedures, 23 locations, 22 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 12:28:21,538 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 12:28:21,585 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 12:28:21,619 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:28:21,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 12:28:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:28:21,622 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 12:28:21,624 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 12:28:21,678 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 12:28:21,689 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 12:28:21,694 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;@6cdc34e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:28:21,694 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 12:28:21,882 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 12:28:21,882 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:28:21,882 INFO L139 ounterexampleChecker]: Examining path program with hash -1909108040, occurence #1 [2025-04-14 12:28:21,882 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:28:21,882 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:28:21,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:28:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2022854732, now seen corresponding path program 1 times [2025-04-14 12:28:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:28:21,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883126785] [2025-04-14 12:28:21,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:28:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:28:21,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 12:28:22,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 12:28:22,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:28:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:28:22,709 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 12:28:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:28:22,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883126785] [2025-04-14 12:28:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883126785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:28:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:28:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 12:28:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151776012] [2025-04-14 12:28:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:28:22,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 12:28:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:28:22,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 12:28:22,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-14 12:28:22,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:28:22,732 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:28:22,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 12:28:22,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:28:23,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 12:28:23,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 12:28:23,003 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 12:28:23,003 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:28:23,003 INFO L139 ounterexampleChecker]: Examining path program with hash -1909108040, occurence #2 [2025-04-14 12:28:23,003 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:28:23,004 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:28:23,014 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:28:23,014 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 12:28:23,014 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:28:23,014 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 12:28:23,014 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:28:23,014 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-14 12:28:23,014 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:28:23,014 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:28:23,014 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:28:23,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:28:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2084985710, now seen corresponding path program 1 times [2025-04-14 12:28:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:28:23,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999482733] [2025-04-14 12:28:23,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:28:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:28:23,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 12:28:23,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 12:28:23,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:28:23,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:28:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:28:23,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:28:23,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999482733] [2025-04-14 12:28:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999482733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:28:23,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178853236] [2025-04-14 12:28:23,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:28:23,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:28:23,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:28:23,535 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 12:28:23,536 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 12:28:23,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 12:28:23,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 12:28:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:28:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:28:23,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 12:28:23,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:28:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:28:24,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:28:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:28:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178853236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:28:37,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:28:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-04-14 12:28:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467518590] [2025-04-14 12:28:37,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:28:37,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 12:28:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:28:37,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 12:28:37,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=703, Unknown=2, NotChecked=0, Total=870 [2025-04-14 12:28:37,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:28:37,631 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:28:37,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 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 12:28:37,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 12:28:37,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:28:54,882 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 79 DAG size of output: 79 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:29:09,033 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:12,226 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:16,229 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:21,832 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:23,646 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:29,931 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:34,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:29:35,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 12:29:35,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 12:29:35,027 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 12:29:35,221 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 12:29:35,222 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 12:29:35,222 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:29:35,222 INFO L139 ounterexampleChecker]: Examining path program with hash -1909108040, occurence #3 [2025-04-14 12:29:35,222 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:29:35,222 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:29:35,222 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:29:35,222 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 12:29:35,222 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:29:35,222 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 12:29:35,222 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:29:35,222 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 12:29:35,222 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:29:35,222 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:29:35,222 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:29:35,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:29:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1230957004, now seen corresponding path program 2 times [2025-04-14 12:29:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:29:35,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738472497] [2025-04-14 12:29:35,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:29:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:29:35,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 12:29:35,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 12:29:35,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:29:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:29:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:29:36,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:29:36,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738472497] [2025-04-14 12:29:36,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738472497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:29:36,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681141289] [2025-04-14 12:29:36,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:29:36,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:29:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:29:36,090 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 12:29:36,091 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 12:29:36,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 12:29:36,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 12:29:36,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:29:36,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:29:36,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-14 12:29:36,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:29:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:29:36,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:29:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:29:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681141289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:29:52,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:29:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 49 [2025-04-14 12:29:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664036912] [2025-04-14 12:29:52,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:29:52,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-14 12:29:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:29:52,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-14 12:29:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1929, Unknown=1, NotChecked=0, Total=2352 [2025-04-14 12:29:52,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:29:52,893 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:29:52,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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 12:29:52,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 12:29:52,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-04-14 12:29:52,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:14,224 WARN L286 SmtUtils]: Spent 56.08s on a formula simplification. DAG size of input: 106 DAG size of output: 106 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:36:01,975 WARN L286 SmtUtils]: Spent 4.21m on a formula simplification. DAG size of input: 180 DAG size of output: 123 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:38:13,942 WARN L286 SmtUtils]: Spent 1.79m on a formula simplification. DAG size of input: 106 DAG size of output: 106 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:38:18,142 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse45 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse36 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse37 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse23 (mod c_~a~0 4294967296)) (.cse35 (mod c_~b~0 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse46 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse47 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse44 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse31 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse44 .cse31)) (.cse12 (+ 4294967297 .cse47)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse30 (+ .cse14 .cse46)) (.cse21 (+ .cse0 4294967297)) (.cse11 (+ .cse22 .cse29)) (.cse24 (< .cse29 .cse35)) (.cse33 (< .cse10 .cse23)) (.cse25 (< .cse35 (+ .cse9 1))) (.cse34 (< .cse23 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse26 (< .cse47 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse17 (+ .cse47 1)) (.cse28 (+ .cse37 .cse22)) (.cse3 (+ .cse36 1)) (.cse32 (+ .cse13 .cse31)) (.cse38 (+ .cse44 .cse45)) (.cse4 (+ .cse37 2 .cse45)) (.cse42 (+ .cse36 4294967297)) (.cse43 (+ .cse0 4294967294)) (.cse5 (+ .cse44 .cse31)) (.cse40 (+ 4294967297 .cse18)) (.cse41 (+ .cse36 4294967294)) (.cse19 (+ 2 .cse22 .cse29)) (.cse16 (+ .cse37 .cse45)) (.cse39 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse46))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) .cse24 (< .cse23 (+ .cse10 1)) .cse25 .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse29))) (or (< .cse30 .cse6) (< .cse7 (+ .cse13 2 .cse31))) (or (< .cse20 .cse32) (< .cse30 .cse21)) (or .cse33 .cse34 (< .cse9 .cse35) .cse26) (or (< .cse36 (+ .cse37 2 .cse22)) (< .cse38 .cse39)) (or (< .cse16 .cse40) (< .cse41 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or .cse24 .cse33 .cse25 .cse34 .cse26) (or (< .cse2 .cse42) (< .cse43 .cse5)) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse29)) (< .cse28 .cse17)) (or (< .cse38 .cse40) (< .cse41 .cse28)) (or (< .cse32 .cse3) (< .cse0 (+ 2 .cse44 .cse45))) (or (< .cse32 .cse42) (< .cse43 .cse38)) (or (< .cse36 .cse4) (< .cse5 .cse39)) (or (< .cse5 .cse42) (< .cse43 .cse16)) (or (< .cse5 .cse40) (< .cse41 .cse16)) (or (< .cse36 .cse19) (< .cse16 .cse39)) (or (< 2 .cse2) (< .cse15 4))))) is different from false [2025-04-14 12:40:02,834 WARN L286 SmtUtils]: Spent 1.33m 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 12:40:06,922 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse42 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse33 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse34 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse45 (mod c_~b~0 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse43 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse44 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse31 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse41 .cse31)) (.cse12 (+ 4294967297 .cse44)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse30 (+ .cse14 .cse43)) (.cse21 (+ .cse0 4294967297)) (.cse11 (+ .cse22 .cse29)) (.cse24 (< .cse29 .cse45)) (.cse25 (< .cse45 (+ .cse9 1))) (.cse23 (mod c_~a~0 4294967296)) (.cse26 (< .cse44 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse17 (+ .cse44 1)) (.cse28 (+ .cse34 .cse22)) (.cse3 (+ .cse33 1)) (.cse32 (+ .cse13 .cse31)) (.cse35 (+ .cse41 .cse42)) (.cse4 (+ .cse34 2 .cse42)) (.cse39 (+ .cse33 4294967297)) (.cse40 (+ .cse0 4294967294)) (.cse5 (+ .cse41 .cse31)) (.cse37 (+ 4294967297 .cse18)) (.cse38 (+ .cse33 4294967294)) (.cse19 (+ 2 .cse22 .cse29)) (.cse16 (+ .cse34 .cse42)) (.cse36 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse43))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) .cse24 (< .cse23 (+ .cse10 1)) .cse25 .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse29))) (or (< .cse30 .cse6) (< .cse7 (+ .cse13 2 .cse31))) (or (< .cse20 .cse32) (< .cse30 .cse21)) (or (< .cse33 (+ .cse34 2 .cse22)) (< .cse35 .cse36)) (or (< .cse16 .cse37) (< .cse38 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or .cse24 (< .cse10 .cse23) .cse25 (< .cse23 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse26) (or (< .cse2 .cse39) (< .cse40 .cse5)) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse29)) (< .cse28 .cse17)) (or (< .cse35 .cse37) (< .cse38 .cse28)) (or (< .cse32 .cse3) (< .cse0 (+ 2 .cse41 .cse42))) (or (< .cse32 .cse39) (< .cse40 .cse35)) (or (< .cse33 .cse4) (< .cse5 .cse36)) (or (< .cse5 .cse39) (< .cse40 .cse16)) (or (< .cse5 .cse37) (< .cse38 .cse16)) (or (< .cse33 .cse19) (< .cse16 .cse36)) (or (< 2 .cse2) (< .cse15 4))))) is different from false Received shutdown request... [2025-04-14 12:43:05,540 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:43:05,557 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 12:43:05,566 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 12:43:06,547 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 12:43:06,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-14 12:43:06,766 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 12:43:06,772 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 12:43:06,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 12:43:06,773 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-14 12:43:06,775 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 12:43:06,775 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 12:43:06,775 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 12:43:06,775 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 12:43:06,779 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-04-14 12:43:06,780 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 12:43:06,780 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 12:43:06,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:43:06 BasicIcfg [2025-04-14 12:43:06,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 12:43:06,784 INFO L158 Benchmark]: Toolchain (without parser) took 885922.46ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 92.2MB in the end (delta: 18.3MB). Peak memory consumption was 83.3MB. Max. memory is 8.0GB. [2025-04-14 12:43:06,784 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:43:06,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.89ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 95.6MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 12:43:06,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.35ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 94.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:43:06,785 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 93.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 12:43:06,785 INFO L158 Benchmark]: RCFGBuilder took 351.46ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 69.9MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 12:43:06,785 INFO L158 Benchmark]: TraceAbstraction took 885268.60ms. Allocated memory is still 155.2MB. Free memory was 69.3MB in the beginning and 92.2MB in the end (delta: -22.9MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2025-04-14 12:43:06,786 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.21ms. Allocated memory is still 163.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.89ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 95.6MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.35ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 94.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 93.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 351.46ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 69.9MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 885268.60ms. Allocated memory is still 155.2MB. Free memory was 69.3MB in the beginning and 92.2MB in the end (delta: -22.9MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 183, dependent conditional: 179, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 963, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 963, independent: 724, independent conditional: 0, independent unconditional: 724, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 726, Maximal queried relation: 0, Independence queries for same thread: 179, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 21, Number of trivial persistent sets: 15, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 183, dependent conditional: 179, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 726, independent unconditional: 233, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 963, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 963, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 963, independent: 724, independent conditional: 0, independent unconditional: 724, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 726, Maximal queried relation: 0, Independence queries for same thread: 179 - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 72]: 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: 73]: 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: 74]: 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 7 procedures, 35 locations, 40 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 885.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 851.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 85, 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.2s SatisfiabilityAnalysisTime, 32.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 3491 SizeOfPredicates, 8 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/99 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]: 10, 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