/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/safe001_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:28:52,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:28:52,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:28:52,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:28:52,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:28:52,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:28:52,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:28:52,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:28:52,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:28:52,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:28:52,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:28:52,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:28:52,305 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:28:52,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:28:52,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:28:52,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:28:52,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:28:52,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:28:52,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:28:52,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:28:52,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:28:52,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:28:52,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:28:52,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:28:52,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:28:52,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:28:52,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:28:52,309 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:28:52,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:28:52,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:28:52,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:28:52,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:28:52,312 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:28:52,312 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:28:52,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:28:52,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:28:52,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:28:52,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:28:52,534 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:28:52,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_tso.i [2024-05-07 00:28:53,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:28:53,850 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:28:53,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_tso.i [2024-05-07 00:28:53,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c3a694b5a/57ac671c9433464eb1eb5fe67ef21979/FLAG986c967eb [2024-05-07 00:28:53,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c3a694b5a/57ac671c9433464eb1eb5fe67ef21979 [2024-05-07 00:28:53,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:28:53,887 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:28:53,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:28:53,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:28:53,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:28:53,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:28:53" (1/1) ... [2024-05-07 00:28:53,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bea10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:53, skipping insertion in model container [2024-05-07 00:28:53,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:28:53" (1/1) ... [2024-05-07 00:28:53,936 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:28:54,055 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/safe001_tso.i[945,958] [2024-05-07 00:28:54,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:28:54,193 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:28:54,207 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/safe001_tso.i[945,958] [2024-05-07 00:28:54,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:28:54,315 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:28:54,315 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:28:54,323 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:28:54,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54 WrapperNode [2024-05-07 00:28:54,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:28:54,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:28:54,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:28:54,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:28:54,333 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:28:54" (1/1) ... [2024-05-07 00:28:54,354 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:28:54" (1/1) ... [2024-05-07 00:28:54,374 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-05-07 00:28:54,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:28:54,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:28:54,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:28:54,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:28:54,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:28:54,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:28:54,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:28:54,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:28:54,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (1/1) ... [2024-05-07 00:28:54,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:28:54,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:28:54,428 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:28:54,442 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:28:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:28:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:28:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:28:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:28:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:28:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:28:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:28:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:28:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:28:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 00:28:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 00:28:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:28:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:28:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:28:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:28:54,471 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:28:54,605 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:28:54,608 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:28:54,749 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:28:54,758 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:28:54,758 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:28:54,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:28:54 BoogieIcfgContainer [2024-05-07 00:28:54,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:28:54,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:28:54,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:28:54,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:28:54,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:28:53" (1/3) ... [2024-05-07 00:28:54,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adf92dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:28:54, skipping insertion in model container [2024-05-07 00:28:54,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:28:54" (2/3) ... [2024-05-07 00:28:54,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adf92dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:28:54, skipping insertion in model container [2024-05-07 00:28:54,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:28:54" (3/3) ... [2024-05-07 00:28:54,765 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_tso.i [2024-05-07 00:28:54,771 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:28:54,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:28:54,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:28:54,779 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:28:54,827 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:28:54,860 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:28:54,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:28:54,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:28:54,866 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:28:54,878 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:28:54,908 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:28:54,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:28:54,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:28:54,928 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;@5ad119e7, 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:28:54,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 00:28:54,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:28:54,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:28:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1417150929, now seen corresponding path program 1 times [2024-05-07 00:28:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:28:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557146012] [2024-05-07 00:28:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:28:55,283 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:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:28:55,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557146012] [2024-05-07 00:28:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557146012] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:28:55,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:28:55,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:28:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860591151] [2024-05-07 00:28:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:28:55,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:28:55,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:28:55,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:28:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:28:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:55,314 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:28:55,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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:55,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:55,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:28:55,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:28:55,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:28:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1576267092, now seen corresponding path program 1 times [2024-05-07 00:28:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:28:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151094609] [2024-05-07 00:28:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:28:55,699 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:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:28:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151094609] [2024-05-07 00:28:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151094609] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:28:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:28:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:28:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847488661] [2024-05-07 00:28:55,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:28:55,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:28:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:28:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:28:55,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:28:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:55,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:28:55,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:55,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:55,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:28:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -782514121, now seen corresponding path program 1 times [2024-05-07 00:28:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:28:56,356 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:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:28:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:28:56,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:28:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 00:28:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash 264576160, now seen corresponding path program 1 times [2024-05-07 00:28:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:56,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 227249010, now seen corresponding path program 1 times [2024-05-07 00:28:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:56,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -160967937, now seen corresponding path program 1 times [2024-05-07 00:28:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash 863951907, now seen corresponding path program 1 times [2024-05-07 00:28:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1357603899, now seen corresponding path program 1 times [2024-05-07 00:28:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash -875077585, now seen corresponding path program 1 times [2024-05-07 00:28:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 248866356, now seen corresponding path program 1 times [2024-05-07 00:28:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -961803363, now seen corresponding path program 1 times [2024-05-07 00:28:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -31025906, now seen corresponding path program 1 times [2024-05-07 00:28:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -278095492, now seen corresponding path program 1 times [2024-05-07 00:28:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:57,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 406671229, now seen corresponding path program 1 times [2024-05-07 00:28:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1140747153, now seen corresponding path program 1 times [2024-05-07 00:28:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1268508063, now seen corresponding path program 1 times [2024-05-07 00:28:58,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -205759790, now seen corresponding path program 1 times [2024-05-07 00:28:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash 686099254, now seen corresponding path program 1 times [2024-05-07 00:28:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:58,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1840030683, now seen corresponding path program 1 times [2024-05-07 00:28:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1971477442, now seen corresponding path program 1 times [2024-05-07 00:28:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1726164038, now seen corresponding path program 1 times [2024-05-07 00:28:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1302608782, now seen corresponding path program 1 times [2024-05-07 00:28:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2120229621, now seen corresponding path program 1 times [2024-05-07 00:28:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1315320508, now seen corresponding path program 1 times [2024-05-07 00:28:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 319524367, now seen corresponding path program 1 times [2024-05-07 00:28:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:28:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:28:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:28:59,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:28:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1534327899, now seen corresponding path program 1 times [2024-05-07 00:29:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1335978818, now seen corresponding path program 1 times [2024-05-07 00:29:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1021619030, now seen corresponding path program 1 times [2024-05-07 00:29:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -521233870, now seen corresponding path program 1 times [2024-05-07 00:29:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash 23342526, now seen corresponding path program 1 times [2024-05-07 00:29:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash 416395348, now seen corresponding path program 1 times [2024-05-07 00:29:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash -956396494, now seen corresponding path program 1 times [2024-05-07 00:29:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash 938980037, now seen corresponding path program 1 times [2024-05-07 00:29:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -523899004, now seen corresponding path program 1 times [2024-05-07 00:29:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1125278165, now seen corresponding path program 1 times [2024-05-07 00:29:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -313393531, now seen corresponding path program 1 times [2024-05-07 00:29:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1257033572, now seen corresponding path program 1 times [2024-05-07 00:29:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:00,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:29:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:29:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:29:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:29:01,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:29:01,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:29:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1541108586, now seen corresponding path program 1 times [2024-05-07 00:29:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:29:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125157376] [2024-05-07 00:29:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:29:01,427 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:29:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:29:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125157376] [2024-05-07 00:29:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125157376] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:29:01,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:29:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 00:29:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819803170] [2024-05-07 00:29:01,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:29:01,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 00:29:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:29:01,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:29:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 00:29:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:01,430 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:29:01,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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:29:01,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:01,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:29:01,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:29:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:29:02,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-07 00:29:02,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:29:02,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:29:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1328247906, now seen corresponding path program 2 times [2024-05-07 00:29:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:29:02,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633185454] [2024-05-07 00:29:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:29:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:29:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:29:02,314 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:29:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:29:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633185454] [2024-05-07 00:29:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633185454] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:29:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:29:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:29:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140901928] [2024-05-07 00:29:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:29:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:29:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:29:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:29:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:29:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:02,316 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:29:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:29:02,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:02,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:29:02,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:29:02,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:29:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:29:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:29:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:29:03,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 00:29:03,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 00:29:03,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 00:29:03,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 00:29:03,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-07 00:29:03,301 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:03,303 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:29:03,303 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:29:03,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:29:03 BasicIcfg [2024-05-07 00:29:03,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:29:03,306 INFO L158 Benchmark]: Toolchain (without parser) took 9418.96ms. Allocated memory was 170.9MB in the beginning and 479.2MB in the end (delta: 308.3MB). Free memory was 101.4MB in the beginning and 367.6MB in the end (delta: -266.2MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2024-05-07 00:29:03,307 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 170.9MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:29:03,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.88ms. Allocated memory was 170.9MB in the beginning and 271.6MB in the end (delta: 100.7MB). Free memory was 101.3MB in the beginning and 238.4MB in the end (delta: -137.1MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2024-05-07 00:29:03,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.59ms. Allocated memory is still 271.6MB. Free memory was 238.4MB in the beginning and 236.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:29:03,307 INFO L158 Benchmark]: Boogie Preprocessor took 20.75ms. Allocated memory is still 271.6MB. Free memory was 236.3MB in the beginning and 234.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:29:03,307 INFO L158 Benchmark]: RCFGBuilder took 362.93ms. Allocated memory is still 271.6MB. Free memory was 234.8MB in the beginning and 220.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 00:29:03,308 INFO L158 Benchmark]: TraceAbstraction took 8545.04ms. Allocated memory was 271.6MB in the beginning and 479.2MB in the end (delta: 207.6MB). Free memory was 219.0MB in the beginning and 367.6MB in the end (delta: -148.6MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2024-05-07 00:29:03,309 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 170.9MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.88ms. Allocated memory was 170.9MB in the beginning and 271.6MB in the end (delta: 100.7MB). Free memory was 101.3MB in the beginning and 238.4MB in the end (delta: -137.1MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.59ms. Allocated memory is still 271.6MB. Free memory was 238.4MB in the beginning and 236.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.75ms. Allocated memory is still 271.6MB. Free memory was 236.3MB in the beginning and 234.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 362.93ms. Allocated memory is still 271.6MB. Free memory was 234.8MB in the beginning and 220.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8545.04ms. Allocated memory was 271.6MB in the beginning and 479.2MB in the end (delta: 207.6MB). Free memory was 219.0MB in the beginning and 367.6MB in the end (delta: -148.6MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 177031, independent: 174568, independent conditional: 174393, independent unconditional: 175, dependent: 2463, dependent conditional: 2463, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 176936, independent: 174568, independent conditional: 174393, independent unconditional: 175, dependent: 2368, dependent conditional: 2368, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176936, independent: 174568, independent conditional: 174393, independent unconditional: 175, dependent: 2368, dependent conditional: 2368, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176936, independent: 174568, independent conditional: 174393, independent unconditional: 175, dependent: 2368, dependent conditional: 2368, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182868, independent: 174568, independent conditional: 82644, independent unconditional: 91924, dependent: 8300, dependent conditional: 5918, dependent unconditional: 2382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182868, independent: 174568, independent conditional: 35297, independent unconditional: 139271, dependent: 8300, dependent conditional: 2047, dependent unconditional: 6253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182868, independent: 174568, independent conditional: 35297, independent unconditional: 139271, dependent: 8300, dependent conditional: 2047, dependent unconditional: 6253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1081, independent: 1047, independent conditional: 187, independent unconditional: 860, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1081, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 68, dependent conditional: 54, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182868, independent: 173521, independent conditional: 35110, independent unconditional: 138411, dependent: 8266, dependent conditional: 2028, dependent unconditional: 6238, unknown: 1081, unknown conditional: 206, unknown unconditional: 875] , Statistics on independence cache: Total cache size (in pairs): 1081, Positive cache size: 1047, Positive conditional cache size: 187, Positive unconditional cache size: 860, Negative cache size: 34, Negative conditional cache size: 19, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51218, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182868, independent: 174568, independent conditional: 82644, independent unconditional: 91924, dependent: 8300, dependent conditional: 5918, dependent unconditional: 2382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182868, independent: 174568, independent conditional: 35297, independent unconditional: 139271, dependent: 8300, dependent conditional: 2047, dependent unconditional: 6253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182868, independent: 174568, independent conditional: 35297, independent unconditional: 139271, dependent: 8300, dependent conditional: 2047, dependent unconditional: 6253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1081, independent: 1047, independent conditional: 187, independent unconditional: 860, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1081, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 68, dependent conditional: 54, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182868, independent: 173521, independent conditional: 35110, independent unconditional: 138411, dependent: 8266, dependent conditional: 2028, dependent unconditional: 6238, unknown: 1081, unknown conditional: 206, unknown unconditional: 875] , Statistics on independence cache: Total cache size (in pairs): 1081, Positive cache size: 1047, Positive conditional cache size: 187, Positive unconditional cache size: 860, Negative cache size: 34, Negative conditional cache size: 19, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51218 ], Independence queries for same thread: 95 - 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 7 procedures, 117 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 7.4s, 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: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1085 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: 4.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 81, ConditionalCommutativityTraceChecks: 35, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 00:29:03,331 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:29:03,528 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...