/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/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 10:36:56,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 10:36:57,011 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 10:36:57,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 10:36:57,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 10:36:57,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 10:36:57,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 10:36:57,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 10:36:57,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 10:36:57,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 10:36:57,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 10:36:57,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 10:36:57,048 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 10:36:57,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 10:36:57,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 10:36:57,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:36:57,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:57,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:57,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 10:36:57,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 10:36:57,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 10:36:57,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 10:36:57,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 10:36:57,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 10:36:57,283 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 10:36:57,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2025-04-14 10:36:58,565 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42d8768d/b41a0bf35138407c87dc328d4f88d494/FLAG92ab49367 [2025-04-14 10:36:58,800 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 10:36:58,800 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2025-04-14 10:36:58,815 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42d8768d/b41a0bf35138407c87dc328d4f88d494/FLAG92ab49367 [2025-04-14 10:36:59,567 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42d8768d/b41a0bf35138407c87dc328d4f88d494 [2025-04-14 10:36:59,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 10:36:59,570 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 10:36:59,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 10:36:59,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 10:36:59,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 10:36:59,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:59" (1/1) ... [2025-04-14 10:36:59,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f862a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:59, skipping insertion in model container [2025-04-14 10:36:59,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:59" (1/1) ... [2025-04-14 10:36:59,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 10:37:00,004 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/queue_ok_longest.i[43280,43293] [2025-04-14 10:37:00,012 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/queue_ok_longest.i[43553,43566] [2025-04-14 10:37:00,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:37:00,073 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 10:37:00,121 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/queue_ok_longest.i[43280,43293] [2025-04-14 10:37:00,122 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/queue_ok_longest.i[43553,43566] [2025-04-14 10:37:00,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:37:00,215 INFO L204 MainTranslator]: Completed translation [2025-04-14 10:37:00,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00 WrapperNode [2025-04-14 10:37:00,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 10:37:00,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 10:37:00,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 10:37:00,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 10:37:00,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,344 INFO L138 Inliner]: procedures = 274, calls = 1652, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 1791 [2025-04-14 10:37:00,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 10:37:00,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 10:37:00,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 10:37:00,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 10:37:00,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 10:37:00,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 10:37:00,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 10:37:00,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 10:37:00,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (1/1) ... [2025-04-14 10:37:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:37:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:00,507 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 10:37:00,509 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 10:37:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 10:37:00,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 10:37:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 10:37:00,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 10:37:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 10:37:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 10:37:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 10:37:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 10:37:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 10:37:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 10:37:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 10:37:00,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 10:37:00,529 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 10:37:00,634 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 10:37:00,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 10:37:02,086 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 10:37:02,086 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 10:37:23,013 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 10:37:23,013 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 10:37:23,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:37:23 BoogieIcfgContainer [2025-04-14 10:37:23,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 10:37:23,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 10:37:23,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 10:37:23,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 10:37:23,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:36:59" (1/3) ... [2025-04-14 10:37:23,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea2782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:37:23, skipping insertion in model container [2025-04-14 10:37:23,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:37:00" (2/3) ... [2025-04-14 10:37:23,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea2782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:37:23, skipping insertion in model container [2025-04-14 10:37:23,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:37:23" (3/3) ... [2025-04-14 10:37:23,021 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2025-04-14 10:37:23,032 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 10:37:23,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longest.i that has 3 procedures, 34 locations, 38 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 10:37:23,034 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 10:37:23,339 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 10:37:23,371 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:37:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 10:37:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:23,374 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 10:37:23,376 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 10:37:23,447 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:37:23,462 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 10:37:23,468 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;@7fee5c08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:37:23,468 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 10:37:23,480 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:37:23,481 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:23,481 INFO L139 ounterexampleChecker]: Examining path program with hash 1821233462, occurence #1 [2025-04-14 10:37:23,481 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:37:23,481 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:23,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 3693729, now seen corresponding path program 1 times [2025-04-14 10:37:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:23,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308808566] [2025-04-14 10:37:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:37:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:23,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-14 10:37:23,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-14 10:37:23,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:37:23,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:23,985 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 10:37:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:23,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308808566] [2025-04-14 10:37:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308808566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:37:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:37:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 10:37:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104989576] [2025-04-14 10:37:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:37:23,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 10:37:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:24,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 10:37:24,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 10:37:24,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:24,006 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:24,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 10:37:24,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:24,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:24,296 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 10:37:24,297 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 10:37:24,297 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 10:37:24,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 10:37:24,303 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 10:37:24,305 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2025-04-14 10:37:24,308 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:37:24,309 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:37:24,309 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2025-04-14 10:37:24,309 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;@7fee5c08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:37:24,312 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 10:37:24,329 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:24,330 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:24,330 INFO L139 ounterexampleChecker]: Examining path program with hash 823111694, occurence #1 [2025-04-14 10:37:24,330 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:37:24,330 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:24,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -259936087, now seen corresponding path program 1 times [2025-04-14 10:37:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:24,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948335369] [2025-04-14 10:37:24,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:37:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:24,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 10:37:24,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 10:37:24,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:37:24,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:24,544 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 10:37:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:24,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948335369] [2025-04-14 10:37:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948335369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:37:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:37:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 10:37:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889461695] [2025-04-14 10:37:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:37:24,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 10:37:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:24,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 10:37:24,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 10:37:24,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:24,546 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:24,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:37:24,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:24,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:24,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 10:37:24,745 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:24,745 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:24,745 INFO L139 ounterexampleChecker]: Examining path program with hash 977379421, occurence #1 [2025-04-14 10:37:24,745 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:37:24,745 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:24,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash -499745150, now seen corresponding path program 1 times [2025-04-14 10:37:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:24,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574476655] [2025-04-14 10:37:24,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:37:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:24,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 10:37:24,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 10:37:24,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:37:24,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:25,342 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 10:37:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:25,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574476655] [2025-04-14 10:37:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574476655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:37:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:37:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 10:37:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065814865] [2025-04-14 10:37:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:37:25,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:37:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:25,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:37:25,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:37:25,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:25,343 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:25,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 10:37:25,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:25,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:25,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:25,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:25,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 10:37:25,836 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:25,836 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:25,836 INFO L139 ounterexampleChecker]: Examining path program with hash 884934087, occurence #1 [2025-04-14 10:37:25,836 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:37:25,836 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:25,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 868846480, now seen corresponding path program 1 times [2025-04-14 10:37:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:25,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468285142] [2025-04-14 10:37:25,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:37:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:25,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 10:37:25,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 10:37:25,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:37:25,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:26,289 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 10:37:26,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:26,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468285142] [2025-04-14 10:37:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468285142] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:37:26,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:37:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 10:37:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538436305] [2025-04-14 10:37:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:37:26,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:37:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:26,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:37:26,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:37:26,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:26,291 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:26,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:37:26,291 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:26,291 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:26,291 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:26,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:26,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:26,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:26,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 10:37:26,847 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:26,847 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:26,847 INFO L139 ounterexampleChecker]: Examining path program with hash -798365941, occurence #1 [2025-04-14 10:37:26,847 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:37:26,847 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:26,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 301199368, now seen corresponding path program 2 times [2025-04-14 10:37:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:26,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632927605] [2025-04-14 10:37:26,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:37:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:26,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-14 10:37:26,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 10:37:26,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 10:37:26,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:27,102 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 10:37:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:27,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632927605] [2025-04-14 10:37:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632927605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:37:27,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:37:27,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 10:37:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858829786] [2025-04-14 10:37:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:37:27,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:37:27,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:27,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:37:27,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:37:27,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:27,104 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:27,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:37:27,105 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:27,105 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:27,105 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:27,105 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:27,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:27,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:27,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:27,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:27,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 10:37:27,618 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:27,618 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:27,618 INFO L139 ounterexampleChecker]: Examining path program with hash -798365941, occurence #2 [2025-04-14 10:37:27,618 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:37:27,618 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:37:27,619 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:27,619 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 10:37:27,619 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:27,619 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 10:37:27,629 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:27,630 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 10:37:27,630 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:27,630 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 10:37:27,630 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:27,630 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-14 10:37:27,630 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:27,630 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 10:37:27,647 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:27,647 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:37:27,647 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:27,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2062964428, now seen corresponding path program 1 times [2025-04-14 10:37:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:27,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464919061] [2025-04-14 10:37:27,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:37:27,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 10:37:27,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 10:37:27,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:37:27,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:27,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464919061] [2025-04-14 10:37:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464919061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:37:27,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639605530] [2025-04-14 10:37:27,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:37:27,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:27,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:27,933 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 10:37:27,935 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 10:37:28,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 10:37:28,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 10:37:28,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:37:28,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:28,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 3412 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 10:37:28,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:37:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:28,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:37:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639605530] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:37:28,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:37:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 10:37:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722181449] [2025-04-14 10:37:28,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:37:28,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:37:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:28,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:37:28,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:37:28,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:28,419 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:28,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 10:37:28,419 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:28,419 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:28,419 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:28,419 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:28,419 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:29,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:29,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:29,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:29,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:29,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:29,238 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 10:37:29,429 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,SelfDestructingSolverStorable5 [2025-04-14 10:37:29,429 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:29,429 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:29,429 INFO L139 ounterexampleChecker]: Examining path program with hash -798365941, occurence #3 [2025-04-14 10:37:29,429 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:37:29,429 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:37:29,429 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:29,429 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 10:37:29,429 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:29,429 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 10:37:29,429 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:29,430 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 10:37:29,430 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:29,430 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 10:37:29,430 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:29,430 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-14 10:37:29,430 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:29,430 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 10:37:29,438 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:29,438 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:37:29,438 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:29,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash 103734024, now seen corresponding path program 2 times [2025-04-14 10:37:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:29,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97173455] [2025-04-14 10:37:29,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:37:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:29,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 10:37:29,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 10:37:29,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:37:29,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:29,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97173455] [2025-04-14 10:37:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97173455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:37:29,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649080051] [2025-04-14 10:37:29,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:37:29,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:29,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:29,824 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 10:37:29,825 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 10:37:29,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 10:37:30,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 10:37:30,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:37:30,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:30,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 3484 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 10:37:30,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:37:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:30,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:37:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649080051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:37:30,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:37:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-14 10:37:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536414337] [2025-04-14 10:37:30,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:37:30,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 10:37:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 10:37:30,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 10:37:30,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:30,730 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:30,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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 10:37:30,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:30,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:30,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:30,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:30,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:30,730 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:31,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:31,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:31,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:31,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:31,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:31,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:37:31,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 10:37:31,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:31,920 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:31,920 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:31,920 INFO L139 ounterexampleChecker]: Examining path program with hash -798365941, occurence #4 [2025-04-14 10:37:31,920 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:37:31,920 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:37:31,920 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:31,920 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 10:37:31,920 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:31,921 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 10:37:31,921 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:31,921 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 10:37:31,921 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:31,921 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-14 10:37:31,921 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:31,921 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 10:37:31,921 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:31,921 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-14 10:37:31,929 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:31,930 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:37:31,930 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:31,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -17437816, now seen corresponding path program 3 times [2025-04-14 10:37:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:31,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433164532] [2025-04-14 10:37:31,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:37:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:31,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-04-14 10:37:33,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 10:37:33,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 10:37:33,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:33,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433164532] [2025-04-14 10:37:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433164532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:37:33,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604932420] [2025-04-14 10:37:33,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:37:33,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:33,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:33,628 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 10:37:33,630 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 10:37:33,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-04-14 10:37:46,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 10:37:46,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 10:37:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:46,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 3628 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 10:37:46,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:37:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:46,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:37:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604932420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:37:46,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:37:46,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-14 10:37:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173416956] [2025-04-14 10:37:46,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:37:46,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 10:37:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:46,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 10:37:46,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-14 10:37:46,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:46,612 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:46,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:37:46,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:37:47,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:37:47,996 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 10:37:48,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:48,153 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:48,153 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:48,153 INFO L139 ounterexampleChecker]: Examining path program with hash -798365941, occurence #5 [2025-04-14 10:37:48,153 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:37:48,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:37:48,153 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:48,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 10:37:48,153 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:48,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 10:37:48,154 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:48,154 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 10:37:48,154 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:48,154 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 10:37:48,154 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:48,154 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 34 [2025-04-14 10:37:48,154 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:48,154 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 10:37:48,166 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:48,166 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:37:48,166 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:48,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1434512520, now seen corresponding path program 4 times [2025-04-14 10:37:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:48,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334579556] [2025-04-14 10:37:48,166 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 10:37:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:48,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 10:37:48,255 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 10:37:48,255 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 10:37:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:49,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334579556] [2025-04-14 10:37:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334579556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:37:49,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185577180] [2025-04-14 10:37:49,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 10:37:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:49,185 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 10:37:49,187 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 10:37:49,327 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 10:37:49,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 10:37:49,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 10:37:49,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:49,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 3916 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 10:37:49,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:37:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:49,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:37:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185577180] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:37:50,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:37:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-04-14 10:37:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207762133] [2025-04-14 10:37:50,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:37:50,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-14 10:37:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:37:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-14 10:37:50,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-14 10:37:50,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:50,220 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:37:50,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 49 states have internal predecessors, (79), 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 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:37:50,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:37:51,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-14 10:37:51,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 10:37:51,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:51,264 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:37:51,264 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:37:51,264 INFO L139 ounterexampleChecker]: Examining path program with hash -798365941, occurence #6 [2025-04-14 10:37:51,264 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:37:51,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:37:51,264 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:51,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 10:37:51,264 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:51,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 10:37:51,264 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:51,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 10:37:51,264 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:37:51,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 10:37:51,264 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:51,264 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 58 [2025-04-14 10:37:51,265 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:51,265 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 59 [2025-04-14 10:37:51,272 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:37:51,272 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:37:51,272 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:37:51,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:37:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 208301704, now seen corresponding path program 5 times [2025-04-14 10:37:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:37:51,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450752301] [2025-04-14 10:37:51,273 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 10:37:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:37:51,358 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 24 equivalence classes. [2025-04-14 10:37:54,968 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 69 of 69 statements. [2025-04-14 10:37:54,969 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-14 10:37:54,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:37:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:37:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:37:57,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450752301] [2025-04-14 10:37:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450752301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:37:57,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783617726] [2025-04-14 10:37:57,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 10:37:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:37:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:37:57,171 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 10:37:57,172 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 10:37:57,391 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 24 equivalence classes. Received shutdown request... [2025-04-14 10:51:29,884 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 10:51:29,884 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 10:51:29,884 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 10:51:30,895 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 [2025-04-14 10:51:30,896 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 10:51:31,084 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2025-04-14 10:51:31,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 137 [2025-04-14 10:51:31,159 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 10:51:31,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-14 10:51:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2025-04-14 10:51:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242121580] [2025-04-14 10:51:31,159 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-14 10:51:31,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-14 10:51:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:31,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-14 10:51:31,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-14 10:51:31,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:31,162 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:31,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 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 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2025-04-14 10:51:31,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:31,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 10:51:31,163 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 10:51:31,163 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 10:51:31,164 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2025-04-14 10:51:31,164 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was TIMEOUT (2/2) [2025-04-14 10:51:31,165 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 10:51:31,165 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 10:51:31,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:51:31 BasicIcfg [2025-04-14 10:51:31,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 10:51:31,169 INFO L158 Benchmark]: Toolchain (without parser) took 871598.58ms. Allocated memory was 142.6MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 100.9MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-14 10:51:31,169 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:51:31,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.57ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 51.3MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-14 10:51:31,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.14ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 35.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 10:51:31,170 INFO L158 Benchmark]: Boogie Preprocessor took 130.58ms. Allocated memory is still 142.6MB. Free memory was 35.7MB in the beginning and 90.1MB in the end (delta: -54.3MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2025-04-14 10:51:31,170 INFO L158 Benchmark]: RCFGBuilder took 22537.86ms. Allocated memory was 142.6MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 90.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-04-14 10:51:31,170 INFO L158 Benchmark]: TraceAbstraction took 848153.24ms. Allocated memory was 5.2GB in the beginning and 5.9GB in the end (delta: 692.1MB). Free memory was 1.6GB in the beginning and 4.3GB in the end (delta: -2.6GB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:51:31,171 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.17ms. Allocated memory is still 142.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 645.57ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 51.3MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 127.14ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 35.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 130.58ms. Allocated memory is still 142.6MB. Free memory was 35.7MB in the beginning and 90.1MB in the end (delta: -54.3MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * RCFGBuilder took 22537.86ms. Allocated memory was 142.6MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 90.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * TraceAbstraction took 848153.24ms. Allocated memory was 5.2GB in the beginning and 5.9GB in the end (delta: 692.1MB). Free memory was 1.6GB in the beginning and 4.3GB in the end (delta: -2.6GB). There was no memory consumed. 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: 235, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 218, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 218, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 229, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 218, unknown conditional: 0, unknown unconditional: 218] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0, Independence queries for same thread: 6, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 21, Number of trivial persistent sets: 19, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 235, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 11, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 218, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 218, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 229, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 218, unknown conditional: 0, unknown unconditional: 218] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0, Independence queries for same thread: 6 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 802, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 210, dependent conditional: 200, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 616, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 24, dependent conditional: 14, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 616, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 24, dependent conditional: 14, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 630, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 38, dependent conditional: 28, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 630, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 38, dependent conditional: 11, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 630, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 38, dependent conditional: 11, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 152, dependent conditional: 11, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 5, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 630, independent: 477, independent conditional: 0, independent unconditional: 477, dependent: 32, dependent conditional: 10, dependent unconditional: 22, unknown: 121, unknown conditional: 1, unknown unconditional: 120] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 327, Positive conditional cache size: 0, Positive unconditional cache size: 327, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 300, Maximal queried relation: 1, Independence queries for same thread: 186, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 39, Number of trivial persistent sets: 28, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 802, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 210, dependent conditional: 200, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 616, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 24, dependent conditional: 14, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 616, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 24, dependent conditional: 14, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 630, independent: 592, independent conditional: 283, independent unconditional: 309, dependent: 38, dependent conditional: 28, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 630, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 38, dependent conditional: 11, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 630, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 38, dependent conditional: 11, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 152, dependent conditional: 11, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 5, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 630, independent: 477, independent conditional: 0, independent unconditional: 477, dependent: 32, dependent conditional: 10, dependent unconditional: 22, unknown: 121, unknown conditional: 1, unknown unconditional: 120] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 327, Positive conditional cache size: 0, Positive unconditional cache size: 327, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 300, Maximal queried relation: 1, Independence queries for same thread: 186 - PositiveResult [Line: 1049]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 57 locations, 69 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, 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: 2, 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, 0.2s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 2 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 57 locations, 69 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 846.9s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 5.8s, 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: 103, 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.2s SsaConstructionTime, 19.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 1034 SizeOfPredicates, 1 NumberOfNonLiveVariables, 14440 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 0/2038 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]: 63, ConditionCalculationTime [ms]: 52, ConditionCalculations: 25, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown