/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 01:41:20,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 01:41:20,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 01:41:20,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 01:41:20,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 01:41:20,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 01:41:20,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 01:41:20,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 01:41:20,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 01:41:20,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 01:41:20,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 01:41:20,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 01:41:20,167 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 01:41:20,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 01:41:20,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 01:41:20,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 01:41:20,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 01:41:20,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 01:41:20,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 01:41:20,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 01:41:20,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 01:41:20,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 01:41:20,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 01:41:20,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 01:41:20,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 01:41:20,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 01:41:20,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 01:41:20,182 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 01:41:20,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 01:41:20,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 01:41:20,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 01:41:20,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 01:41:20,185 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 01:41:20,185 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 [2024-04-04 01:41:20,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 01:41:20,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 01:41:20,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 01:41:20,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 01:41:20,431 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 01:41:20,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2024-04-04 01:41:21,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 01:41:21,687 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 01:41:21,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2024-04-04 01:41:21,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3ffd01f9d/1ad73bd16d184d99934e9b981ce7258a/FLAGdf0b7b1c7 [2024-04-04 01:41:21,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3ffd01f9d/1ad73bd16d184d99934e9b981ce7258a [2024-04-04 01:41:21,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 01:41:21,711 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 01:41:21,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 01:41:21,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 01:41:21,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 01:41:21,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 01:41:21" (1/1) ... [2024-04-04 01:41:21,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b940ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:21, skipping insertion in model container [2024-04-04 01:41:21,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 01:41:21" (1/1) ... [2024-04-04 01:41:21,755 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 01:41:21,885 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2024-04-04 01:41:22,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 01:41:22,081 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 01:41:22,091 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2024-04-04 01:41:22,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 01:41:22,152 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 01:41:22,152 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 01:41:22,158 INFO L206 MainTranslator]: Completed translation [2024-04-04 01:41:22,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22 WrapperNode [2024-04-04 01:41:22,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 01:41:22,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 01:41:22,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 01:41:22,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 01:41:22,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,216 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-04-04 01:41:22,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 01:41:22,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 01:41:22,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 01:41:22,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 01:41:22,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 01:41:22,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 01:41:22,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 01:41:22,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 01:41:22,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (1/1) ... [2024-04-04 01:41:22,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 01:41:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:41:22,277 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 01:41:22,300 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 01:41:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 01:41:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-04 01:41:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 01:41:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 01:41:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 01:41:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-04-04 01:41:22,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-04-04 01:41:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-04-04 01:41:22,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-04-04 01:41:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-04-04 01:41:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-04-04 01:41:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-04-04 01:41:22,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-04-04 01:41:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 01:41:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-04 01:41:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 01:41:22,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 01:41:22,326 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 01:41:22,447 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 01:41:22,449 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 01:41:22,715 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 01:41:22,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 01:41:22,814 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-04 01:41:22,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 01:41:22 BoogieIcfgContainer [2024-04-04 01:41:22,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 01:41:22,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 01:41:22,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 01:41:22,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 01:41:22,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 01:41:21" (1/3) ... [2024-04-04 01:41:22,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc8eea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 01:41:22, skipping insertion in model container [2024-04-04 01:41:22,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:41:22" (2/3) ... [2024-04-04 01:41:22,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc8eea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 01:41:22, skipping insertion in model container [2024-04-04 01:41:22,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 01:41:22" (3/3) ... [2024-04-04 01:41:22,827 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2024-04-04 01:41:22,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 01:41:22,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 01:41:22,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-04 01:41:22,843 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 01:41:22,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 01:41:22,935 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 01:41:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 01:41:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:41:22,937 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 01:41:22,941 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 01:41:22,964 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 01:41:22,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:41:22,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 01:41:22,991 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;@553896cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 01:41:22,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-04 01:41:23,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:41:23,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:41:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1200048375, now seen corresponding path program 1 times [2024-04-04 01:41:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:41:23,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692259670] [2024-04-04 01:41:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:41:23,952 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 01:41:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:41:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692259670] [2024-04-04 01:41:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692259670] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:41:23,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:41:23,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 01:41:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154603758] [2024-04-04 01:41:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:41:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-04 01:41:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:41:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-04 01:41:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-04 01:41:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:41:23,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:41:23,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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 01:41:23,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:41:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:41:24,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 01:41:24,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:41:24,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:41:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1763865265, now seen corresponding path program 1 times [2024-04-04 01:41:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:41:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962243561] [2024-04-04 01:41:24,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:41:24,464 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 01:41:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:41:24,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962243561] [2024-04-04 01:41:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962243561] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:41:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:41:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-04 01:41:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972441011] [2024-04-04 01:41:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:41:24,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-04 01:41:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:41:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-04 01:41:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-04-04 01:41:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:41:24,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:41:24,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 01:41:24,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:41:24,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:41:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:41:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:41:24,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 01:41:24,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:41:24,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:41:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -851811529, now seen corresponding path program 1 times [2024-04-04 01:41:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:41:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495171662] [2024-04-04 01:41:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:41:25,003 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 01:41:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:41:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495171662] [2024-04-04 01:41:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495171662] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:41:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:41:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-04 01:41:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741037217] [2024-04-04 01:41:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:41:25,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-04 01:41:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:41:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-04 01:41:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-04-04 01:41:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:41:25,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:41:25,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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 01:41:25,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:41:25,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:41:25,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:41:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 1 times [2024-04-04 01:41:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:25,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash 609086299, now seen corresponding path program 1 times [2024-04-04 01:41:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:26,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 299947602, now seen corresponding path program 1 times [2024-04-04 01:41:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:26,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 1 times [2024-04-04 01:41:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:27,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 1 times [2024-04-04 01:41:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:27,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash 839787199, now seen corresponding path program 1 times [2024-04-04 01:41:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:38,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 776003673, now seen corresponding path program 1 times [2024-04-04 01:41:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:48,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1635537888, now seen corresponding path program 1 times [2024-04-04 01:41:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:41:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:41:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:41:57,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:41:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1436532797, now seen corresponding path program 1 times [2024-04-04 01:42:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:06,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 647858376, now seen corresponding path program 1 times [2024-04-04 01:42:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:16,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1362308824, now seen corresponding path program 1 times [2024-04-04 01:42:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:25,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2034862080, now seen corresponding path program 1 times [2024-04-04 01:42:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:33,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash -210081842, now seen corresponding path program 1 times [2024-04-04 01:42:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:41,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -419140096, now seen corresponding path program 1 times [2024-04-04 01:42:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:49,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1095663065, now seen corresponding path program 1 times [2024-04-04 01:42:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:49,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash 607278302, now seen corresponding path program 1 times [2024-04-04 01:42:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:42:50,860 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 01:42:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:42:50,929 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 01:42:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-04 01:42:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-04-04 01:42:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 2 times [2024-04-04 01:42:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:51,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 609086299, now seen corresponding path program 2 times [2024-04-04 01:42:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:51,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash 299947602, now seen corresponding path program 2 times [2024-04-04 01:42:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:51,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 2 times [2024-04-04 01:42:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:52,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 2 times [2024-04-04 01:42:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:42:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:42:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:42:52,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:42:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash 839787199, now seen corresponding path program 2 times [2024-04-04 01:43:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:00,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 776003673, now seen corresponding path program 2 times [2024-04-04 01:43:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:08,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1635537888, now seen corresponding path program 2 times [2024-04-04 01:43:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:16,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:16,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1436532797, now seen corresponding path program 2 times [2024-04-04 01:43:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:24,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 647858376, now seen corresponding path program 2 times [2024-04-04 01:43:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:32,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1362308824, now seen corresponding path program 2 times [2024-04-04 01:43:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:39,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2034862080, now seen corresponding path program 2 times [2024-04-04 01:43:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:48,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash -210081842, now seen corresponding path program 2 times [2024-04-04 01:43:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:43:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:43:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:43:55,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:43:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash -419140096, now seen corresponding path program 2 times [2024-04-04 01:44:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:03,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1095663065, now seen corresponding path program 2 times [2024-04-04 01:44:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:03,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:44:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-04 01:44:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 01:44:11,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-04 01:44:11,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-04 01:44:11,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:44:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1157342217, now seen corresponding path program 2 times [2024-04-04 01:44:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:44:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112034863] [2024-04-04 01:44:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:44:12,044 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 01:44:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:44:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112034863] [2024-04-04 01:44:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112034863] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:44:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:44:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 01:44:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500765386] [2024-04-04 01:44:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:44:12,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 01:44:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:44:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 01:44:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-04-04 01:44:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:44:12,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:44:12,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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 01:44:12,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:44:12,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-04 01:44:12,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 01:44:12,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:44:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 3 times [2024-04-04 01:44:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:12,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:12,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash 609086299, now seen corresponding path program 3 times [2024-04-04 01:44:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:12,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 299947602, now seen corresponding path program 3 times [2024-04-04 01:44:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:12,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 3 times [2024-04-04 01:44:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:13,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 3 times [2024-04-04 01:44:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:13,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 839787199, now seen corresponding path program 3 times [2024-04-04 01:44:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:20,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 776003673, now seen corresponding path program 3 times [2024-04-04 01:44:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:28,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:28,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1635537888, now seen corresponding path program 3 times [2024-04-04 01:44:37,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:37,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1436532797, now seen corresponding path program 3 times [2024-04-04 01:44:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:44,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:51,767 INFO L85 PathProgramCache]: Analyzing trace with hash 647858376, now seen corresponding path program 3 times [2024-04-04 01:44:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:51,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1362308824, now seen corresponding path program 3 times [2024-04-04 01:44:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:44:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:44:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:44:59,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:44:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2034862080, now seen corresponding path program 3 times [2024-04-04 01:45:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:08,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -210081842, now seen corresponding path program 3 times [2024-04-04 01:45:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:17,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -419140096, now seen corresponding path program 3 times [2024-04-04 01:45:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:26,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1095663065, now seen corresponding path program 3 times [2024-04-04 01:45:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:26,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash 575628482, now seen corresponding path program 1 times [2024-04-04 01:45:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:37,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash 664614145, now seen corresponding path program 1 times [2024-04-04 01:45:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:41,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:45,124 INFO L85 PathProgramCache]: Analyzing trace with hash -871797597, now seen corresponding path program 1 times [2024-04-04 01:45:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:45,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1255921342, now seen corresponding path program 1 times [2024-04-04 01:45:48,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:45:48,740 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 01:45:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:45:48,893 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 01:45:48,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-04 01:45:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-04-04 01:45:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 4 times [2024-04-04 01:45:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:49,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 609086299, now seen corresponding path program 4 times [2024-04-04 01:45:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:49,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash 299947602, now seen corresponding path program 4 times [2024-04-04 01:45:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:49,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 4 times [2024-04-04 01:45:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:50,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 4 times [2024-04-04 01:45:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:50,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:50,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1095663065, now seen corresponding path program 4 times [2024-04-04 01:45:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:45:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:45:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:45:50,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:45:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:47:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2007794832, now seen corresponding path program 1 times [2024-04-04 01:47:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:47:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:47:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:47:17,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:47:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:47:18,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable35,SelfDestructingSolverStorable57,SelfDestructingSolverStorable36,SelfDestructingSolverStorable58,SelfDestructingSolverStorable37,SelfDestructingSolverStorable59,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable40,SelfDestructingSolverStorable62,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-04-04 01:47:18,430 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@279b179f 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: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.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) 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:362) 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 01:47:18,434 INFO L158 Benchmark]: Toolchain (without parser) took 356722.73ms. Allocated memory was 161.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 92.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2024-04-04 01:47:18,435 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 01:47:18,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.64ms. Allocated memory was 161.5MB in the beginning and 255.9MB in the end (delta: 94.4MB). Free memory was 91.9MB in the beginning and 215.4MB in the end (delta: -123.5MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2024-04-04 01:47:18,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory is still 255.9MB. Free memory was 215.4MB in the beginning and 212.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:47:18,435 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 255.9MB. Free memory was 212.9MB in the beginning and 210.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:47:18,435 INFO L158 Benchmark]: RCFGBuilder took 576.50ms. Allocated memory is still 255.9MB. Free memory was 210.8MB in the beginning and 174.1MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-04-04 01:47:18,436 INFO L158 Benchmark]: TraceAbstraction took 355612.15ms. Allocated memory was 255.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 173.0MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2024-04-04 01:47:18,437 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.15ms. Allocated memory is still 161.5MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 446.64ms. Allocated memory was 161.5MB in the beginning and 255.9MB in the end (delta: 94.4MB). Free memory was 91.9MB in the beginning and 215.4MB in the end (delta: -123.5MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory is still 255.9MB. Free memory was 215.4MB in the beginning and 212.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 255.9MB. Free memory was 212.9MB in the beginning and 210.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 576.50ms. Allocated memory is still 255.9MB. Free memory was 210.8MB in the beginning and 174.1MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 355612.15ms. Allocated memory was 255.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 173.0MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. 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@279b179f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@279b179f: 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 01:47:18,451 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 01:47:18,708 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...