/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 21:21:45,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 21:21:45,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 21:21:45,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 21:21:45,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 21:21:45,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 21:21:45,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 21:21:45,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 21:21:45,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 21:21:45,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 21:21:45,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 21:21:45,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 21:21:45,326 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 21:21:45,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 21:21:45,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 21:21:45,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 21:21:45,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 21:21:45,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 21:21:45,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 21:21:45,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 21:21:45,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 21:21:45,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 21:21:45,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 21:21:45,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 21:21:45,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 21:21:45,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 21:21:45,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 21:21:45,330 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 21:21:45,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 21:21:45,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:21:45,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 21:21:45,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 21:21:45,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 21:21:45,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 21:21:45,332 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 21:21:45,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 21:21:45,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 21:21:45,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 21:21:45,332 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 21:21:45,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 21:21:45,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 21:21:45,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 21:21:45,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 21:21:45,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 21:21:45,558 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 21:21:45,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2024-05-07 21:21:46,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 21:21:46,848 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 21:21:46,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2024-05-07 21:21:46,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/dc26b277f/daa4f216b5c748ccac524c376ca320bb/FLAGf824cd571 [2024-05-07 21:21:46,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/dc26b277f/daa4f216b5c748ccac524c376ca320bb [2024-05-07 21:21:46,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 21:21:46,874 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 21:21:46,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 21:21:46,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 21:21:46,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 21:21:46,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:21:46" (1/1) ... [2024-05-07 21:21:46,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddbd045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:46, skipping insertion in model container [2024-05-07 21:21:46,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:21:46" (1/1) ... [2024-05-07 21:21:46,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 21:21:47,039 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/safe005_tso.i[945,958] [2024-05-07 21:21:47,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:21:47,156 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 21:21:47,168 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/safe005_tso.i[945,958] [2024-05-07 21:21:47,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:21:47,228 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 21:21:47,228 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 21:21:47,235 INFO L206 MainTranslator]: Completed translation [2024-05-07 21:21:47,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47 WrapperNode [2024-05-07 21:21:47,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 21:21:47,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 21:21:47,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 21:21:47,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 21:21:47,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,296 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-05-07 21:21:47,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 21:21:47,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 21:21:47,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 21:21:47,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 21:21:47,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 21:21:47,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 21:21:47,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 21:21:47,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 21:21:47,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (1/1) ... [2024-05-07 21:21:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:21:47,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:21:47,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 21:21:47,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 21:21:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 21:21:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 21:21:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 21:21:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 21:21:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 21:21:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 21:21:47,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 21:21:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 21:21:47,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 21:21:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 21:21:47,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 21:21:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 21:21:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 21:21:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 21:21:47,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 21:21:47,443 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 21:21:47,542 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 21:21:47,544 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 21:21:47,663 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 21:21:47,675 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 21:21:47,675 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 21:21:47,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:21:47 BoogieIcfgContainer [2024-05-07 21:21:47,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 21:21:47,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 21:21:47,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 21:21:47,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 21:21:47,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 09:21:46" (1/3) ... [2024-05-07 21:21:47,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc1a64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:21:47, skipping insertion in model container [2024-05-07 21:21:47,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:21:47" (2/3) ... [2024-05-07 21:21:47,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc1a64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:21:47, skipping insertion in model container [2024-05-07 21:21:47,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:21:47" (3/3) ... [2024-05-07 21:21:47,684 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_tso.i [2024-05-07 21:21:47,690 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 21:21:47,697 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 21:21:47,697 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 21:21:47,697 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 21:21:47,758 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 21:21:47,803 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 21:21:47,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 21:21:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:21:47,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 21:21:47,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 21:21:47,840 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 21:21:47,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:21:47,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 21:21:47,863 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;@1ce1d127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 21:21:47,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 21:21:47,922 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 21:21:47,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:21:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 992972723, now seen corresponding path program 1 times [2024-05-07 21:21:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:21:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320920617] [2024-05-07 21:21:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:21:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:21:48,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:21:48,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320920617] [2024-05-07 21:21:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320920617] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:21:48,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:21:48,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 21:21:48,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729348697] [2024-05-07 21:21:48,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:21:48,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 21:21:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:21:48,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 21:21:48,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 21:21:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:48,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:21:48,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 21:21:48,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:48,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 21:21:48,317 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 21:21:48,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:21:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash 294575345, now seen corresponding path program 1 times [2024-05-07 21:21:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:21:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197551447] [2024-05-07 21:21:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:21:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:21:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:21:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197551447] [2024-05-07 21:21:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197551447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:21:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:21:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 21:21:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54972508] [2024-05-07 21:21:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:21:48,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 21:21:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:21:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 21:21:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 21:21:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:48,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:21:48,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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 21:21:48,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:48,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -300365394, now seen corresponding path program 1 times [2024-05-07 21:21:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:21:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:21:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:21:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:21:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 21:21:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 21:21:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash -231044696, now seen corresponding path program 1 times [2024-05-07 21:21:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:49,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 21:21:49,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 21:21:49,727 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 21:21:49,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:21:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1389294644, now seen corresponding path program 1 times [2024-05-07 21:21:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:21:49,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033101697] [2024-05-07 21:21:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:21:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 21:21:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:21:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033101697] [2024-05-07 21:21:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033101697] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:21:49,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:21:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 21:21:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181919581] [2024-05-07 21:21:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:21:49,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 21:21:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:21:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -231044696, now seen corresponding path program 2 times [2024-05-07 21:21:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 21:21:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-07 21:21:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:50,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:21:50,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 21:21:50,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:50,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-07 21:21:50,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -231044696, now seen corresponding path program 3 times [2024-05-07 21:21:50,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 35289605, now seen corresponding path program 1 times [2024-05-07 21:21:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1285372599, now seen corresponding path program 1 times [2024-05-07 21:21:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:50,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -514352988, now seen corresponding path program 1 times [2024-05-07 21:21:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash -986422990, now seen corresponding path program 1 times [2024-05-07 21:21:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1769297975, now seen corresponding path program 1 times [2024-05-07 21:21:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash 57076851, now seen corresponding path program 1 times [2024-05-07 21:21:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash -552348083, now seen corresponding path program 1 times [2024-05-07 21:21:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1818931050, now seen corresponding path program 1 times [2024-05-07 21:21:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash 356968284, now seen corresponding path program 1 times [2024-05-07 21:21:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1396989445, now seen corresponding path program 1 times [2024-05-07 21:21:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1748472484, now seen corresponding path program 1 times [2024-05-07 21:21:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1467618682, now seen corresponding path program 1 times [2024-05-07 21:21:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash -922486033, now seen corresponding path program 1 times [2024-05-07 21:21:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1969417541, now seen corresponding path program 1 times [2024-05-07 21:21:54,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1864644859, now seen corresponding path program 1 times [2024-05-07 21:21:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:54,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash 355494110, now seen corresponding path program 1 times [2024-05-07 21:21:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1396942356, now seen corresponding path program 1 times [2024-05-07 21:21:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1478956979, now seen corresponding path program 1 times [2024-05-07 21:21:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash -386566400, now seen corresponding path program 1 times [2024-05-07 21:21:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 126089006, now seen corresponding path program 1 times [2024-05-07 21:21:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1104225715, now seen corresponding path program 1 times [2024-05-07 21:21:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash -451177587, now seen corresponding path program 1 times [2024-05-07 21:21:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1122930825, now seen corresponding path program 1 times [2024-05-07 21:21:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 240931658, now seen corresponding path program 1 times [2024-05-07 21:21:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1393291464, now seen corresponding path program 1 times [2024-05-07 21:21:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1756138693, now seen corresponding path program 1 times [2024-05-07 21:21:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1040041303, now seen corresponding path program 1 times [2024-05-07 21:21:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1419011483, now seen corresponding path program 1 times [2024-05-07 21:21:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2008415757, now seen corresponding path program 1 times [2024-05-07 21:21:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:55,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1599921293, now seen corresponding path program 1 times [2024-05-07 21:21:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1714395101, now seen corresponding path program 1 times [2024-05-07 21:21:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 232904631, now seen corresponding path program 1 times [2024-05-07 21:21:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:21:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:21:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:21:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:21:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:21:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 21:21:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 21:21:56,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 21:21:56,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 21:21:56,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 21:21:56,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 21:21:56,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 21:21:56,317 INFO L448 BasicCegarLoop]: Path program histogram: [3, 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 21:21:56,329 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 21:21:56,329 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 21:21:56,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 09:21:56 BasicIcfg [2024-05-07 21:21:56,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 21:21:56,333 INFO L158 Benchmark]: Toolchain (without parser) took 9458.85ms. Allocated memory was 162.5MB in the beginning and 389.0MB in the end (delta: 226.5MB). Free memory was 97.5MB in the beginning and 175.4MB in the end (delta: -77.9MB). Peak memory consumption was 149.2MB. Max. memory is 8.0GB. [2024-05-07 21:21:56,336 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 21:21:56,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.11ms. Allocated memory is still 162.5MB. Free memory was 97.3MB in the beginning and 76.6MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-07 21:21:56,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.76ms. Allocated memory is still 162.5MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 21:21:56,337 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 162.5MB. Free memory was 74.5MB in the beginning and 138.9MB in the end (delta: -64.3MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2024-05-07 21:21:56,337 INFO L158 Benchmark]: RCFGBuilder took 342.16ms. Allocated memory is still 162.5MB. Free memory was 138.9MB in the beginning and 124.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 21:21:56,339 INFO L158 Benchmark]: TraceAbstraction took 8654.12ms. Allocated memory was 162.5MB in the beginning and 389.0MB in the end (delta: 226.5MB). Free memory was 123.1MB in the beginning and 175.4MB in the end (delta: -52.2MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. [2024-05-07 21:21:56,340 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 162.5MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 365.11ms. Allocated memory is still 162.5MB. Free memory was 97.3MB in the beginning and 76.6MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.76ms. Allocated memory is still 162.5MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 162.5MB. Free memory was 74.5MB in the beginning and 138.9MB in the end (delta: -64.3MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * RCFGBuilder took 342.16ms. Allocated memory is still 162.5MB. Free memory was 138.9MB in the beginning and 124.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8654.12ms. Allocated memory was 162.5MB in the beginning and 389.0MB in the end (delta: 226.5MB). Free memory was 123.1MB in the beginning and 175.4MB in the end (delta: -52.2MB). Peak memory consumption was 174.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: 57289, independent: 56372, independent conditional: 56117, independent unconditional: 255, dependent: 917, dependent conditional: 917, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57267, independent: 56372, independent conditional: 56117, independent unconditional: 255, dependent: 895, dependent conditional: 895, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57267, independent: 56372, independent conditional: 56117, independent unconditional: 255, dependent: 895, dependent conditional: 895, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57267, independent: 56372, independent conditional: 56117, independent unconditional: 255, dependent: 895, dependent conditional: 895, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59388, independent: 56372, independent conditional: 26872, independent unconditional: 29500, dependent: 3016, dependent conditional: 2113, dependent unconditional: 903, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59388, independent: 56372, independent conditional: 13335, independent unconditional: 43037, dependent: 3016, dependent conditional: 881, dependent unconditional: 2135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59388, independent: 56372, independent conditional: 13335, independent unconditional: 43037, dependent: 3016, dependent conditional: 881, dependent unconditional: 2135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1071, independent: 1037, independent conditional: 227, independent unconditional: 810, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1071, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 20, independent conditional: 17, independent unconditional: 3, dependent: 110, dependent conditional: 97, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 59388, independent: 55335, independent conditional: 13108, independent unconditional: 42227, dependent: 2982, dependent conditional: 861, dependent unconditional: 2121, unknown: 1071, unknown conditional: 247, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 1037, Positive conditional cache size: 227, Positive unconditional cache size: 810, Negative cache size: 34, Negative conditional cache size: 20, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14769, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59388, independent: 56372, independent conditional: 26872, independent unconditional: 29500, dependent: 3016, dependent conditional: 2113, dependent unconditional: 903, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59388, independent: 56372, independent conditional: 13335, independent unconditional: 43037, dependent: 3016, dependent conditional: 881, dependent unconditional: 2135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59388, independent: 56372, independent conditional: 13335, independent unconditional: 43037, dependent: 3016, dependent conditional: 881, dependent unconditional: 2135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1071, independent: 1037, independent conditional: 227, independent unconditional: 810, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1071, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 20, independent conditional: 17, independent unconditional: 3, dependent: 110, dependent conditional: 97, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 59388, independent: 55335, independent conditional: 13108, independent unconditional: 42227, dependent: 2982, dependent conditional: 861, dependent unconditional: 2121, unknown: 1071, unknown conditional: 247, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 1037, Positive conditional cache size: 227, Positive unconditional cache size: 810, Negative cache size: 34, Negative conditional cache size: 20, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14769 ], Independence queries for same thread: 22 - 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, 120 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, 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: 20, 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.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: 6.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 101, ConditionalCommutativityTraceChecks: 36, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 21:21:56,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-07 21:21:56,561 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...