/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 BOTH --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/mix018_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 15:15:33,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 15:15:33,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 15:15:33,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 15:15:33,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 15:15:33,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 15:15:33,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 15:15:33,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 15:15:33,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 15:15:33,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 15:15:33,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 15:15:33,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 15:15:33,301 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 15:15:33,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 15:15:33,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 15:15:33,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 15:15:33,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 15:15:33,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 15:15:33,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 15:15:33,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 15:15:33,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 15:15:33,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 15:15:33,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 15:15:33,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 15:15:33,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 15:15:33,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 15:15:33,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 15:15:33,305 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 15:15:33,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 15:15:33,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 15:15:33,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 15:15:33,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 15:15:33,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 15:15:33,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 15:15:33,307 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 15:15:33,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 15:15:33,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 15:15:33,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 15:15:33,307 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 15:15:33,307 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 -> BOTH 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-04-04 15:15:33,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 15:15:33,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 15:15:33,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 15:15:33,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 15:15:33,560 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 15:15:33,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2024-04-04 15:15:34,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 15:15:34,820 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 15:15:34,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2024-04-04 15:15:34,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2edef2f6f/815b94cb557d4f1aa361aa97b709b138/FLAG7e93bce78 [2024-04-04 15:15:34,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2edef2f6f/815b94cb557d4f1aa361aa97b709b138 [2024-04-04 15:15:34,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 15:15:34,842 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 15:15:34,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 15:15:34,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 15:15:34,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 15:15:34,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 03:15:34" (1/1) ... [2024-04-04 15:15:34,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617b1206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:34, skipping insertion in model container [2024-04-04 15:15:34,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 03:15:34" (1/1) ... [2024-04-04 15:15:34,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 15:15:35,004 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-04-04 15:15:35,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 15:15:35,192 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 15:15:35,202 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-04-04 15:15:35,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 15:15:35,276 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 15:15:35,276 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 15:15:35,281 INFO L206 MainTranslator]: Completed translation [2024-04-04 15:15:35,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35 WrapperNode [2024-04-04 15:15:35,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 15:15:35,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 15:15:35,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 15:15:35,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 15:15:35,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,353 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-04-04 15:15:35,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 15:15:35,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 15:15:35,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 15:15:35,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 15:15:35,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 15:15:35,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 15:15:35,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 15:15:35,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 15:15:35,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (1/1) ... [2024-04-04 15:15:35,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 15:15:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 15:15:35,440 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-04-04 15:15:35,445 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-04-04 15:15:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 15:15:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-04 15:15:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 15:15:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 15:15:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 15:15:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-04-04 15:15:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-04-04 15:15:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-04-04 15:15:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-04-04 15:15:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-04-04 15:15:35,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-04-04 15:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-04-04 15:15:35,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-04-04 15:15:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 15:15:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-04 15:15:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 15:15:35,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 15:15:35,512 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 15:15:35,673 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 15:15:35,676 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 15:15:35,971 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 15:15:36,060 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 15:15:36,060 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-04 15:15:36,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 03:15:36 BoogieIcfgContainer [2024-04-04 15:15:36,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 15:15:36,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 15:15:36,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 15:15:36,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 15:15:36,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 03:15:34" (1/3) ... [2024-04-04 15:15:36,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa512be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 03:15:36, skipping insertion in model container [2024-04-04 15:15:36,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 03:15:35" (2/3) ... [2024-04-04 15:15:36,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa512be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 03:15:36, skipping insertion in model container [2024-04-04 15:15:36,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 03:15:36" (3/3) ... [2024-04-04 15:15:36,072 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2024-04-04 15:15:36,079 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 15:15:36,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 15:15:36,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-04 15:15:36,086 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 15:15:36,142 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 15:15:36,178 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 15:15:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 15:15:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 15:15:36,198 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-04-04 15:15:36,199 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-04-04 15:15:36,238 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 15:15:36,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:15:36,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 15:15:36,256 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;@5afe6dc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 15:15:36,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-04 15:15:36,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 15:15:36,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:15:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1334281014, now seen corresponding path program 1 times [2024-04-04 15:15:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 15:15:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312806452] [2024-04-04 15:15:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 15:15:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312806452] [2024-04-04 15:15:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312806452] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 15:15:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 15:15:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 15:15:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209234214] [2024-04-04 15:15:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 15:15:36,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 15:15:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 15:15:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 15:15:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 15:15:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:36,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 15:15:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-04-04 15:15:36,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:36,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 15:15:36,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 15:15:36,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:15:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash 650970364, now seen corresponding path program 1 times [2024-04-04 15:15:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 15:15:36,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997825535] [2024-04-04 15:15:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:38,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 15:15:38,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997825535] [2024-04-04 15:15:38,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997825535] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 15:15:38,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 15:15:38,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 15:15:38,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020061958] [2024-04-04 15:15:38,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 15:15:38,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-04 15:15:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 15:15:38,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-04 15:15:38,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-04-04 15:15:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,117 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 15:15:38,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 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-04-04 15:15:38,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:38,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 15:15:38,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 15:15:38,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:15:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1461002241, now seen corresponding path program 1 times [2024-04-04 15:15:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 15:15:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500472634] [2024-04-04 15:15:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 15:15:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500472634] [2024-04-04 15:15:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500472634] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 15:15:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 15:15:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-04 15:15:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234799540] [2024-04-04 15:15:38,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 15:15:38,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-04 15:15:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 15:15:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-04 15:15:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-04-04 15:15:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,520 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 15:15:38,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-04-04 15:15:38,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:38,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 15:15:38,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 15:15:38,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 15:15:38,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:15:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 943359627, now seen corresponding path program 1 times [2024-04-04 15:15:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 15:15:38,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636934666] [2024-04-04 15:15:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:38,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 15:15:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636934666] [2024-04-04 15:15:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636934666] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 15:15:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 15:15:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-04 15:15:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153537559] [2024-04-04 15:15:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 15:15:39,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-04 15:15:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 15:15:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1726344257, now seen corresponding path program 1 times [2024-04-04 15:15:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:15:39,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 15:15:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:15:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-04 15:15:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-04-04 15:15:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:39,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 15:15:39,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-04-04 15:15:39,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:39,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:39,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 15:15:39,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-04 15:15:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:39,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3 [2024-04-04 15:15:39,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 15:15:39,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:15:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -957094229, now seen corresponding path program 2 times [2024-04-04 15:15:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 15:15:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469040077] [2024-04-04 15:15:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 15:15:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469040077] [2024-04-04 15:15:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469040077] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 15:15:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 15:15:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 15:15:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314114658] [2024-04-04 15:15:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 15:15:40,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 15:15:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 15:15:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash -449326583, now seen corresponding path program 1 times [2024-04-04 15:15:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1988863178, now seen corresponding path program 1 times [2024-04-04 15:15:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:48,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:15:48,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 15:15:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:15:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1525216768, now seen corresponding path program 1 times [2024-04-04 15:15:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:15:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:15:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-04-04 15:15:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-04-04 15:15:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:48,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 15:15:48,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 21.416666666666668) internal successors, (257), 14 states have internal predecessors, (257), 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-04-04 15:15:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-04 15:15:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:15:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:15:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash -503191231, now seen corresponding path program 1 times [2024-04-04 15:15:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:15:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:15:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:15:56,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 15:15:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:16:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -244508374, now seen corresponding path program 1 times [2024-04-04 15:16:02,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:02,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-04 15:16:02,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-04-04 15:16:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1058644095, now seen corresponding path program 1 times [2024-04-04 15:16:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:10,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 15:16:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-04-04 15:16:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:16:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:16:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-04 15:16:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:16:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-04-04 15:16:13,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-04-04 15:16:13,031 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 15:16:13,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 15:16:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash -315879509, now seen corresponding path program 3 times [2024-04-04 15:16:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 15:16:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884660263] [2024-04-04 15:16:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:13,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 15:16:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884660263] [2024-04-04 15:16:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884660263] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 15:16:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 15:16:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-04 15:16:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664117685] [2024-04-04 15:16:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 15:16:13,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-04 15:16:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 15:16:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash -97506666, now seen corresponding path program 1 times [2024-04-04 15:16:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1671962418, now seen corresponding path program 1 times [2024-04-04 15:16:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -696372469, now seen corresponding path program 1 times [2024-04-04 15:16:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 15:16:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 15:16:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1466686410, now seen corresponding path program 2 times [2024-04-04 15:16:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 15:16:32,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 15:16:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:16:32,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 15:16:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 15:16:32,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-04-04 15:16:32,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-04-04 15:16:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:16:32,453 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 15:16:32,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 20.076923076923077) internal successors, (261), 16 states have internal predecessors, (261), 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-04-04 15:16:32,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:16:32,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:16:32,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-04 15:16:32,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 15:16:32,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-04-04 15:16:32,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 15:16:34,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-04 15:16:34,334 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@76e464d9 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:183) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2024-04-04 15:16:34,336 INFO L158 Benchmark]: Toolchain (without parser) took 59493.05ms. Allocated memory was 313.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 241.5MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 170.6MB. Max. memory is 8.0GB. [2024-04-04 15:16:34,336 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory was 143.2MB in the beginning and 143.2MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 15:16:34,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.25ms. Allocated memory is still 313.5MB. Free memory was 241.5MB in the beginning and 216.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-04-04 15:16:34,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.42ms. Allocated memory is still 313.5MB. Free memory was 216.8MB in the beginning and 214.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 15:16:34,338 INFO L158 Benchmark]: Boogie Preprocessor took 37.95ms. Allocated memory is still 313.5MB. Free memory was 214.2MB in the beginning and 212.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 15:16:34,338 INFO L158 Benchmark]: RCFGBuilder took 669.00ms. Allocated memory is still 313.5MB. Free memory was 212.1MB in the beginning and 243.5MB in the end (delta: -31.3MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2024-04-04 15:16:34,339 INFO L158 Benchmark]: TraceAbstraction took 58272.10ms. Allocated memory was 313.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 242.4MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 171.6MB. Max. memory is 8.0GB. [2024-04-04 15:16:34,341 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.09ms. Allocated memory is still 173.0MB. Free memory was 143.2MB in the beginning and 143.2MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 439.25ms. Allocated memory is still 313.5MB. Free memory was 241.5MB in the beginning and 216.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.42ms. Allocated memory is still 313.5MB. Free memory was 216.8MB in the beginning and 214.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.95ms. Allocated memory is still 313.5MB. Free memory was 214.2MB in the beginning and 212.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 669.00ms. Allocated memory is still 313.5MB. Free memory was 212.1MB in the beginning and 243.5MB in the end (delta: -31.3MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * TraceAbstraction took 58272.10ms. Allocated memory was 313.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 242.4MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 171.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@76e464d9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@76e464d9: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-04 15:16:34,356 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-04-04 15:16:34,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...