/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 12:46:18,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 12:46:18,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 12:46:18,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 12:46:18,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 12:46:19,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 12:46:19,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 12:46:19,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 12:46:19,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 12:46:19,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 12:46:19,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 12:46:19,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 12:46:19,017 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 12:46:19,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 12:46:19,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:46:19,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:46:19,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:46:19,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 12:46:19,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 12:46:19,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 12:46:19,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 12:46:19,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 12:46:19,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 12:46:19,251 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 12:46:19,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-04-14 12:46:20,457 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2ad5cfc/3230a786c4ca4b0f9c8db85caf140fee/FLAG3e91d2859 [2025-04-14 12:46:20,687 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 12:46:20,688 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-04-14 12:46:20,694 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2ad5cfc/3230a786c4ca4b0f9c8db85caf140fee/FLAG3e91d2859 [2025-04-14 12:46:21,507 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2ad5cfc/3230a786c4ca4b0f9c8db85caf140fee [2025-04-14 12:46:21,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 12:46:21,510 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 12:46:21,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 12:46:21,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 12:46:21,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 12:46:21,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695f0c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21, skipping insertion in model container [2025-04-14 12:46:21,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 12:46:21,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-04-14 12:46:21,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:46:21,670 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 12:46:21,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-04-14 12:46:21,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:46:21,701 INFO L204 MainTranslator]: Completed translation [2025-04-14 12:46:21,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21 WrapperNode [2025-04-14 12:46:21,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 12:46:21,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 12:46:21,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 12:46:21,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 12:46:21,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,730 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 128 [2025-04-14 12:46:21,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 12:46:21,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 12:46:21,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 12:46:21,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 12:46:21,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 12:46:21,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 12:46:21,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 12:46:21,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 12:46:21,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (1/1) ... [2025-04-14 12:46:21,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:46:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:21,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 12:46:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 12:46:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 12:46:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 12:46:21,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 12:46:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 12:46:21,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 12:46:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 12:46:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 12:46:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 12:46:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 12:46:21,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 12:46:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 12:46:21,800 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 12:46:21,876 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 12:46:21,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 12:46:22,080 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 12:46:22,080 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 12:46:22,223 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 12:46:22,223 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-14 12:46:22,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:46:22 BoogieIcfgContainer [2025-04-14 12:46:22,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 12:46:22,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 12:46:22,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 12:46:22,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 12:46:22,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:46:21" (1/3) ... [2025-04-14 12:46:22,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d18d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:46:22, skipping insertion in model container [2025-04-14 12:46:22,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:46:21" (2/3) ... [2025-04-14 12:46:22,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d18d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:46:22, skipping insertion in model container [2025-04-14 12:46:22,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:46:22" (3/3) ... [2025-04-14 12:46:22,232 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-04-14 12:46:22,241 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 12:46:22,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 32 locations, 34 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 12:46:22,243 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 12:46:22,282 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 12:46:22,316 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:46:22,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 12:46:22,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:22,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 12:46:22,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 12:46:22,380 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 12:46:22,393 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 12:46:22,398 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;@529f7340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:46:22,398 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 12:46:22,579 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 12:46:22,579 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:22,579 INFO L139 ounterexampleChecker]: Examining path program with hash 1882349814, occurence #1 [2025-04-14 12:46:22,579 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:46:22,579 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:22,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash -551705718, now seen corresponding path program 1 times [2025-04-14 12:46:22,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:22,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386961642] [2025-04-14 12:46:22,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:22,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 12:46:22,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 12:46:22,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:22,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:22,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386961642] [2025-04-14 12:46:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386961642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:46:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:46:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 12:46:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128627560] [2025-04-14 12:46:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:46:22,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 12:46:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:22,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 12:46:22,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 12:46:22,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,725 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:22,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:22,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 12:46:22,773 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:22,773 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:22,773 INFO L139 ounterexampleChecker]: Examining path program with hash -972018684, occurence #1 [2025-04-14 12:46:22,773 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:46:22,773 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:22,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 106151200, now seen corresponding path program 1 times [2025-04-14 12:46:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:22,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179382082] [2025-04-14 12:46:22,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:22,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 12:46:22,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 12:46:22,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:22,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:22,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179382082] [2025-04-14 12:46:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179382082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:46:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:46:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 12:46:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572834920] [2025-04-14 12:46:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:46:22,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 12:46:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:22,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 12:46:22,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 12:46:22,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,895 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:22,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:22,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:22,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:22,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 12:46:22,958 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:22,958 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:22,958 INFO L139 ounterexampleChecker]: Examining path program with hash 932887066, occurence #1 [2025-04-14 12:46:22,958 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:46:22,958 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:22,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1323861897, now seen corresponding path program 1 times [2025-04-14 12:46:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:22,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808643849] [2025-04-14 12:46:22,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:22,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 12:46:22,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 12:46:22,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:22,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:23,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808643849] [2025-04-14 12:46:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808643849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:46:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:46:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 12:46:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570148663] [2025-04-14 12:46:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:46:23,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 12:46:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:23,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 12:46:23,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 12:46:23,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,031 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:23,031 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 12:46:23,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 12:46:23,150 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:23,150 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:23,150 INFO L139 ounterexampleChecker]: Examining path program with hash 1057667021, occurence #1 [2025-04-14 12:46:23,150 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:46:23,150 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:23,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1417637232, now seen corresponding path program 1 times [2025-04-14 12:46:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:23,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24648338] [2025-04-14 12:46:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:23,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 12:46:23,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 12:46:23,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:23,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:23,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:23,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24648338] [2025-04-14 12:46:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24648338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:46:23,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:46:23,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:46:23,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5100256] [2025-04-14 12:46:23,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:46:23,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:46:23,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:23,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:46:23,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 12:46:23,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,279 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:23,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:23,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:23,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:23,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:23,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 12:46:23,358 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:23,358 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:23,358 INFO L139 ounterexampleChecker]: Examining path program with hash 1057667021, occurence #2 [2025-04-14 12:46:23,358 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:46:23,358 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:46:23,359 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:23,359 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:46:23,359 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:23,359 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 12:46:23,369 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:23,370 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 12:46:23,370 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:23,370 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-14 12:46:23,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1730565123, now seen corresponding path program 1 times [2025-04-14 12:46:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:23,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107468998] [2025-04-14 12:46:23,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:23,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 12:46:23,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 12:46:23,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:23,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:23,417 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:23,417 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:23,417 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 12:46:23,417 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:23,417 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 12:46:23,417 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:23,417 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:46:23,417 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:23,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1440056380, now seen corresponding path program 1 times [2025-04-14 12:46:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:23,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425287180] [2025-04-14 12:46:23,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 12:46:23,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 12:46:23,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:23,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:23,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425287180] [2025-04-14 12:46:23,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425287180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:46:23,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485972640] [2025-04-14 12:46:23,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:23,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:23,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:23,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:46:23,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 12:46:23,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 12:46:23,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 12:46:23,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:23,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:23,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 12:46:23,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:46:24,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 12:46:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:24,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:46:24,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-04-14 12:46:24,628 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 12:46:24,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-04-14 12:46:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485972640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:46:24,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:46:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-04-14 12:46:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996753678] [2025-04-14 12:46:24,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:46:24,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 12:46:24,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:24,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 12:46:24,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2025-04-14 12:46:24,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:24,781 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:24,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:24,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:24,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:24,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:24,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:24,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 12:46:25,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 12:46:25,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 12:46:25,547 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:25,547 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:25,547 INFO L139 ounterexampleChecker]: Examining path program with hash -1332394525, occurence #1 [2025-04-14 12:46:25,547 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:46:25,547 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:25,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1278629529, now seen corresponding path program 2 times [2025-04-14 12:46:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:25,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982710311] [2025-04-14 12:46:25,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:46:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:25,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 12:46:25,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 12:46:25,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:46:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 12:46:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:25,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982710311] [2025-04-14 12:46:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982710311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:46:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:46:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:46:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428713473] [2025-04-14 12:46:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:46:25,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:46:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:25,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:46:25,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 12:46:25,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,625 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:25,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:25,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 12:46:25,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 12:46:25,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 12:46:25,700 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:25,700 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:25,700 INFO L139 ounterexampleChecker]: Examining path program with hash 1057667021, occurence #3 [2025-04-14 12:46:25,700 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:46:25,700 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:46:25,700 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:25,700 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:46:25,700 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:25,700 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 12:46:25,700 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:25,700 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 12:46:25,700 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:25,700 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 12:46:25,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash 992657328, now seen corresponding path program 1 times [2025-04-14 12:46:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:25,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804565092] [2025-04-14 12:46:25,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:25,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 12:46:25,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 12:46:25,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:25,736 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:25,737 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:25,737 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 12:46:25,737 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:25,737 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 26 is hopeless, skipping. [2025-04-14 12:46:25,737 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 12:46:25,737 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:25,737 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 12:46:25,737 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:25,737 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:46:25,737 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:25,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 861590944, now seen corresponding path program 3 times [2025-04-14 12:46:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:25,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648870777] [2025-04-14 12:46:25,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:46:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:25,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-14 12:46:25,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 12:46:25,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 12:46:25,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 12:46:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:25,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648870777] [2025-04-14 12:46:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648870777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:46:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:46:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:46:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892777314] [2025-04-14 12:46:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:46:25,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:46:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:25,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:46:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 12:46:25,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,875 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:25,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:25,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:25,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 12:46:25,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:25,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7 [2025-04-14 12:46:25,983 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:25,983 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:25,983 INFO L139 ounterexampleChecker]: Examining path program with hash 2139375376, occurence #1 [2025-04-14 12:46:25,983 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:46:25,983 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:25,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1667070623, now seen corresponding path program 1 times [2025-04-14 12:46:25,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:25,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300489792] [2025-04-14 12:46:25,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:25,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 12:46:26,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 12:46:26,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:26,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:26,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300489792] [2025-04-14 12:46:26,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300489792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:46:26,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274605167] [2025-04-14 12:46:26,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:26,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:26,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:46:26,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 12:46:26,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 12:46:26,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 12:46:26,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:26,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:26,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 12:46:26,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:46:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:27,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:46:27,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 12:46:27,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-14 12:46:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274605167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:46:28,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:46:28,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2025-04-14 12:46:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172311743] [2025-04-14 12:46:28,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:46:28,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-14 12:46:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:28,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-14 12:46:28,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2025-04-14 12:46:28,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:28,222 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:28,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.409090909090909) internal successors, (106), 43 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:28,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:29,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 12:46:29,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 12:46:29,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:29,686 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:29,686 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:29,686 INFO L139 ounterexampleChecker]: Examining path program with hash 2139375376, occurence #2 [2025-04-14 12:46:29,686 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:46:29,686 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:46:29,686 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:29,686 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:46:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 12:46:29,687 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 12:46:29,687 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-14 12:46:29,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -486792813, now seen corresponding path program 1 times [2025-04-14 12:46:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:29,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367392298] [2025-04-14 12:46:29,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:29,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 12:46:29,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 12:46:29,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:29,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:29,715 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:29,715 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:29,715 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-14 12:46:29,715 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:29,715 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 12:46:29,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2087365379, now seen corresponding path program 1 times [2025-04-14 12:46:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:29,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229557204] [2025-04-14 12:46:29,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:29,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 12:46:29,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 12:46:29,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:29,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:29,739 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:29,739 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:29,739 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-14 12:46:29,740 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:29,740 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 36 is hopeless, skipping. [2025-04-14 12:46:29,740 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-04-14 12:46:29,740 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:29,740 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47 [2025-04-14 12:46:29,740 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:29,740 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:46:29,740 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:29,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -4065379, now seen corresponding path program 2 times [2025-04-14 12:46:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:29,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131565826] [2025-04-14 12:46:29,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:46:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:29,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-14 12:46:29,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-14 12:46:29,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:46:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:30,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131565826] [2025-04-14 12:46:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131565826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:46:30,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402063994] [2025-04-14 12:46:30,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:46:30,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:30,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:30,782 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 12:46:30,784 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 12:46:30,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-14 12:46:30,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-14 12:46:30,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:46:30,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:30,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 12:46:30,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:46:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:31,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:46:32,268 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 12:46:32,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-14 12:46:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402063994] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:46:32,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:46:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 63 [2025-04-14 12:46:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173855946] [2025-04-14 12:46:32,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:46:32,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-14 12:46:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:32,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-14 12:46:32,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=3495, Unknown=0, NotChecked=0, Total=4032 [2025-04-14 12:46:32,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:32,716 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:32,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:32,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:32,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:32,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:32,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:32,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 12:46:32,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:32,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:32,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-04-14 12:46:32,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 12:46:35,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 12:46:35,388 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 12:46:35,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:35,583 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:35,583 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:35,583 INFO L139 ounterexampleChecker]: Examining path program with hash 2139375376, occurence #3 [2025-04-14 12:46:35,583 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:46:35,583 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:46:35,583 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:35,584 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:46:35,584 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:35,584 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 12:46:35,584 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:35,584 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-14 12:46:35,584 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:35,584 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-14 12:46:35,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash 894892623, now seen corresponding path program 1 times [2025-04-14 12:46:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:35,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932281430] [2025-04-14 12:46:35,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:35,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 12:46:35,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 12:46:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:35,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:35,608 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:35,608 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:35,608 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 12:46:35,608 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:35,608 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 12:46:35,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1329954273, now seen corresponding path program 1 times [2025-04-14 12:46:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:35,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405214311] [2025-04-14 12:46:35,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:35,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 12:46:35,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 12:46:35,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:35,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:35,640 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:35,640 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:35,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 12:46:35,640 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:35,640 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 37 is hopeless, skipping. [2025-04-14 12:46:35,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 42 [2025-04-14 12:46:35,640 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:35,640 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 46 is hopeless, skipping. [2025-04-14 12:46:35,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 55 [2025-04-14 12:46:35,640 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:35,641 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 12:46:35,641 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:35,641 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:46:35,641 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:35,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1718471074, now seen corresponding path program 3 times [2025-04-14 12:46:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:35,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986859547] [2025-04-14 12:46:35,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:46:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:35,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 5 equivalence classes. [2025-04-14 12:46:35,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 60 of 60 statements. [2025-04-14 12:46:35,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-14 12:46:35,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:37,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:37,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986859547] [2025-04-14 12:46:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986859547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:46:37,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899012338] [2025-04-14 12:46:37,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:46:37,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:37,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:37,059 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 12:46:37,060 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 12:46:37,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 5 equivalence classes. [2025-04-14 12:46:37,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 60 of 60 statements. [2025-04-14 12:46:37,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-14 12:46:37,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:37,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-14 12:46:37,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:46:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:38,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:46:39,759 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 12:46:39,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 143 treesize of output 190 [2025-04-14 12:46:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899012338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:46:40,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:46:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 82 [2025-04-14 12:46:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567259468] [2025-04-14 12:46:40,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:46:40,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-04-14 12:46:40,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:46:40,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-04-14 12:46:40,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=5893, Unknown=0, NotChecked=0, Total=6806 [2025-04-14 12:46:40,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:40,490 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:46:40,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 2.0602409638554215) internal successors, (171), 82 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-04-14 12:46:40,490 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 12:46:46,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-14 12:46:46,141 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 12:46:46,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2025-04-14 12:46:46,336 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:46:46,336 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:46:46,336 INFO L139 ounterexampleChecker]: Examining path program with hash 2139375376, occurence #4 [2025-04-14 12:46:46,336 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:46:46,336 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:46:46,336 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,336 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 12:46:46,336 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,336 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 12:46:46,336 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:46,336 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 12:46:46,336 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:46,337 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-14 12:46:46,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash 777467703, now seen corresponding path program 1 times [2025-04-14 12:46:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:46,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265024990] [2025-04-14 12:46:46,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:46,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 12:46:46,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 12:46:46,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:46,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:46,362 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:46,363 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:46,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 12:46:46,363 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,363 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 12:46:46,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash -107319391, now seen corresponding path program 1 times [2025-04-14 12:46:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:46:46,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109125757] [2025-04-14 12:46:46,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:46:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:46,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 12:46:46,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 12:46:46,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:46:46,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 12:46:46,395 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 12:46:46,395 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 12:46:46,395 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 34 [2025-04-14 12:46:46,395 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,395 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 38 is hopeless, skipping. [2025-04-14 12:46:46,395 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 12:46:46,395 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,395 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 47 is hopeless, skipping. [2025-04-14 12:46:46,395 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 52 [2025-04-14 12:46:46,395 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,395 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 56 is hopeless, skipping. [2025-04-14 12:46:46,395 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-14 12:46:46,397 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:46:46,397 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 67 [2025-04-14 12:46:46,397 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:46:46,397 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:46:46,397 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:46:46,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:46:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash -927959874, now seen corresponding path program 4 times [2025-04-14 12:46:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:46:46,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619168266] [2025-04-14 12:46:46,398 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 12:46:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:46:46,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-14 12:46:46,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-14 12:46:46,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 12:46:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:46:48,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619168266] [2025-04-14 12:46:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619168266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:46:48,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173917910] [2025-04-14 12:46:48,222 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 12:46:48,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:46:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:46:48,224 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 12:46:48,225 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 12:46:48,264 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-14 12:46:48,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-14 12:46:48,287 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 12:46:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:46:48,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-14 12:46:48,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:46:50,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,192 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 12:46:50,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,194 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 12:46:50,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 12:46:50,195 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 12:46:50,199 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 12:46:50,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 37 [2025-04-14 12:46:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:46:50,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:46:54,136 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 12:46:54,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 213 treesize of output 699 [2025-04-14 12:47:00,611 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:03,172 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:04,870 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:06,077 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:06,835 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:07,546 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:09,785 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:10,061 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:10,369 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:11,607 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:13,179 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:14,442 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:14,724 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:15,015 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:16,261 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:20,411 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:23,534 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:25,246 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:26,959 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:27,096 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:27,550 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 12:47:28,922 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:29,475 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:30,008 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:30,712 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:31,810 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:35,103 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:35,269 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:35,883 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:36,250 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:36,621 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:36,837 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:37,418 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:38,027 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 12:47:39,833 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 12:47:41,592 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:47:42,204 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:47:42,414 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:48:50,596 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:48:51,729 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:48:53,810 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 12:48:54,456 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:48:55,033 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:49:24,467 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:49:54,771 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:49:54,866 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:49:55,124 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:05,512 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:05,733 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:05,808 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:50:26,661 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-14 12:50:26,939 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:50:27,057 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:27,184 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:50:29,059 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:29,416 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:29,648 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:29,869 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:30,458 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:30,822 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:31,406 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:31,689 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:31,860 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:32,037 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:32,287 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:49,929 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:50:53,504 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:51:18,307 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:51:18,516 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:51:18,627 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:51:18,909 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:52:28,172 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:53:29,295 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:53:49,026 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:53:49,266 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 12:53:49,397 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 12:53:57,158 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 12:53:57,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 12:53:57,159 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 12:53:57,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 12:53:57,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2025-04-14 12:53:57,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-14 12:53:57,366 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 70 more [2025-04-14 12:53:57,372 INFO L158 Benchmark]: Toolchain (without parser) took 455861.50ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 99.6MB in the beginning and 678.2MB in the end (delta: -578.7MB). Peak memory consumption was 482.8MB. Max. memory is 8.0GB. [2025-04-14 12:53:57,372 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:53:57,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.72ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.8MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 12:53:57,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.32ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 12:53:57,372 INFO L158 Benchmark]: Boogie Preprocessor took 22.73ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:53:57,372 INFO L158 Benchmark]: RCFGBuilder took 469.56ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 48.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 12:53:57,373 INFO L158 Benchmark]: TraceAbstraction took 455146.28ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 47.6MB in the beginning and 678.2MB in the end (delta: -630.7MB). Peak memory consumption was 432.5MB. Max. memory is 8.0GB. [2025-04-14 12:53:57,374 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.72ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.8MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.32ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.73ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 469.56ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 48.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 455146.28ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 47.6MB in the beginning and 678.2MB in the end (delta: -630.7MB). Peak memory consumption was 432.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...