/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 21:12:34,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 21:12:34,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 21:12:34,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 21:12:34,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 21:12:34,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 21:12:34,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 21:12:34,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 21:12:34,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 21:12:34,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 21:12:34,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 21:12:34,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 21:12:34,460 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 21:12:34,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 21:12:34,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 21:12:34,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 21:12:34,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 21:12:34,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 21:12:34,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 21:12:34,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 21:12:34,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 21:12:34,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 21:12:34,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 21:12:34,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 21:12:34,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 21:12:34,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 21:12:34,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 21:12:34,464 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 21:12:34,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 21:12:34,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:12:34,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 21:12:34,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 21:12:34,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 21:12:34,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 21:12:34,466 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 21:12:34,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 21:12:34,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 21:12:34,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 21:12:34,467 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 21:12:34,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 21:12:34,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 21:12:34,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 21:12:34,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 21:12:34,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 21:12:34,714 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 21:12:34,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2024-05-07 21:12:35,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 21:12:35,938 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 21:12:35,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2024-05-07 21:12:35,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/90a27fb5a/96d8953b64e240bea9a1c24d22494f43/FLAG5eb419b3b [2024-05-07 21:12:35,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/90a27fb5a/96d8953b64e240bea9a1c24d22494f43 [2024-05-07 21:12:35,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 21:12:35,962 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 21:12:35,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 21:12:35,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 21:12:35,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 21:12:35,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:12:35" (1/1) ... [2024-05-07 21:12:35,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dfb0b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:35, skipping insertion in model container [2024-05-07 21:12:35,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:12:35" (1/1) ... [2024-05-07 21:12:36,031 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 21:12:36,172 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/rfi000_tso.i[944,957] [2024-05-07 21:12:36,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:12:36,375 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 21:12:36,390 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/rfi000_tso.i[944,957] [2024-05-07 21:12:36,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:12:36,461 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 21:12:36,461 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 21:12:36,467 INFO L206 MainTranslator]: Completed translation [2024-05-07 21:12:36,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36 WrapperNode [2024-05-07 21:12:36,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 21:12:36,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 21:12:36,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 21:12:36,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 21:12:36,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,551 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-05-07 21:12:36,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 21:12:36,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 21:12:36,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 21:12:36,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 21:12:36,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 21:12:36,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 21:12:36,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 21:12:36,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 21:12:36,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (1/1) ... [2024-05-07 21:12:36,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:12:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:12:36,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 21:12:36,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 21:12:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 21:12:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 21:12:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 21:12:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 21:12:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 21:12:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 21:12:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 21:12:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 21:12:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 21:12:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 21:12:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 21:12:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 21:12:36,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 21:12:36,732 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 21:12:36,850 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 21:12:36,852 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 21:12:37,158 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 21:12:37,294 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 21:12:37,294 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 21:12:37,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:12:37 BoogieIcfgContainer [2024-05-07 21:12:37,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 21:12:37,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 21:12:37,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 21:12:37,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 21:12:37,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 09:12:35" (1/3) ... [2024-05-07 21:12:37,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913f0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:12:37, skipping insertion in model container [2024-05-07 21:12:37,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:12:36" (2/3) ... [2024-05-07 21:12:37,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913f0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:12:37, skipping insertion in model container [2024-05-07 21:12:37,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:12:37" (3/3) ... [2024-05-07 21:12:37,303 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2024-05-07 21:12:37,309 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 21:12:37,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 21:12:37,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-07 21:12:37,317 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 21:12:37,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 21:12:37,390 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 21:12:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 21:12:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:12:37,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 21:12:37,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 21:12:37,424 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 21:12:37,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:12:37,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 21:12:37,441 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;@5bc3885b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 21:12:37,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 21:12:37,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 21:12:37,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:12:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -436960994, now seen corresponding path program 1 times [2024-05-07 21:12:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:12:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169951725] [2024-05-07 21:12:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:12:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:12:37,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:12:37,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169951725] [2024-05-07 21:12:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169951725] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:12:37,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:12:37,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 21:12:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645299320] [2024-05-07 21:12:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:12:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 21:12:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:12:37,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 21:12:37,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 21:12:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:12:37,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:12:37,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 21:12:37,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:12:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:12:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 21:12:38,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 21:12:38,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:12:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash 363720988, now seen corresponding path program 1 times [2024-05-07 21:12:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:12:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894601903] [2024-05-07 21:12:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:12:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:12:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:12:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894601903] [2024-05-07 21:12:39,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894601903] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:12:39,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:12:39,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-05-07 21:12:39,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824483306] [2024-05-07 21:12:39,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:12:39,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-07 21:12:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:12:39,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-07 21:12:39,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-05-07 21:12:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:12:39,734 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:12:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-05-07 21:12:39,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:12:39,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:12:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1586602466, now seen corresponding path program 1 times [2024-05-07 21:12:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:12:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:12:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:12:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:12:43,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 21:12:43,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 21:12:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 1 times [2024-05-07 21:12:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:43,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:12:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 21:12:44,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 21:12:44,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 21:12:44,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:12:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1993555754, now seen corresponding path program 1 times [2024-05-07 21:12:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:12:44,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676421203] [2024-05-07 21:12:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:12:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:12:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:12:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676421203] [2024-05-07 21:12:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676421203] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:12:44,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:12:44,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 21:12:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060351192] [2024-05-07 21:12:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:12:44,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 21:12:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:12:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 2 times [2024-05-07 21:12:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:44,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 21:12:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 21:12:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:12:44,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:12:44,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 21:12:44,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:12:44,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 21:12:44,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:12:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 3 times [2024-05-07 21:12:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:44,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 1 times [2024-05-07 21:12:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:45,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:45,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 1 times [2024-05-07 21:12:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:45,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 1 times [2024-05-07 21:12:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:46,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1785305548, now seen corresponding path program 1 times [2024-05-07 21:12:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:50,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 1 times [2024-05-07 21:12:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:51,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash 196158996, now seen corresponding path program 1 times [2024-05-07 21:12:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:54,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:54,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 1 times [2024-05-07 21:12:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:54,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 144961552, now seen corresponding path program 1 times [2024-05-07 21:12:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:57,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 1 times [2024-05-07 21:12:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:12:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:12:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:12:58,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:12:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1519312741, now seen corresponding path program 1 times [2024-05-07 21:13:01,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:01,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 1 times [2024-05-07 21:13:02,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:02,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1018755864, now seen corresponding path program 1 times [2024-05-07 21:13:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:13:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:13:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:13:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:13:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 21:13:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-05-07 21:13:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 4 times [2024-05-07 21:13:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:06,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 2 times [2024-05-07 21:13:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:06,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 2 times [2024-05-07 21:13:06,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:06,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 2 times [2024-05-07 21:13:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:07,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:07,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 2 times [2024-05-07 21:13:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:10,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 2 times [2024-05-07 21:13:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:12,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 2 times [2024-05-07 21:13:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:15,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 2 times [2024-05-07 21:13:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:18,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 1 times [2024-05-07 21:13:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:22,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash 995973440, now seen corresponding path program 1 times [2024-05-07 21:13:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:13:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:13:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:13:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:13:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 21:13:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-05-07 21:13:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 2 times [2024-05-07 21:13:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:30,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1562259135, now seen corresponding path program 1 times [2024-05-07 21:13:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:37,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 743132195, now seen corresponding path program 1 times [2024-05-07 21:13:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:45,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1777143290, now seen corresponding path program 1 times [2024-05-07 21:13:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:13:52,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:13:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:13:52,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:13:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 496862203, now seen corresponding path program 1 times [2024-05-07 21:14:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:14:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:14:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:00,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:14:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash -399614146, now seen corresponding path program 1 times [2024-05-07 21:14:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:14:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:14:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:08,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:14:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 541298586, now seen corresponding path program 1 times [2024-05-07 21:14:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:14:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:14:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:15,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:14:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash 987292596, now seen corresponding path program 1 times [2024-05-07 21:14:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:14:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:14:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:14:22,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:14:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:15:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:15:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 21:15:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 21:15:30,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 21:15:30,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 21:15:30,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:15:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1761104384, now seen corresponding path program 2 times [2024-05-07 21:15:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:15:30,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948605842] [2024-05-07 21:15:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:15:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:15:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:15:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:15:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:15:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948605842] [2024-05-07 21:15:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948605842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:15:31,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:15:31,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-05-07 21:15:31,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110967055] [2024-05-07 21:15:31,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:15:31,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-07 21:15:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:15:32,135 INFO L85 PathProgramCache]: Analyzing trace with hash -780924068, now seen corresponding path program 1 times [2024-05-07 21:15:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:15:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:15:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:15:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:15:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:15:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:15:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:15:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:15:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-07 21:15:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-05-07 21:15:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:15:32,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:15:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.5625) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 21:15:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:15:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 21:15:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 21:15:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:15:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 21:15:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 21:15:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 21:15:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-07 21:15:36,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 21:15:36,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-07 21:15:36,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 21:15:36,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 21:15:36,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-07 21:15:36,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42 [2024-05-07 21:15:36,815 INFO L448 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 21:15:36,818 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 21:15:36,818 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 21:15:36,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 09:15:36 BasicIcfg [2024-05-07 21:15:36,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 21:15:36,821 INFO L158 Benchmark]: Toolchain (without parser) took 180859.33ms. Allocated memory was 328.2MB in the beginning and 1.2GB in the end (delta: 915.4MB). Free memory was 254.1MB in the beginning and 1.1GB in the end (delta: -817.5MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. [2024-05-07 21:15:36,821 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 328.2MB. Free memory is still 293.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 21:15:36,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.27ms. Allocated memory is still 328.2MB. Free memory was 253.8MB in the beginning and 228.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-07 21:15:36,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.02ms. Allocated memory is still 328.2MB. Free memory was 228.4MB in the beginning and 292.2MB in the end (delta: -63.8MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2024-05-07 21:15:36,822 INFO L158 Benchmark]: Boogie Preprocessor took 34.43ms. Allocated memory is still 328.2MB. Free memory was 292.2MB in the beginning and 290.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 21:15:36,822 INFO L158 Benchmark]: RCFGBuilder took 709.13ms. Allocated memory is still 328.2MB. Free memory was 290.1MB in the beginning and 241.9MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2024-05-07 21:15:36,822 INFO L158 Benchmark]: TraceAbstraction took 179522.82ms. Allocated memory was 328.2MB in the beginning and 1.2GB in the end (delta: 915.4MB). Free memory was 240.8MB in the beginning and 1.1GB in the end (delta: -830.8MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2024-05-07 21:15:36,823 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 328.2MB. Free memory is still 293.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.27ms. Allocated memory is still 328.2MB. Free memory was 253.8MB in the beginning and 228.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.02ms. Allocated memory is still 328.2MB. Free memory was 228.4MB in the beginning and 292.2MB in the end (delta: -63.8MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.43ms. Allocated memory is still 328.2MB. Free memory was 292.2MB in the beginning and 290.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.13ms. Allocated memory is still 328.2MB. Free memory was 290.1MB in the beginning and 241.9MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 179522.82ms. Allocated memory was 328.2MB in the beginning and 1.2GB in the end (delta: 915.4MB). Free memory was 240.8MB in the beginning and 1.1GB in the end (delta: -830.8MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14356, independent: 13796, independent conditional: 13689, independent unconditional: 107, dependent: 560, dependent conditional: 560, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14283, independent: 13796, independent conditional: 13689, independent unconditional: 107, dependent: 487, dependent conditional: 487, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14283, independent: 13796, independent conditional: 13689, independent unconditional: 107, dependent: 487, dependent conditional: 487, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14283, independent: 13796, independent conditional: 13689, independent unconditional: 107, dependent: 487, dependent conditional: 487, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15770, independent: 13796, independent conditional: 6398, independent unconditional: 7398, dependent: 1974, dependent conditional: 1468, dependent unconditional: 506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15770, independent: 13796, independent conditional: 4064, independent unconditional: 9732, dependent: 1974, dependent conditional: 1013, dependent unconditional: 961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15770, independent: 13796, independent conditional: 4064, independent unconditional: 9732, dependent: 1974, dependent conditional: 1013, dependent unconditional: 961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 663, independent: 615, independent conditional: 144, independent unconditional: 471, dependent: 48, dependent conditional: 33, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 663, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 48, dependent conditional: 33, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 48, dependent conditional: 33, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 316, independent: 53, independent conditional: 52, independent unconditional: 1, dependent: 264, dependent conditional: 200, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15770, independent: 13181, independent conditional: 3920, independent unconditional: 9261, dependent: 1926, dependent conditional: 980, dependent unconditional: 946, unknown: 663, unknown conditional: 177, unknown unconditional: 486] , Statistics on independence cache: Total cache size (in pairs): 663, Positive cache size: 615, Positive conditional cache size: 144, Positive unconditional cache size: 471, Negative cache size: 48, Negative conditional cache size: 33, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2789, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15770, independent: 13796, independent conditional: 6398, independent unconditional: 7398, dependent: 1974, dependent conditional: 1468, dependent unconditional: 506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15770, independent: 13796, independent conditional: 4064, independent unconditional: 9732, dependent: 1974, dependent conditional: 1013, dependent unconditional: 961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15770, independent: 13796, independent conditional: 4064, independent unconditional: 9732, dependent: 1974, dependent conditional: 1013, dependent unconditional: 961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 663, independent: 615, independent conditional: 144, independent unconditional: 471, dependent: 48, dependent conditional: 33, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 663, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 48, dependent conditional: 33, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 48, dependent conditional: 33, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 316, independent: 53, independent conditional: 52, independent unconditional: 1, dependent: 264, dependent conditional: 200, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15770, independent: 13181, independent conditional: 3920, independent unconditional: 9261, dependent: 1926, dependent conditional: 980, dependent unconditional: 946, unknown: 663, unknown conditional: 177, unknown unconditional: 486] , Statistics on independence cache: Total cache size (in pairs): 663, Positive cache size: 615, Positive conditional cache size: 144, Positive unconditional cache size: 471, Negative cache size: 48, Negative conditional cache size: 33, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2789 ], Independence queries for same thread: 73 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 113 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 179.4s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 174.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 173.3s, ConditionalCommutativityIAIntegrations: 1, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 101, ConditionalCommutativityTraceChecks: 35, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 21:15:36,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-07 21:15:37,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...