/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 RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 12:59:51,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 12:59:51,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 12:59:51,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 12:59:51,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 12:59:51,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 12:59:51,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 12:59:51,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 12:59:51,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 12:59:51,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 12:59:51,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 12:59:51,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 12:59:51,743 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 12:59:51,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 12:59:51,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 12:59:51,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 12:59:51,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 12:59:51,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 12:59:51,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 12:59:51,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 12:59:51,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 12:59:51,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 12:59:51,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 12:59:51,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 12:59:51,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 12:59:51,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 12:59:51,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 12:59:51,751 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 12:59:51,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 12:59:51,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 12:59:51,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 12:59:51,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 12:59:51,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 12:59:51,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 12:59:51,752 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 12:59:51,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 12:59:51,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 12:59:51,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 12:59:51,753 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 12:59:51,754 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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 12:59:52,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 12:59:52,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 12:59:52,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 12:59:52,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 12:59:52,065 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 12:59:52,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 12:59:53,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 12:59:53,573 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 12:59:53,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 12:59:53,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3b16a7dc1/4566a139015644de9b347a8b66400a90/FLAG4bdd3f0f4 [2024-05-07 12:59:53,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3b16a7dc1/4566a139015644de9b347a8b66400a90 [2024-05-07 12:59:53,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 12:59:53,602 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 12:59:53,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 12:59:53,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 12:59:53,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 12:59:53,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:59:53" (1/1) ... [2024-05-07 12:59:53,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2a468f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:53, skipping insertion in model container [2024-05-07 12:59:53,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:59:53" (1/1) ... [2024-05-07 12:59:53,657 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 12:59:53,796 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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 12:59:53,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 12:59:53,958 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 12:59:53,971 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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 12:59:54,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 12:59:54,084 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 12:59:54,084 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 12:59:54,109 INFO L206 MainTranslator]: Completed translation [2024-05-07 12:59:54,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54 WrapperNode [2024-05-07 12:59:54,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 12:59:54,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 12:59:54,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 12:59:54,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 12:59:54,124 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:59:54" (1/1) ... [2024-05-07 12:59:54,135 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:59:54" (1/1) ... [2024-05-07 12:59:54,154 INFO L138 Inliner]: procedures = 177, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2024-05-07 12:59:54,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 12:59:54,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 12:59:54,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 12:59:54,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 12:59:54,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 12:59:54,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 12:59:54,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 12:59:54,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 12:59:54,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (1/1) ... [2024-05-07 12:59:54,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 12:59:54,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 12:59:54,227 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 12:59:54,228 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 12:59:54,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 12:59:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 12:59:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 12:59:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 12:59:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 12:59:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 12:59:54,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 12:59:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 12:59:54,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 12:59:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 12:59:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 12:59:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-07 12:59:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-07 12:59:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 12:59:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 12:59:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 12:59:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 12:59:54,272 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 12:59:54,396 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 12:59:54,398 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 12:59:54,556 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 12:59:54,569 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 12:59:54,570 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 12:59:54,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:59:54 BoogieIcfgContainer [2024-05-07 12:59:54,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 12:59:54,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 12:59:54,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 12:59:54,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 12:59:54,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:59:53" (1/3) ... [2024-05-07 12:59:54,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e26aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:59:54, skipping insertion in model container [2024-05-07 12:59:54,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:59:54" (2/3) ... [2024-05-07 12:59:54,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e26aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:59:54, skipping insertion in model container [2024-05-07 12:59:54,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:59:54" (3/3) ... [2024-05-07 12:59:54,579 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 12:59:54,584 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 12:59:54,592 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 12:59:54,592 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 12:59:54,592 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 12:59:54,647 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 12:59:54,692 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 12:59:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 12:59:54,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 12:59:54,700 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 12:59:54,708 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 12:59:54,741 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 12:59:54,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:59:54,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 12:59:54,761 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;@35659ee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 12:59:54,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 12:59:54,826 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 2 more)] === [2024-05-07 12:59:54,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:59:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1239798002, now seen corresponding path program 1 times [2024-05-07 12:59:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:59:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419858087] [2024-05-07 12:59:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:55,196 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 12:59:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:59:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419858087] [2024-05-07 12:59:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419858087] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:59:55,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:59:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 12:59:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179045970] [2024-05-07 12:59:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:59:55,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 12:59:55,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:59:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 12:59:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 12:59:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:55,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:59:55,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 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 12:59:55,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:55,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 12:59:55,293 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 2 more)] === [2024-05-07 12:59:55,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:59:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1337068274, now seen corresponding path program 1 times [2024-05-07 12:59:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:59:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826470608] [2024-05-07 12:59:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:55,916 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 12:59:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:59:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826470608] [2024-05-07 12:59:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826470608] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:59:55,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:59:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 12:59:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481796211] [2024-05-07 12:59:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:59:55,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 12:59:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:59:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 12:59:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 12:59:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:55,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:59:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 12:59:55,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:55,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:59:56,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 12:59:56,185 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 2 more)] === [2024-05-07 12:59:56,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:59:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -357702385, now seen corresponding path program 1 times [2024-05-07 12:59:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:59:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991439980] [2024-05-07 12:59:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:56,564 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 12:59:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:59:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991439980] [2024-05-07 12:59:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991439980] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:59:56,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:59:56,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 12:59:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841575514] [2024-05-07 12:59:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:59:56,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 12:59:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:59:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 12:59:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 12:59:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:56,569 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:59:56,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 12:59:56,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:56,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:59:56,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:59:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 226004022, now seen corresponding path program 1 times [2024-05-07 12:59:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:56,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1277783747, now seen corresponding path program 1 times [2024-05-07 12:59:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:57,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1436211211, now seen corresponding path program 1 times [2024-05-07 12:59:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:57,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash 472879834, now seen corresponding path program 1 times [2024-05-07 12:59:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:57,621 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 12:59:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:57,706 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 12:59:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 12:59:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-07 12:59:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1436211211, now seen corresponding path program 2 times [2024-05-07 12:59:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:58,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -895905415, now seen corresponding path program 1 times [2024-05-07 12:59:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:58,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash -344129233, now seen corresponding path program 1 times [2024-05-07 12:59:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:58,707 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 12:59:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:58,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:59:58,889 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 12:59:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 12:59:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-07 12:59:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1277783747, now seen corresponding path program 2 times [2024-05-07 12:59:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1436211211, now seen corresponding path program 3 times [2024-05-07 12:59:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash -895905415, now seen corresponding path program 2 times [2024-05-07 12:59:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1079478541, now seen corresponding path program 1 times [2024-05-07 12:59:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1816324107, now seen corresponding path program 1 times [2024-05-07 12:59:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:59:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:59:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:59:59,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:59:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash 197138502, now seen corresponding path program 1 times [2024-05-07 13:00:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1240566669, now seen corresponding path program 1 times [2024-05-07 13:00:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -490120826, now seen corresponding path program 1 times [2024-05-07 13:00:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -970176983, now seen corresponding path program 1 times [2024-05-07 13:00:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:01,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2109505955, now seen corresponding path program 1 times [2024-05-07 13:00:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:01,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1594519450, now seen corresponding path program 1 times [2024-05-07 13:00:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:01,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 468384286, now seen corresponding path program 1 times [2024-05-07 13:00:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:04,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1620866760, now seen corresponding path program 1 times [2024-05-07 13:00:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:07,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:08,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-07 13:00:08,341 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 2 more)] === [2024-05-07 13:00:08,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 13:00:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash 334138802, now seen corresponding path program 1 times [2024-05-07 13:00:08,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 13:00:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137910534] [2024-05-07 13:00:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:08,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 13:00:08,617 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 13:00:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 13:00:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137910534] [2024-05-07 13:00:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137910534] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 13:00:08,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 13:00:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 13:00:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297338610] [2024-05-07 13:00:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 13:00:08,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 13:00:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 13:00:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 13:00:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 13:00:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:08,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 13:00:08,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 13:00:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1441487575, now seen corresponding path program 1 times [2024-05-07 13:00:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:09,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1718061922, now seen corresponding path program 2 times [2024-05-07 13:00:11,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:11,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:11,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash -174102312, now seen corresponding path program 1 times [2024-05-07 13:00:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:11,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash 897622944, now seen corresponding path program 1 times [2024-05-07 13:00:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:12,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2065282502, now seen corresponding path program 1 times [2024-05-07 13:00:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:14,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 13:00:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 13:00:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:14,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 13:00:14,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 13:00:14,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 13:00:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1157872488, now seen corresponding path program 2 times [2024-05-07 13:00:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 13:00:14,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604848909] [2024-05-07 13:00:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 13:00:15,131 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 13:00:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 13:00:15,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604848909] [2024-05-07 13:00:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604848909] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 13:00:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 13:00:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 13:00:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234224147] [2024-05-07 13:00:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 13:00:15,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 13:00:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 13:00:15,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 13:00:15,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 13:00:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:15,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 13:00:15,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 13:00:15,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:15,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:15,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:15,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:15,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:24,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-07 13:00:24,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 13:00:24,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 13:00:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 266743678, now seen corresponding path program 3 times [2024-05-07 13:00:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 13:00:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542783775] [2024-05-07 13:00:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 13:00:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 13:00:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 13:00:24,336 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 13:00:24,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 13:00:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542783775] [2024-05-07 13:00:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542783775] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 13:00:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 13:00:24,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 13:00:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823000039] [2024-05-07 13:00:24,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 13:00:24,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 13:00:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 13:00:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 13:00:24,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 13:00:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:24,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 13:00:24,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 13:00:24,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:24,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:24,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:24,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:24,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:24,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 13:00:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 13:00:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 13:00:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 13:00:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 13:00:38,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 13:00:38,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-07 13:00:38,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 13:00:38,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 13:00:38,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-07 13:00:38,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-07 13:00:38,618 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 13:00:38,620 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 13:00:38,621 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 13:00:38,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 01:00:38 BasicIcfg [2024-05-07 13:00:38,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 13:00:38,625 INFO L158 Benchmark]: Toolchain (without parser) took 45023.11ms. Allocated memory was 162.5MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 99.5MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 353.0MB. Max. memory is 8.0GB. [2024-05-07 13:00:38,625 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 162.5MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 13:00:38,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.49ms. Allocated memory is still 162.5MB. Free memory was 99.4MB in the beginning and 134.5MB in the end (delta: -35.1MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2024-05-07 13:00:38,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.82ms. Allocated memory is still 162.5MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 13:00:38,626 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 162.5MB. Free memory was 132.4MB in the beginning and 130.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 13:00:38,626 INFO L158 Benchmark]: RCFGBuilder took 392.67ms. Allocated memory is still 162.5MB. Free memory was 130.8MB in the beginning and 115.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-07 13:00:38,626 INFO L158 Benchmark]: TraceAbstraction took 44050.57ms. Allocated memory was 162.5MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 114.0MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 367.8MB. Max. memory is 8.0GB. [2024-05-07 13:00:38,628 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 162.5MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.49ms. Allocated memory is still 162.5MB. Free memory was 99.4MB in the beginning and 134.5MB in the end (delta: -35.1MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.82ms. Allocated memory is still 162.5MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 162.5MB. Free memory was 132.4MB in the beginning and 130.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 392.67ms. Allocated memory is still 162.5MB. Free memory was 130.8MB in the beginning and 115.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 44050.57ms. Allocated memory was 162.5MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 114.0MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 367.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2880542, independent: 2856004, independent conditional: 2855753, independent unconditional: 251, dependent: 24538, dependent conditional: 24538, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2879522, independent: 2856004, independent conditional: 2855753, independent unconditional: 251, dependent: 23518, dependent conditional: 23518, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2879522, independent: 2856004, independent conditional: 2855753, independent unconditional: 251, dependent: 23518, dependent conditional: 23518, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2879522, independent: 2856004, independent conditional: 2855753, independent unconditional: 251, dependent: 23518, dependent conditional: 23518, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2960031, independent: 2856004, independent conditional: 1386380, independent unconditional: 1469624, dependent: 104027, dependent conditional: 80511, dependent unconditional: 23516, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2960031, independent: 2856004, independent conditional: 521340, independent unconditional: 2334664, dependent: 104027, dependent conditional: 30741, dependent unconditional: 73286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2960031, independent: 2856004, independent conditional: 521340, independent unconditional: 2334664, dependent: 104027, dependent conditional: 30741, dependent unconditional: 73286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1828, independent: 1796, independent conditional: 274, independent unconditional: 1522, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1755, independent conditional: 0, independent unconditional: 1755, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 54, independent conditional: 46, independent unconditional: 8, dependent: 75, dependent conditional: 47, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2960031, independent: 2854208, independent conditional: 521066, independent unconditional: 2333142, dependent: 103995, dependent conditional: 30724, dependent unconditional: 73271, unknown: 1828, unknown conditional: 291, unknown unconditional: 1537] , Statistics on independence cache: Total cache size (in pairs): 1828, Positive cache size: 1796, Positive conditional cache size: 274, Positive unconditional cache size: 1522, Negative cache size: 32, Negative conditional cache size: 17, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 914810, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2960031, independent: 2856004, independent conditional: 1386380, independent unconditional: 1469624, dependent: 104027, dependent conditional: 80511, dependent unconditional: 23516, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2960031, independent: 2856004, independent conditional: 521340, independent unconditional: 2334664, dependent: 104027, dependent conditional: 30741, dependent unconditional: 73286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2960031, independent: 2856004, independent conditional: 521340, independent unconditional: 2334664, dependent: 104027, dependent conditional: 30741, dependent unconditional: 73286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1828, independent: 1796, independent conditional: 274, independent unconditional: 1522, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1755, independent conditional: 0, independent unconditional: 1755, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 54, independent conditional: 46, independent unconditional: 8, dependent: 75, dependent conditional: 47, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2960031, independent: 2854208, independent conditional: 521066, independent unconditional: 2333142, dependent: 103995, dependent conditional: 30724, dependent unconditional: 73271, unknown: 1828, unknown conditional: 291, unknown unconditional: 1537] , Statistics on independence cache: Total cache size (in pairs): 1828, Positive cache size: 1796, Positive conditional cache size: 274, Positive unconditional cache size: 1522, Negative cache size: 32, Negative conditional cache size: 17, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 914810 ], Independence queries for same thread: 1020 - 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 9 procedures, 147 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 43.9s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 41.8s, 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: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 2242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 11.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 90, ConditionalCommutativityTraceChecks: 25, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 13:00:38,651 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 13:00:38,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...