/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 FORWARD --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/rfi003_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:24:17,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:24:17,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:24:17,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:24:17,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:24:17,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:24:17,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:24:17,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:24:17,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:24:17,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:24:17,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:24:17,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:24:17,948 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:24:17,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:24:17,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:24:17,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:24:17,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:24:17,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:24:17,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:24:17,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:24:17,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:24:17,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:24:17,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:24:17,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:24:17,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:24:17,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:24:17,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:24:17,951 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:24:17,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:24:17,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:24:17,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:24:17,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:24:17,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:24:17,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:24:17,952 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:24:17,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:24:17,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:24:17,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:24:17,953 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:24:17,953 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 -> FORWARD 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 00:24:18,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:24:18,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:24:18,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:24:18,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:24:18,161 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:24:18,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2024-05-07 00:24:19,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:24:19,427 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:24:19,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2024-05-07 00:24:19,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9b77c726/eb7dccf0e0b349bda0fec696faac5567/FLAG7168c28e3 [2024-05-07 00:24:19,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9b77c726/eb7dccf0e0b349bda0fec696faac5567 [2024-05-07 00:24:19,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:24:19,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:24:19,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:24:19,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:24:19,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:24:19,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:19,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e58fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19, skipping insertion in model container [2024-05-07 00:24:19,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:19,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:24:19,658 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/rfi003_tso.i[944,957] [2024-05-07 00:24:19,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:24:19,879 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:24:19,887 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/rfi003_tso.i[944,957] [2024-05-07 00:24:19,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:24:19,943 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:24:19,943 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:24:19,949 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:24:19,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19 WrapperNode [2024-05-07 00:24:19,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:24:19,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:24:19,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:24:19,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:24:19,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:19,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,019 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 170 [2024-05-07 00:24:20,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:24:20,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:24:20,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:24:20,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:24:20,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:24:20,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:24:20,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:24:20,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:24:20,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (1/1) ... [2024-05-07 00:24:20,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:24:20,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:24:20,137 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 00:24:20,190 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 00:24:20,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:24:20,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:24:20,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:24:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:24:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:24:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:24:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:24:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:24:20,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:24:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:24:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:24:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:24:20,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:24:20,215 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 00:24:20,336 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:24:20,337 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:24:20,568 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:24:20,691 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:24:20,691 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:24:20,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:24:20 BoogieIcfgContainer [2024-05-07 00:24:20,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:24:20,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:24:20,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:24:20,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:24:20,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:24:19" (1/3) ... [2024-05-07 00:24:20,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2375d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:24:20, skipping insertion in model container [2024-05-07 00:24:20,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:24:19" (2/3) ... [2024-05-07 00:24:20,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2375d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:24:20, skipping insertion in model container [2024-05-07 00:24:20,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:24:20" (3/3) ... [2024-05-07 00:24:20,701 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_tso.i [2024-05-07 00:24:20,709 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:24:20,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:24:20,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-07 00:24:20,716 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:24:20,778 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:24:20,817 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:24:20,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:24:20,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:24:20,820 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 00:24:20,839 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 00:24:20,851 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:24:20,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:24:20,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:24:20,868 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;@6e50de8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 00:24:20,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 00:24:20,894 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 00:24:20,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:24:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash -213477164, now seen corresponding path program 1 times [2024-05-07 00:24:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:24:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970276859] [2024-05-07 00:24:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:21,327 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 00:24:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:24:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970276859] [2024-05-07 00:24:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970276859] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:24:21,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:24:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:24:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895442298] [2024-05-07 00:24:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:24:21,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 00:24:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:24:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 00:24:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 00:24:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:24:21,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:24:21,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 00:24:21,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:24:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:24:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:24:21,461 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 00:24:21,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:24:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 148362271, now seen corresponding path program 1 times [2024-05-07 00:24:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:24:21,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966075179] [2024-05-07 00:24:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:24:22,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:24:22,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966075179] [2024-05-07 00:24:22,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966075179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:24:22,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:24:22,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-05-07 00:24:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095934548] [2024-05-07 00:24:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:24:22,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-07 00:24:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:24:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-07 00:24:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-05-07 00:24:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:24:22,985 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:24:22,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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 00:24:22,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:24:22,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:24:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1955816578, now seen corresponding path program 1 times [2024-05-07 00:24:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:26,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-05-07 00:24:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:27,072 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 00:24:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:24:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 00:24:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1381194663, now seen corresponding path program 1 times [2024-05-07 00:24:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:27,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:24:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:24:27,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 00:24:27,320 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 00:24:27,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:24:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -244766558, now seen corresponding path program 1 times [2024-05-07 00:24:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:24:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287319452] [2024-05-07 00:24:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:27,549 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 00:24:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:24:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287319452] [2024-05-07 00:24:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287319452] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:24:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:24:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:24:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615375859] [2024-05-07 00:24:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:24:27,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:24:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:24:27,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:24:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:24:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:24:27,556 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:24:27,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 00:24:27,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:24:27,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:24:27,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:24:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1381194663, now seen corresponding path program 2 times [2024-05-07 00:24:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:27,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 696997316, now seen corresponding path program 1 times [2024-05-07 00:24:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:27,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -426670534, now seen corresponding path program 1 times [2024-05-07 00:24:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:28,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:28,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1365834068, now seen corresponding path program 1 times [2024-05-07 00:24:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:29,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash -608816479, now seen corresponding path program 1 times [2024-05-07 00:24:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:33,347 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 00:24:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:33,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:24:33,780 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 00:24:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:24:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-05-07 00:24:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1381194663, now seen corresponding path program 3 times [2024-05-07 00:24:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:33,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:33,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:34,125 INFO L85 PathProgramCache]: Analyzing trace with hash 696997316, now seen corresponding path program 2 times [2024-05-07 00:24:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:34,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash -426670534, now seen corresponding path program 2 times [2024-05-07 00:24:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:34,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1365834068, now seen corresponding path program 2 times [2024-05-07 00:24:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:35,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 598248498, now seen corresponding path program 1 times [2024-05-07 00:24:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:40,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -673438242, now seen corresponding path program 1 times [2024-05-07 00:24:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:45,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash 255370869, now seen corresponding path program 1 times [2024-05-07 00:24:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:50,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1116616493, now seen corresponding path program 1 times [2024-05-07 00:24:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:24:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:24:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:24:55,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:24:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash 174567257, now seen corresponding path program 1 times [2024-05-07 00:25:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:00,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1252557262, now seen corresponding path program 1 times [2024-05-07 00:25:05,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:05,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1148783774, now seen corresponding path program 1 times [2024-05-07 00:25:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:10,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash 177795724, now seen corresponding path program 1 times [2024-05-07 00:25:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:25:20,601 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 00:25:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:25:20,653 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 00:25:20,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 00:25:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2024-05-07 00:25:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1365834068, now seen corresponding path program 3 times [2024-05-07 00:25:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:21,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1770015453, now seen corresponding path program 1 times [2024-05-07 00:25:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:38,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1744017965, now seen corresponding path program 1 times [2024-05-07 00:25:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:48,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1052120032, now seen corresponding path program 1 times [2024-05-07 00:25:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:25:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:25:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:25:59,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:25:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 172486754, now seen corresponding path program 1 times [2024-05-07 00:26:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:26:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:26:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:08,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:26:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1252490116, now seen corresponding path program 1 times [2024-05-07 00:26:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:26:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:26:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:18,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:26:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1148781635, now seen corresponding path program 1 times [2024-05-07 00:26:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:26:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:26:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:28,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:26:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1006888841, now seen corresponding path program 1 times [2024-05-07 00:26:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:26:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:26:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:26:38,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:26:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1813002990, now seen corresponding path program 1 times [2024-05-07 00:28:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:13,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -612655978, now seen corresponding path program 1 times [2024-05-07 00:28:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:18,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 118872668, now seen corresponding path program 1 times [2024-05-07 00:28:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -134682919, now seen corresponding path program 1 times [2024-05-07 00:28:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash -697006293, now seen corresponding path program 1 times [2024-05-07 00:28:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1085942653, now seen corresponding path program 1 times [2024-05-07 00:28:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:28:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:28:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:28:23,382 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,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:28:23,383 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 00:28:23,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:28:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1061929314, now seen corresponding path program 2 times [2024-05-07 00:28:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:28:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019302082] [2024-05-07 00:28:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:28:24,974 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 00:28:24,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:28:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019302082] [2024-05-07 00:28:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019302082] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:28:24,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:28:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-05-07 00:28:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60333805] [2024-05-07 00:28:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:28:24,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-07 00:28:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:28:24,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-07 00:28:24,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-05-07 00:28:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:24,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:28:24,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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 00:28:24,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:28:24,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:28:24,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:28:24,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1813002990, now seen corresponding path program 2 times [2024-05-07 00:28:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:45,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -612655978, now seen corresponding path program 2 times [2024-05-07 00:28:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 118872668, now seen corresponding path program 2 times [2024-05-07 00:28:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash -134682919, now seen corresponding path program 2 times [2024-05-07 00:28:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:28:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:28:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:28:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 00:28:46,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable39 [2024-05-07 00:28:46,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 00:28:46,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:28:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2009820140, now seen corresponding path program 3 times [2024-05-07 00:28:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:28:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211192469] [2024-05-07 00:28:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:28:47,615 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 00:28:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:28:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211192469] [2024-05-07 00:28:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211192469] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:28:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:28:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-05-07 00:28:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538008561] [2024-05-07 00:28:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:28:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-07 00:28:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:28:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-07 00:28:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-05-07 00:28:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:47,617 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:28:47,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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 00:28:47,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:28:47,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:28:47,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:28:47,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 00:28:47,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 00:28:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 00:28:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:28:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 00:28:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-07 00:28:48,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 00:28:48,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-07 00:28:48,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 00:28:48,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 00:28:48,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-07 00:28:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-07 00:28:48,475 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 00:28:48,479 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:28:48,479 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:28:48,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:28:48 BasicIcfg [2024-05-07 00:28:48,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:28:48,482 INFO L158 Benchmark]: Toolchain (without parser) took 269022.61ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 83.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. [2024-05-07 00:28:48,482 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:28:48,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.81ms. Allocated memory is still 151.0MB. Free memory was 82.7MB in the beginning and 110.2MB in the end (delta: -27.4MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2024-05-07 00:28:48,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.81ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 107.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 00:28:48,482 INFO L158 Benchmark]: Boogie Preprocessor took 49.58ms. Allocated memory is still 151.0MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:28:48,483 INFO L158 Benchmark]: RCFGBuilder took 622.90ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 55.1MB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2024-05-07 00:28:48,483 INFO L158 Benchmark]: TraceAbstraction took 267786.08ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 54.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2024-05-07 00:28:48,485 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.10ms. Allocated memory is still 151.0MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.81ms. Allocated memory is still 151.0MB. Free memory was 82.7MB in the beginning and 110.2MB in the end (delta: -27.4MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.81ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 107.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.58ms. Allocated memory is still 151.0MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 622.90ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 55.1MB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 267786.08ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 54.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 27615, independent: 26303, independent conditional: 26235, independent unconditional: 68, dependent: 1312, dependent conditional: 1312, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27418, independent: 26303, independent conditional: 26235, independent unconditional: 68, dependent: 1115, dependent conditional: 1115, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27418, independent: 26303, independent conditional: 26235, independent unconditional: 68, dependent: 1115, dependent conditional: 1115, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27418, independent: 26303, independent conditional: 26235, independent unconditional: 68, dependent: 1115, dependent conditional: 1115, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32294, independent: 26303, independent conditional: 11973, independent unconditional: 14330, dependent: 5991, dependent conditional: 4618, dependent unconditional: 1373, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32294, independent: 26303, independent conditional: 8224, independent unconditional: 18079, dependent: 5991, dependent conditional: 2974, dependent unconditional: 3017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32294, independent: 26303, independent conditional: 8224, independent unconditional: 18079, dependent: 5991, dependent conditional: 2974, dependent unconditional: 3017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 798, independent: 673, independent conditional: 163, independent unconditional: 510, dependent: 125, dependent conditional: 101, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 798, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 143, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 125, dependent conditional: 101, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 143, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 125, dependent conditional: 101, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 945, independent: 64, independent conditional: 62, independent unconditional: 1, dependent: 882, dependent conditional: 731, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 32294, independent: 25630, independent conditional: 8061, independent unconditional: 17569, dependent: 5866, dependent conditional: 2873, dependent unconditional: 2993, unknown: 798, unknown conditional: 264, unknown unconditional: 534] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 673, Positive conditional cache size: 163, Positive unconditional cache size: 510, Negative cache size: 125, Negative conditional cache size: 101, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5393, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32294, independent: 26303, independent conditional: 11973, independent unconditional: 14330, dependent: 5991, dependent conditional: 4618, dependent unconditional: 1373, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32294, independent: 26303, independent conditional: 8224, independent unconditional: 18079, dependent: 5991, dependent conditional: 2974, dependent unconditional: 3017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32294, independent: 26303, independent conditional: 8224, independent unconditional: 18079, dependent: 5991, dependent conditional: 2974, dependent unconditional: 3017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 798, independent: 673, independent conditional: 163, independent unconditional: 510, dependent: 125, dependent conditional: 101, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 798, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 143, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 125, dependent conditional: 101, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 143, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 125, dependent conditional: 101, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 945, independent: 64, independent conditional: 62, independent unconditional: 1, dependent: 882, dependent conditional: 731, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 32294, independent: 25630, independent conditional: 8061, independent unconditional: 17569, dependent: 5866, dependent conditional: 2873, dependent unconditional: 2993, unknown: 798, unknown conditional: 264, unknown unconditional: 534] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 673, Positive conditional cache size: 163, Positive unconditional cache size: 510, Negative cache size: 125, Negative conditional cache size: 101, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5393 ], Independence queries for same thread: 197 - 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, 116 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 267.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 262.7s, 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: 63, 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.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 3170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 259.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 141, ConditionalCommutativityTraceChecks: 37, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 00:28:48,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-07 00:28:48,786 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...