/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 10:13:23,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 10:13:23,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 10:13:23,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 10:13:23,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 10:13:23,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 10:13:23,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 10:13:23,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 10:13:23,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 10:13:23,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 10:13:23,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 10:13:23,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 10:13:23,199 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 10:13:23,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 10:13:23,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 10:13:23,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 10:13:23,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 10:13:23,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 10:13:23,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 10:13:23,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 10:13:23,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 10:13:23,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 10:13:23,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 10:13:23,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 10:13:23,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 10:13:23,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 10:13:23,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 10:13:23,204 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 10:13:23,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 10:13:23,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 10:13:23,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 10:13:23,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 10:13:23,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 10:13:23,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 10:13:23,207 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 10:13:23,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 10:13:23,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 10:13:23,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 10:13:23,207 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 10:13:23,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 10:13:23,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 10:13:23,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 10:13:23,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 10:13:23,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 10:13:23,489 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 10:13:23,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_tso.i [2024-05-06 10:13:24,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 10:13:24,889 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 10:13:24,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_tso.i [2024-05-06 10:13:24,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3d8f65924/b8724b8bd62f42b7bab0503f6d2e6114/FLAGec0a4db60 [2024-05-06 10:13:24,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3d8f65924/b8724b8bd62f42b7bab0503f6d2e6114 [2024-05-06 10:13:24,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 10:13:24,920 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 10:13:24,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 10:13:24,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 10:13:24,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 10:13:24,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 10:13:24" (1/1) ... [2024-05-06 10:13:24,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0e6e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:24, skipping insertion in model container [2024-05-06 10:13:24,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 10:13:24" (1/1) ... [2024-05-06 10:13:25,004 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 10:13:25,178 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_tso.i[945,958] [2024-05-06 10:13:25,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 10:13:25,326 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 10:13:25,336 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_tso.i[945,958] [2024-05-06 10:13:25,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 10:13:25,393 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 10:13:25,394 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 10:13:25,400 INFO L206 MainTranslator]: Completed translation [2024-05-06 10:13:25,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25 WrapperNode [2024-05-06 10:13:25,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 10:13:25,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 10:13:25,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 10:13:25,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 10:13:25,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,441 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2024-05-06 10:13:25,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 10:13:25,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 10:13:25,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 10:13:25,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 10:13:25,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 10:13:25,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 10:13:25,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 10:13:25,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 10:13:25,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (1/1) ... [2024-05-06 10:13:25,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 10:13:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 10:13:25,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 10:13:25,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 10:13:25,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 10:13:25,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 10:13:25,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 10:13:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 10:13:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 10:13:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 10:13:25,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 10:13:25,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 10:13:25,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 10:13:25,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 10:13:25,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 10:13:25,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 10:13:25,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 10:13:25,589 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 10:13:25,741 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 10:13:25,749 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 10:13:25,909 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 10:13:25,926 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 10:13:25,926 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 10:13:25,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 10:13:25 BoogieIcfgContainer [2024-05-06 10:13:25,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 10:13:25,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 10:13:25,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 10:13:25,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 10:13:25,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 10:13:24" (1/3) ... [2024-05-06 10:13:25,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bde2abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 10:13:25, skipping insertion in model container [2024-05-06 10:13:25,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:13:25" (2/3) ... [2024-05-06 10:13:25,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bde2abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 10:13:25, skipping insertion in model container [2024-05-06 10:13:25,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 10:13:25" (3/3) ... [2024-05-06 10:13:25,940 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_tso.i [2024-05-06 10:13:25,948 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 10:13:25,959 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 10:13:25,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 10:13:25,960 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 10:13:26,012 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 10:13:26,043 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 10:13:26,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 10:13:26,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 10:13:26,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 10:13:26,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 10:13:26,085 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 10:13:26,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 10:13:26,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 10:13:26,103 INFO L357 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, mHoare=true, 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;@6d3290a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 10:13:26,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-06 10:13:26,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 10:13:26,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 10:13:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1330792377, now seen corresponding path program 1 times [2024-05-06 10:13:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 10:13:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017623834] [2024-05-06 10:13:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:26,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 10:13:26,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017623834] [2024-05-06 10:13:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017623834] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 10:13:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 10:13:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 10:13:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285456359] [2024-05-06 10:13:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 10:13:26,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 10:13:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 10:13:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 10:13:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 10:13:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:26,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 10:13:26,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2024-05-06 10:13:26,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:26,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 10:13:26,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 10:13:26,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 10:13:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -590883342, now seen corresponding path program 1 times [2024-05-06 10:13:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 10:13:26,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132733000] [2024-05-06 10:13:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 10:13:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132733000] [2024-05-06 10:13:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132733000] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 10:13:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 10:13:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 10:13:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901358489] [2024-05-06 10:13:26,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 10:13:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 10:13:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 10:13:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 10:13:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 10:13:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:26,983 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 10:13:26,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 10:13:26,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:26,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1817941475, now seen corresponding path program 1 times [2024-05-06 10:13:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:27,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2061708946, now seen corresponding path program 1 times [2024-05-06 10:13:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:27,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash 612716834, now seen corresponding path program 1 times [2024-05-06 10:13:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:27,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash -377514485, now seen corresponding path program 1 times [2024-05-06 10:13:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:28,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:28,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 10:13:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-06 10:13:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1817941475, now seen corresponding path program 2 times [2024-05-06 10:13:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2061708946, now seen corresponding path program 2 times [2024-05-06 10:13:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash 612716834, now seen corresponding path program 2 times [2024-05-06 10:13:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1036362280, now seen corresponding path program 1 times [2024-05-06 10:13:28,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:28,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:28,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash -285234503, now seen corresponding path program 1 times [2024-05-06 10:13:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 10:13:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-06 10:13:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1817941475, now seen corresponding path program 3 times [2024-05-06 10:13:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2061708946, now seen corresponding path program 3 times [2024-05-06 10:13:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash 612716834, now seen corresponding path program 3 times [2024-05-06 10:13:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1036362280, now seen corresponding path program 2 times [2024-05-06 10:13:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:29,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1834546349, now seen corresponding path program 1 times [2024-05-06 10:13:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash 495010480, now seen corresponding path program 1 times [2024-05-06 10:13:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1124346763, now seen corresponding path program 1 times [2024-05-06 10:13:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -379372684, now seen corresponding path program 1 times [2024-05-06 10:13:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1650330162, now seen corresponding path program 1 times [2024-05-06 10:13:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1886426133, now seen corresponding path program 1 times [2024-05-06 10:13:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2017357572, now seen corresponding path program 1 times [2024-05-06 10:13:30,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:30,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:30,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1711147587, now seen corresponding path program 4 times [2024-05-06 10:13:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:31,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 10:13:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 10:13:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 10:13:31,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 10:13:31,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 10:13:31,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 10:13:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 898732436, now seen corresponding path program 1 times [2024-05-06 10:13:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 10:13:31,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545402097] [2024-05-06 10:13:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 10:13:31,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 10:13:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 10:13:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 10:13:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 10:13:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545402097] [2024-05-06 10:13:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545402097] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 10:13:31,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 10:13:31,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 10:13:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376440722] [2024-05-06 10:13:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 10:13:31,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 10:13:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 10:13:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 10:13:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 10:13:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:31,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 10:13:31,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 10:13:31,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:31,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-06 10:13:31,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 10:13:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 10:13:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 10:13:31,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-06 10:13:31,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-06 10:13:31,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-06 10:13:31,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-06 10:13:31,592 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 10:13:31,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 10:13:31,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 10:13:31,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 10:13:31 BasicIcfg [2024-05-06 10:13:31,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 10:13:31,599 INFO L158 Benchmark]: Toolchain (without parser) took 6678.63ms. Allocated memory was 175.1MB in the beginning and 338.7MB in the end (delta: 163.6MB). Free memory was 101.1MB in the beginning and 159.4MB in the end (delta: -58.3MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. [2024-05-06 10:13:31,599 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 10:13:31,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.35ms. Allocated memory was 175.1MB in the beginning and 282.1MB in the end (delta: 107.0MB). Free memory was 100.8MB in the beginning and 237.6MB in the end (delta: -136.7MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2024-05-06 10:13:31,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.97ms. Allocated memory is still 282.1MB. Free memory was 237.6MB in the beginning and 235.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 10:13:31,600 INFO L158 Benchmark]: Boogie Preprocessor took 24.27ms. Allocated memory is still 282.1MB. Free memory was 235.5MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 10:13:31,600 INFO L158 Benchmark]: RCFGBuilder took 461.31ms. Allocated memory is still 282.1MB. Free memory was 234.0MB in the beginning and 220.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-06 10:13:31,601 INFO L158 Benchmark]: TraceAbstraction took 5667.01ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 219.8MB in the beginning and 159.4MB in the end (delta: 60.4MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. [2024-05-06 10:13:31,602 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.11ms. Allocated memory is still 175.1MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.35ms. Allocated memory was 175.1MB in the beginning and 282.1MB in the end (delta: 107.0MB). Free memory was 100.8MB in the beginning and 237.6MB in the end (delta: -136.7MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.97ms. Allocated memory is still 282.1MB. Free memory was 237.6MB in the beginning and 235.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.27ms. Allocated memory is still 282.1MB. Free memory was 235.5MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 461.31ms. Allocated memory is still 282.1MB. Free memory was 234.0MB in the beginning and 220.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5667.01ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 219.8MB in the beginning and 159.4MB in the end (delta: 60.4MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12246, independent: 12108, independent conditional: 12003, independent unconditional: 105, dependent: 138, dependent conditional: 138, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12210, independent: 12108, independent conditional: 12003, independent unconditional: 105, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12210, independent: 12108, independent conditional: 12003, independent unconditional: 105, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12210, independent: 12108, independent conditional: 12003, independent unconditional: 105, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12485, independent: 12108, independent conditional: 5662, independent unconditional: 6446, dependent: 377, dependent conditional: 254, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12485, independent: 12108, independent conditional: 1636, independent unconditional: 10472, dependent: 377, dependent conditional: 42, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12485, independent: 12108, independent conditional: 1636, independent unconditional: 10472, dependent: 377, dependent conditional: 42, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 548, independent: 539, independent conditional: 78, independent unconditional: 461, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 548, independent: 528, independent conditional: 0, independent unconditional: 528, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 25, independent conditional: 24, independent unconditional: 2, dependent: 47, dependent conditional: 2, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12485, independent: 11569, independent conditional: 1558, independent unconditional: 10011, dependent: 368, dependent conditional: 40, dependent unconditional: 328, unknown: 548, unknown conditional: 80, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 539, Positive conditional cache size: 78, Positive unconditional cache size: 461, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4238, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12485, independent: 12108, independent conditional: 5662, independent unconditional: 6446, dependent: 377, dependent conditional: 254, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12485, independent: 12108, independent conditional: 1636, independent unconditional: 10472, dependent: 377, dependent conditional: 42, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12485, independent: 12108, independent conditional: 1636, independent unconditional: 10472, dependent: 377, dependent conditional: 42, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 548, independent: 539, independent conditional: 78, independent unconditional: 461, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 548, independent: 528, independent conditional: 0, independent unconditional: 528, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 25, independent conditional: 24, independent unconditional: 2, dependent: 47, dependent conditional: 2, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12485, independent: 11569, independent conditional: 1558, independent unconditional: 10011, dependent: 368, dependent conditional: 40, dependent unconditional: 328, unknown: 548, unknown conditional: 80, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 539, Positive conditional cache size: 78, Positive unconditional cache size: 461, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4238 ], Independence queries for same thread: 36 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 4.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 3.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 31, ConditionalCommutativityTraceChecks: 21, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 10:13:31,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 10:13:31,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...