/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/pthread-theta/unwind2-nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 13:40:38,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 13:40:38,648 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 13:40:38,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 13:40:38,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 13:40:38,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 13:40:38,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 13:40:38,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 13:40:38,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 13:40:38,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 13:40:38,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 13:40:38,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 13:40:38,681 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 13:40:38,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 13:40:38,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 13:40:38,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 13:40:38,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 13:40:38,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 13:40:38,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 13:40:38,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 13:40:38,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:40:38,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:38,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:38,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 13:40:38,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 13:40:38,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 13:40:38,686 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 13:40:38,686 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 13:40:38,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 13:40:38,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 13:40:38,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 13:40:38,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 13:40:38,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 13:40:38,912 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 13:40:38,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-nondet.i [2025-04-14 13:40:40,228 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54530587e/ee8445beaebb4267b4c99b018ad6cb1b/FLAG1957ef087 [2025-04-14 13:40:40,457 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 13:40:40,458 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-nondet.i [2025-04-14 13:40:40,471 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54530587e/ee8445beaebb4267b4c99b018ad6cb1b/FLAG1957ef087 [2025-04-14 13:40:41,278 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54530587e/ee8445beaebb4267b4c99b018ad6cb1b [2025-04-14 13:40:41,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 13:40:41,281 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 13:40:41,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 13:40:41,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 13:40:41,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 13:40:41,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af5400f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41, skipping insertion in model container [2025-04-14 13:40:41,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 13:40:41,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-nondet.i[33026,33039] [2025-04-14 13:40:41,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:40:41,579 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 13:40:41,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-nondet.i[33026,33039] [2025-04-14 13:40:41,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:40:41,657 INFO L204 MainTranslator]: Completed translation [2025-04-14 13:40:41,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41 WrapperNode [2025-04-14 13:40:41,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 13:40:41,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 13:40:41,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 13:40:41,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 13:40:41,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,692 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-04-14 13:40:41,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 13:40:41,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 13:40:41,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 13:40:41,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 13:40:41,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 13:40:41,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 13:40:41,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 13:40:41,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 13:40:41,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (1/1) ... [2025-04-14 13:40:41,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:41,737 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 13:40:41,738 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 13:40:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 13:40:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 13:40:41,755 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 13:40:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 13:40:41,755 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 13:40:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 13:40:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 13:40:41,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 13:40:41,756 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 13:40:41,843 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 13:40:41,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 13:40:41,948 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 13:40:41,948 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 13:40:42,028 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 13:40:42,028 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 13:40:42,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:40:42 BoogieIcfgContainer [2025-04-14 13:40:42,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 13:40:42,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 13:40:42,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 13:40:42,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 13:40:42,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:40:41" (1/3) ... [2025-04-14 13:40:42,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7f0dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:40:42, skipping insertion in model container [2025-04-14 13:40:42,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:41" (2/3) ... [2025-04-14 13:40:42,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7f0dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:40:42, skipping insertion in model container [2025-04-14 13:40:42,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:40:42" (3/3) ... [2025-04-14 13:40:42,038 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-04-14 13:40:42,048 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 13:40:42,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 27 locations, 28 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 13:40:42,050 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 13:40:42,088 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 13:40:42,119 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:42,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 13:40:42,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:42,124 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 13:40:42,125 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 13:40:42,187 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:42,199 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork1 ======== [2025-04-14 13:40:42,204 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;@7982febf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:42,204 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:42,377 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:42,378 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:42,378 INFO L139 ounterexampleChecker]: Examining path program with hash -1933500773, occurence #1 [2025-04-14 13:40:42,378 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:42,378 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:42,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 81411259, now seen corresponding path program 1 times [2025-04-14 13:40:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:42,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839805559] [2025-04-14 13:40:42,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:42,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:42,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 13:40:42,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 13:40:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:42,652 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 13:40:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:42,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839805559] [2025-04-14 13:40:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839805559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:42,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:42,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:40:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229872097] [2025-04-14 13:40:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:42,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:42,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:42,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:40:42,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:42,671 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:42,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:40:42,672 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:42,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 13:40:42,774 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:42,774 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:42,774 INFO L139 ounterexampleChecker]: Examining path program with hash -1933500773, occurence #2 [2025-04-14 13:40:42,774 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:42,775 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:42,786 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:42,786 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:42,786 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:42,786 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:42,786 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:42,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 925531749, now seen corresponding path program 1 times [2025-04-14 13:40:42,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:42,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087530240] [2025-04-14 13:40:42,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:42,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:42,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:42,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:42,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:43,004 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 13:40:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:43,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087530240] [2025-04-14 13:40:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087530240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:43,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344163480] [2025-04-14 13:40:43,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:43,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:43,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:43,008 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 13:40:43,009 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 13:40:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:43,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:43,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:43,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 13:40:43,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:43,265 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 13:40:43,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:43,519 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 13:40:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344163480] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:43,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2025-04-14 13:40:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689578682] [2025-04-14 13:40:43,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:43,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 13:40:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:43,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 13:40:43,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-04-14 13:40:43,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:43,523 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:43,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 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 13:40:43,523 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:43,523 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:44,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:44,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 13:40:44,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:44,477 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 13:40:44,477 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:44,477 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:44,477 INFO L139 ounterexampleChecker]: Examining path program with hash -1933500773, occurence #3 [2025-04-14 13:40:44,477 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:44,477 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:44,478 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:44,478 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:44,478 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:44,478 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:44,478 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:44,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash 173225059, now seen corresponding path program 2 times [2025-04-14 13:40:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:44,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493093992] [2025-04-14 13:40:44,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:44,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:44,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 13:40:44,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:44,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 13:40:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:44,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493093992] [2025-04-14 13:40:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493093992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:44,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355896230] [2025-04-14 13:40:44,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:44,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:44,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:44,619 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 13:40:44,620 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 13:40:44,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 13:40:44,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:44,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:44,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 13:40:44,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:44,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355896230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:45,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:45,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 17] total 36 [2025-04-14 13:40:45,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133069912] [2025-04-14 13:40:45,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:45,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 13:40:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:45,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 13:40:45,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 13:40:45,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:45,284 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:45,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 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 13:40:45,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:45,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-14 13:40:45,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:49,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:49,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 13:40:49,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-04-14 13:40:49,587 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 13:40:49,783 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 13:40:49,783 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:49,783 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:49,783 INFO L139 ounterexampleChecker]: Examining path program with hash 548938410, occurence #1 [2025-04-14 13:40:49,783 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:49,783 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:49,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1319287373, now seen corresponding path program 3 times [2025-04-14 13:40:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:49,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160282191] [2025-04-14 13:40:49,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:49,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-04-14 13:40:49,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 13:40:49,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 13:40:49,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-14 13:40:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:49,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160282191] [2025-04-14 13:40:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160282191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:49,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433746660] [2025-04-14 13:40:49,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:49,897 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 13:40:49,898 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 13:40:49,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-04-14 13:40:49,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 13:40:49,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 13:40:49,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:49,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 13:40:49,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:50,116 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 13:40:50,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:50,292 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 13:40:50,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433746660] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:50,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:50,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 33 [2025-04-14 13:40:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120650151] [2025-04-14 13:40:50,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:50,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 13:40:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:50,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 13:40:50,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 13:40:50,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:50,294 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:50,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 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 13:40:50,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:50,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2025-04-14 13:40:50,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2025-04-14 13:40:50,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:51,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:51,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:40:51,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-04-14 13:40:51,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:40:51,365 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 13:40:51,560 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 13:40:51,560 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:51,560 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:51,561 INFO L139 ounterexampleChecker]: Examining path program with hash 1608695847, occurence #1 [2025-04-14 13:40:51,561 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:51,561 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:51,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1872765780, now seen corresponding path program 1 times [2025-04-14 13:40:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:51,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556687101] [2025-04-14 13:40:51,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:51,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 13:40:51,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 13:40:51,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:51,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 13:40:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:51,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556687101] [2025-04-14 13:40:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556687101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:51,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000872095] [2025-04-14 13:40:51,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:51,732 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 13:40:51,734 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 13:40:51,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 13:40:51,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 13:40:51,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:51,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:51,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 13:40:51,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:51,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000872095] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:52,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:52,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 38 [2025-04-14 13:40:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284950545] [2025-04-14 13:40:52,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:52,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 13:40:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:52,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 13:40:52,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1073, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 13:40:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:52,181 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:52,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 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 13:40:52,181 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:52,181 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:40:52,181 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2025-04-14 13:40:52,181 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:40:52,181 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:53,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:53,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:40:53,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-04-14 13:40:53,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:40:53,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-04-14 13:40:53,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:53,875 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 13:40:53,875 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:53,875 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:53,875 INFO L139 ounterexampleChecker]: Examining path program with hash 1608695847, occurence #2 [2025-04-14 13:40:53,875 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:53,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:53,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:53,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:53,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:53,876 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:53,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -519657760, now seen corresponding path program 1 times [2025-04-14 13:40:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:40:53,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169220397] [2025-04-14 13:40:53,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:53,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:40:53,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:40:53,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:53,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:53,887 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:40:53,887 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:40:53,887 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:53,887 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:53,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1453404066, now seen corresponding path program 2 times [2025-04-14 13:40:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:53,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926764769] [2025-04-14 13:40:53,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:53,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 13:40:53,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 13:40:53,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:53,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-14 13:40:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:53,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926764769] [2025-04-14 13:40:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926764769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:53,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843982446] [2025-04-14 13:40:53,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:53,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:53,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:53,997 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 13:40:53,998 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 13:40:54,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 13:40:54,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 13:40:54,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:54,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:54,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:40:54,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-14 13:40:54,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:40:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843982446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:40:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-14 13:40:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675564194] [2025-04-14 13:40:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:54,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:54,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:54,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:40:54,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:54,077 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:54,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 13:40:54,077 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:54,077 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:40:54,077 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2025-04-14 13:40:54,077 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:40:54,077 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2025-04-14 13:40:54,077 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:40:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-04-14 13:40:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:40:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-04-14 13:40:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:54,208 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 13:40:54,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:54,403 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:54,403 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:54,403 INFO L139 ounterexampleChecker]: Examining path program with hash -163534980, occurence #1 [2025-04-14 13:40:54,403 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:54,403 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:54,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2075079783, now seen corresponding path program 1 times [2025-04-14 13:40:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:54,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157167408] [2025-04-14 13:40:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:54,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 13:40:54,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 13:40:54,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:54,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:54,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:54,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 13:40:54,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 13:40:54,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:54,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:54,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:54,434 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:54,435 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:40:54,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 13:40:54,443 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-04-14 13:40:54,444 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork1 was UNSAFE (1/3) [2025-04-14 13:40:54,486 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 13:40:54,486 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 13:40:54,494 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 13:40:54,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:40:54 BasicIcfg [2025-04-14 13:40:54,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 13:40:54,496 INFO L158 Benchmark]: Toolchain (without parser) took 13214.89ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 85.3MB in the beginning and 68.6MB in the end (delta: 16.7MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2025-04-14 13:40:54,496 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:40:54,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.73ms. Allocated memory is still 125.8MB. Free memory was 85.3MB in the beginning and 62.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 13:40:54,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.81ms. Allocated memory is still 125.8MB. Free memory was 62.2MB in the beginning and 60.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:40:54,497 INFO L158 Benchmark]: Boogie Preprocessor took 18.07ms. Allocated memory is still 125.8MB. Free memory was 60.2MB in the beginning and 58.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:40:54,497 INFO L158 Benchmark]: RCFGBuilder took 314.29ms. Allocated memory is still 125.8MB. Free memory was 58.8MB in the beginning and 38.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 13:40:54,497 INFO L158 Benchmark]: TraceAbstraction took 12465.11ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 37.7MB in the beginning and 68.6MB in the end (delta: -30.8MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2025-04-14 13:40:54,498 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.18ms. Allocated memory is still 163.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 376.73ms. Allocated memory is still 125.8MB. Free memory was 85.3MB in the beginning and 62.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.81ms. Allocated memory is still 125.8MB. Free memory was 62.2MB in the beginning and 60.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.07ms. Allocated memory is still 125.8MB. Free memory was 60.2MB in the beginning and 58.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 314.29ms. Allocated memory is still 125.8MB. Free memory was 58.8MB in the beginning and 38.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12465.11ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 37.7MB in the beginning and 68.6MB in the end (delta: -30.8MB). Peak memory consumption was 29.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: 7464, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 1646, dependent conditional: 1638, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5839, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 21, dependent conditional: 13, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5839, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 21, dependent conditional: 13, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5879, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 61, dependent conditional: 53, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5879, independent: 5818, independent conditional: 0, independent unconditional: 5818, dependent: 61, dependent conditional: 40, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5879, independent: 5818, independent conditional: 0, independent unconditional: 5818, dependent: 61, dependent conditional: 40, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 351, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 351, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 123, dependent conditional: 38, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 5879, independent: 5485, independent conditional: 0, independent unconditional: 5485, dependent: 43, dependent conditional: 30, dependent unconditional: 13, unknown: 351, unknown conditional: 10, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 334, Positive conditional cache size: 1, Positive unconditional cache size: 333, Negative cache size: 18, Negative conditional cache size: 10, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5499, Maximal queried relation: 4, Independence queries for same thread: 1625, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 55, Number of trivial persistent sets: 39, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7464, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 1646, dependent conditional: 1638, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5839, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 21, dependent conditional: 13, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5839, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 21, dependent conditional: 13, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5879, independent: 5818, independent conditional: 5486, independent unconditional: 332, dependent: 61, dependent conditional: 53, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5879, independent: 5818, independent conditional: 0, independent unconditional: 5818, dependent: 61, dependent conditional: 40, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5879, independent: 5818, independent conditional: 0, independent unconditional: 5818, dependent: 61, dependent conditional: 40, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 351, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 351, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 123, dependent conditional: 38, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 5879, independent: 5485, independent conditional: 0, independent unconditional: 5485, dependent: 43, dependent conditional: 30, dependent unconditional: 13, unknown: 351, unknown conditional: 10, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 334, Positive conditional cache size: 1, Positive unconditional cache size: 333, Negative cache size: 18, Negative conditional cache size: 10, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5499, Maximal queried relation: 4, Independence queries for same thread: 1625 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = __VERIFIER_nondet_int() [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=7, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, lim=7, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=7, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, lim=8, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, lim=8, limit=8] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, lim=7, limit=7] [L760] 1 bound = limit [L761] 1 i = 0 VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=0, lim=7, limit=7] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=0, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=1, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=1, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=2, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=2, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=3, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=3, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=4, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=4, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=5, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=5, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=6, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=6, lim=8, limit=7] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=7, lim=7, limit=7] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=7, arg={0:0}, bound=7, i=7, lim=8, limit=7] [L761] COND FALSE 1 !(i < bound) [L762] CALL 1 __VERIFIER_assert(i == lim) [L753] COND FALSE 1 !(!expression) VAL [\at(expression, Pre)=1, _N=7, expression=1, limit=7] [L762] RET 1 __VERIFIER_assert(i == lim) [L763] 1 return 0; [L780] FCALL, JOIN 1 pthread_join(t1, 0) VAL [_N=7, limit=7, t1=-1, t2=0] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\at(expression, Pre)=0, _N=7, expression=0, limit=7] [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=7, expression=0, limit=7] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 47 locations, 54 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 8.0s, 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: 288, 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, 2.7s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 SizeOfPredicates, 28 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 147/371 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]: 22, ConditionCalculationTime [ms]: 3, ConditionCalculations: 1, QuantifiedConditions: 0, TraceChecks: 1, UnknownTraceChecks: 0, UnsatisfiedConditions: 1, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 13:40:54,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...