/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/safe017_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:43:08,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:43:08,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:43:08,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:43:08,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:43:08,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:43:08,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:43:08,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:43:08,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:43:08,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:43:08,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:43:08,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:43:08,821 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:43:08,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:43:08,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:43:08,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:43:08,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:43:08,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:43:08,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:43:08,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:43:08,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:43:08,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:43:08,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:43:08,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:43:08,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:43:08,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:43:08,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:43:08,831 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:43:08,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:43:08,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:43:08,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:43:08,833 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:43:08,833 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:43:09,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:43:09,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:43:09,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:43:09,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:43:09,079 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:43:09,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2024-05-07 00:43:10,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:43:10,472 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:43:10,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2024-05-07 00:43:10,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3d56f8684/df95f975d5e044d2af90bbed40c43aea/FLAG687494b92 [2024-05-07 00:43:10,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3d56f8684/df95f975d5e044d2af90bbed40c43aea [2024-05-07 00:43:10,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:43:10,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:43:10,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:43:10,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:43:10,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:43:10,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:10,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bde5fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10, skipping insertion in model container [2024-05-07 00:43:10,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:10,579 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:43:10,722 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/safe017_tso.i[945,958] [2024-05-07 00:43:10,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:43:10,870 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:43:10,879 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/safe017_tso.i[945,958] [2024-05-07 00:43:10,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:43:10,938 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:43:10,938 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:43:10,944 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:43:10,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10 WrapperNode [2024-05-07 00:43:10,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:43:10,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:43:10,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:43:10,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:43:10,951 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:43:10" (1/1) ... [2024-05-07 00:43:10,974 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:43:10" (1/1) ... [2024-05-07 00:43:10,993 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-05-07 00:43:10,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:43:10,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:43:10,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:43:10,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:43:11,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:43:11,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:43:11,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:43:11,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:43:11,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (1/1) ... [2024-05-07 00:43:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:43:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:43:11,059 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:43:11,088 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:43:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:43:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:43:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:43:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:43:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:43:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:43:11,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:43:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:43:11,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:43:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 00:43:11,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 00:43:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:43:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:43:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:43:11,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:43:11,100 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:43:11,225 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:43:11,228 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:43:11,360 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:43:11,367 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:43:11,367 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:43:11,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:43:11 BoogieIcfgContainer [2024-05-07 00:43:11,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:43:11,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:43:11,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:43:11,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:43:11,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:43:10" (1/3) ... [2024-05-07 00:43:11,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cda9c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:43:11, skipping insertion in model container [2024-05-07 00:43:11,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:43:10" (2/3) ... [2024-05-07 00:43:11,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cda9c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:43:11, skipping insertion in model container [2024-05-07 00:43:11,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:43:11" (3/3) ... [2024-05-07 00:43:11,373 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_tso.i [2024-05-07 00:43:11,379 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:43:11,386 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:43:11,386 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:43:11,386 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:43:11,453 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:43:11,488 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:43:11,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:43:11,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:43:11,491 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:43:11,494 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:43:11,520 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:43:11,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:43:11,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:43:11,537 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;@112bd084, 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:43:11,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 00:43:11,581 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:43:11,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:43:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash 41571435, now seen corresponding path program 1 times [2024-05-07 00:43:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:43:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783505303] [2024-05-07 00:43:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:43:11,853 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:43:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:43:11,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783505303] [2024-05-07 00:43:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783505303] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:43:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:43:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:43:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124427304] [2024-05-07 00:43:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:43:11,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:43:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:43:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:43:11,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:43:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:11,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:43:11,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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:43:11,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:11,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:43:11,910 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:43:11,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:43:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1957670217, now seen corresponding path program 1 times [2024-05-07 00:43:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:43:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089385714] [2024-05-07 00:43:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:43:12,238 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:43:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:43:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089385714] [2024-05-07 00:43:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089385714] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:43:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:43:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 00:43:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556957984] [2024-05-07 00:43:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:43:12,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 00:43:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:43:12,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 00:43:12,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-07 00:43:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:12,241 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:43:12,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:43:12,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:12,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2114725854, now seen corresponding path program 1 times [2024-05-07 00:43:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:43:12,841 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:43:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:43:12,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:43:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:43:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 00:43:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1555797998, now seen corresponding path program 1 times [2024-05-07 00:43:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:43:13,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 00:43:13,190 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:43:13,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:43:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash 878826603, now seen corresponding path program 1 times [2024-05-07 00:43:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:43:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860691962] [2024-05-07 00:43:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:43:13,324 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:43:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:43:13,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860691962] [2024-05-07 00:43:13,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860691962] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:43:13,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:43:13,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 00:43:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849645895] [2024-05-07 00:43:13,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:43:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 00:43:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:43:13,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 00:43:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-07 00:43:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:13,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:43:13,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:43:13,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:13,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:43:13,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1555797998, now seen corresponding path program 2 times [2024-05-07 00:43:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 498696457, now seen corresponding path program 1 times [2024-05-07 00:43:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash -892247763, now seen corresponding path program 1 times [2024-05-07 00:43:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:13,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1548604924, now seen corresponding path program 3 times [2024-05-07 00:43:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1573976183, now seen corresponding path program 2 times [2024-05-07 00:43:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1334699395, now seen corresponding path program 2 times [2024-05-07 00:43:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -249484163, now seen corresponding path program 1 times [2024-05-07 00:43:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1947710035, now seen corresponding path program 1 times [2024-05-07 00:43:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2015383256, now seen corresponding path program 1 times [2024-05-07 00:43:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash -73532432, now seen corresponding path program 1 times [2024-05-07 00:43:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash 967461631, now seen corresponding path program 1 times [2024-05-07 00:43:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 308304618, now seen corresponding path program 1 times [2024-05-07 00:43:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1375526869, now seen corresponding path program 1 times [2024-05-07 00:43:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1706937562, now seen corresponding path program 1 times [2024-05-07 00:43:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:14,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1016089087, now seen corresponding path program 1 times [2024-05-07 00:43:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:15,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1352696745, now seen corresponding path program 1 times [2024-05-07 00:43:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:15,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1779572831, now seen corresponding path program 1 times [2024-05-07 00:43:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:16,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:43:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 00:43:16,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-07 00:43:16,383 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:43:16,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:43:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -211093587, now seen corresponding path program 2 times [2024-05-07 00:43:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:43:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986367794] [2024-05-07 00:43:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:43:16,513 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:43:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:43:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986367794] [2024-05-07 00:43:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986367794] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:43:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:43:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:43:16,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407250710] [2024-05-07 00:43:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:43:16,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:43:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:43:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:43:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:43:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:16,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:43:16,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:43:16,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:16,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:43:16,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-07 00:43:16,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1669509719, now seen corresponding path program 1 times [2024-05-07 00:43:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 885154547, now seen corresponding path program 1 times [2024-05-07 00:43:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash 582824412, now seen corresponding path program 1 times [2024-05-07 00:43:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash 573068944, now seen corresponding path program 1 times [2024-05-07 00:43:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1126936853, now seen corresponding path program 1 times [2024-05-07 00:43:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1421873238, now seen corresponding path program 1 times [2024-05-07 00:43:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -646834199, now seen corresponding path program 1 times [2024-05-07 00:43:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1821910758, now seen corresponding path program 1 times [2024-05-07 00:43:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:43:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:43:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:17,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:43:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:43:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:43:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:43:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 00:43:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:43:18,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 00:43:18,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 00:43:18,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 00:43:18,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 00:43:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:43:18,061 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 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:43:18,063 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:43:18,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:43:18,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:43:18 BasicIcfg [2024-05-07 00:43:18,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:43:18,070 INFO L158 Benchmark]: Toolchain (without parser) took 7544.32ms. Allocated memory was 224.4MB in the beginning and 332.4MB in the end (delta: 108.0MB). Free memory was 149.8MB in the beginning and 182.5MB in the end (delta: -32.8MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2024-05-07 00:43:18,070 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:43:18,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.72ms. Allocated memory is still 224.4MB. Free memory was 149.6MB in the beginning and 129.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-07 00:43:18,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 224.4MB. Free memory was 129.1MB in the beginning and 127.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:43:18,071 INFO L158 Benchmark]: Boogie Preprocessor took 27.92ms. Allocated memory is still 224.4MB. Free memory was 127.0MB in the beginning and 125.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 00:43:18,071 INFO L158 Benchmark]: RCFGBuilder took 345.94ms. Allocated memory is still 224.4MB. Free memory was 125.5MB in the beginning and 111.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 00:43:18,071 INFO L158 Benchmark]: TraceAbstraction took 6696.96ms. Allocated memory was 224.4MB in the beginning and 332.4MB in the end (delta: 108.0MB). Free memory was 110.2MB in the beginning and 182.5MB in the end (delta: -72.3MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. [2024-05-07 00:43:18,072 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 159.4MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.72ms. Allocated memory is still 224.4MB. Free memory was 149.6MB in the beginning and 129.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 224.4MB. Free memory was 129.1MB in the beginning and 127.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.92ms. Allocated memory is still 224.4MB. Free memory was 127.0MB in the beginning and 125.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 345.94ms. Allocated memory is still 224.4MB. Free memory was 125.5MB in the beginning and 111.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6696.96ms. Allocated memory was 224.4MB in the beginning and 332.4MB in the end (delta: 108.0MB). Free memory was 110.2MB in the beginning and 182.5MB in the end (delta: -72.3MB). Peak memory consumption was 36.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: 99305, independent: 98023, independent conditional: 97813, independent unconditional: 210, dependent: 1282, dependent conditional: 1282, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 99207, independent: 98023, independent conditional: 97813, independent unconditional: 210, dependent: 1184, dependent conditional: 1184, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99207, independent: 98023, independent conditional: 97813, independent unconditional: 210, dependent: 1184, dependent conditional: 1184, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99207, independent: 98023, independent conditional: 97813, independent unconditional: 210, dependent: 1184, dependent conditional: 1184, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101980, independent: 98023, independent conditional: 46454, independent unconditional: 51569, dependent: 3957, dependent conditional: 2766, dependent unconditional: 1191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101980, independent: 98023, independent conditional: 19458, independent unconditional: 78565, dependent: 3957, dependent conditional: 921, dependent unconditional: 3036, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101980, independent: 98023, independent conditional: 19458, independent unconditional: 78565, dependent: 3957, dependent conditional: 921, dependent unconditional: 3036, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1045, independent: 1023, independent conditional: 174, independent unconditional: 849, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1045, independent: 1004, independent conditional: 0, independent unconditional: 1004, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 41, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 44, dependent conditional: 33, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 101980, independent: 97000, independent conditional: 19284, independent unconditional: 77716, dependent: 3935, dependent conditional: 911, dependent unconditional: 3024, unknown: 1045, unknown conditional: 184, unknown unconditional: 861] , Statistics on independence cache: Total cache size (in pairs): 1045, Positive cache size: 1023, Positive conditional cache size: 174, Positive unconditional cache size: 849, Negative cache size: 22, Negative conditional cache size: 10, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28841, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101980, independent: 98023, independent conditional: 46454, independent unconditional: 51569, dependent: 3957, dependent conditional: 2766, dependent unconditional: 1191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101980, independent: 98023, independent conditional: 19458, independent unconditional: 78565, dependent: 3957, dependent conditional: 921, dependent unconditional: 3036, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101980, independent: 98023, independent conditional: 19458, independent unconditional: 78565, dependent: 3957, dependent conditional: 921, dependent unconditional: 3036, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1045, independent: 1023, independent conditional: 174, independent unconditional: 849, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1045, independent: 1004, independent conditional: 0, independent unconditional: 1004, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 41, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 44, dependent conditional: 33, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 101980, independent: 97000, independent conditional: 19284, independent unconditional: 77716, dependent: 3935, dependent conditional: 911, dependent unconditional: 3024, unknown: 1045, unknown conditional: 184, unknown unconditional: 861] , Statistics on independence cache: Total cache size (in pairs): 1045, Positive cache size: 1023, Positive conditional cache size: 174, Positive unconditional cache size: 849, Negative cache size: 22, Negative conditional cache size: 10, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28841 ], Independence queries for same thread: 98 - 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, 114 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 5.6s, 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: 24, 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, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 615 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: 3.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 71, ConditionalCommutativityTraceChecks: 27, 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:43:18,100 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:43:18,289 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...