/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-04 21:39:27,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 21:39:27,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 21:39:27,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 21:39:27,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 21:39:27,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 21:39:27,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 21:39:27,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 21:39:27,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 21:39:27,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 21:39:27,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 21:39:27,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 21:39:27,800 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 21:39:27,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 21:39:27,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 21:39:27,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 21:39:27,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 21:39:27,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 21:39:27,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 21:39:27,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 21:39:27,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 21:39:27,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 21:39:27,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 21:39:27,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 21:39:27,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 21:39:27,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 21:39:27,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 21:39:27,804 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 21:39:27,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 21:39:27,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 21:39:27,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 21:39:27,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 21:39:27,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 21:39:27,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 21:39:27,805 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 21:39:27,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 21:39:27,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 21:39:27,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 21:39:27,806 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 21:39:27,806 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-05-04 21:39:28,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 21:39:28,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 21:39:28,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 21:39:28,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-04 21:39:28,029 INFO L274 PluginConnector]: CDTParser initialized [2024-05-04 21:39:28,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2024-05-04 21:39:29,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-04 21:39:29,347 INFO L384 CDTParser]: Found 1 translation units. [2024-05-04 21:39:29,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2024-05-04 21:39:29,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6da9e628e/2a91436133704f4497d5d63525f4fb1d/FLAG61b1005b8 [2024-05-04 21:39:29,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6da9e628e/2a91436133704f4497d5d63525f4fb1d [2024-05-04 21:39:29,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 21:39:29,373 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-04 21:39:29,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-04 21:39:29,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-04 21:39:29,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-04 21:39:29,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdbc213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29, skipping insertion in model container [2024-05-04 21:39:29,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,423 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-04 21:39:29,726 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/stack-2.i[41520,41533] [2024-05-04 21:39:29,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 21:39:29,769 INFO L202 MainTranslator]: Completed pre-run [2024-05-04 21:39:29,808 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/stack-2.i[41520,41533] [2024-05-04 21:39:29,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 21:39:29,891 INFO L206 MainTranslator]: Completed translation [2024-05-04 21:39:29,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29 WrapperNode [2024-05-04 21:39:29,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-04 21:39:29,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 21:39:29,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 21:39:29,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 21:39:29,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,957 INFO L138 Inliner]: procedures = 278, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 165 [2024-05-04 21:39:29,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 21:39:29,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 21:39:29,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 21:39:29,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 21:39:29,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:29,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:30,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 21:39:30,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 21:39:30,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 21:39:30,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 21:39:30,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (1/1) ... [2024-05-04 21:39:30,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 21:39:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:39:30,051 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-04 21:39:30,065 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-04 21:39:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-04 21:39:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-04 21:39:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-04 21:39:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-04 21:39:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-04 21:39:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-04 21:39:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-04 21:39:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-04 21:39:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-04 21:39:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-04 21:39:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-04 21:39:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-04 21:39:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 21:39:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 21:39:30,104 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 21:39:30,250 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 21:39:30,252 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 21:39:30,491 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 21:39:30,506 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 21:39:30,506 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-04 21:39:30,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 09:39:30 BoogieIcfgContainer [2024-05-04 21:39:30,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 21:39:30,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 21:39:30,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 21:39:30,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 21:39:30,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 09:39:29" (1/3) ... [2024-05-04 21:39:30,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49966e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 09:39:30, skipping insertion in model container [2024-05-04 21:39:30,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 09:39:29" (2/3) ... [2024-05-04 21:39:30,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49966e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 09:39:30, skipping insertion in model container [2024-05-04 21:39:30,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 09:39:30" (3/3) ... [2024-05-04 21:39:30,519 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-05-04 21:39:30,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 21:39:30,531 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 21:39:30,532 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-04 21:39:30,532 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 21:39:30,610 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-04 21:39:30,640 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 21:39:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 21:39:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:39:30,642 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-04 21:39:30,643 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-04 21:39:30,666 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 21:39:30,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:30,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 21:39:30,679 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;@a33d2ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-04 21:39:30,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-04 21:39:30,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:30,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1427696152, now seen corresponding path program 1 times [2024-05-04 21:39:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646771249] [2024-05-04 21:39:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:30,981 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-04 21:39:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646771249] [2024-05-04 21:39:30,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646771249] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:30,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:30,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-04 21:39:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505195207] [2024-05-04 21:39:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:30,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-04 21:39:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-04 21:39:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-04 21:39:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,029 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:31,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 21:39:31,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-04 21:39:31,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:31,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 679318485, now seen corresponding path program 1 times [2024-05-04 21:39:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:31,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720376906] [2024-05-04 21:39:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:31,291 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-04 21:39:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720376906] [2024-05-04 21:39:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720376906] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 21:39:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499083486] [2024-05-04 21:39:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:31,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-04 21:39:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-04 21:39:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-04 21:39:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:31,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-04 21:39:31,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-04 21:39:31,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:31,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1734215841, now seen corresponding path program 1 times [2024-05-04 21:39:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700425829] [2024-05-04 21:39:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:31,423 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-04 21:39:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700425829] [2024-05-04 21:39:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700425829] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 21:39:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941953420] [2024-05-04 21:39:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:31,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-04 21:39:31,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-04 21:39:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-04 21:39:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,434 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-04 21:39:31,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-04 21:39:31,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:31,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1218905132, now seen corresponding path program 1 times [2024-05-04 21:39:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994680793] [2024-05-04 21:39:31,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:39:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994680793] [2024-05-04 21:39:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994680793] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-04 21:39:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576927845] [2024-05-04 21:39:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:31,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-04 21:39:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 21:39:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-04 21:39:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,629 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:31,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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-04 21:39:31,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:31,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-04 21:39:31,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:31,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 562183636, now seen corresponding path program 1 times [2024-05-04 21:39:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563566832] [2024-05-04 21:39:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:31,893 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-04 21:39:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563566832] [2024-05-04 21:39:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563566832] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-04 21:39:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460969196] [2024-05-04 21:39:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:31,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-04 21:39:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:31,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 21:39:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-04 21:39:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:31,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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-04 21:39:31,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:31,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:31,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-04 21:39:31,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:31,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1028062181, now seen corresponding path program 1 times [2024-05-04 21:39:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117846377] [2024-05-04 21:39:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:33,216 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-04 21:39:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117846377] [2024-05-04 21:39:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117846377] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:33,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-05-04 21:39:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934518691] [2024-05-04 21:39:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:33,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-04 21:39:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:33,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-04 21:39:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-05-04 21:39:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:33,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:33,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 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-04 21:39:33,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:33,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:33,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:33,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:33,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:33,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-04 21:39:34,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-04 21:39:34,678 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:34,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 82825630, now seen corresponding path program 1 times [2024-05-04 21:39:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329283131] [2024-05-04 21:39:34,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-05-04 21:39:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329283131] [2024-05-04 21:39:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329283131] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:39:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794720536] [2024-05-04 21:39:34,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:34,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:39:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:39:34,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:39:34,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-04 21:39:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:35,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-04 21:39:35,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:39:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-04 21:39:35,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:39:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-04 21:39:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794720536] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 21:39:35,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 21:39:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 10 [2024-05-04 21:39:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585039129] [2024-05-04 21:39:35,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 21:39:35,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-04 21:39:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-04 21:39:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-04 21:39:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:35,519 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:35,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.9) internal successors, (209), 10 states have internal predecessors, (209), 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-04 21:39:35,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:35,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:35,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:35,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:35,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:35,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-04 21:39:35,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:35,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-04 21:39:36,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-05-04 21:39:36,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:36,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1585621019, now seen corresponding path program 1 times [2024-05-04 21:39:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558769221] [2024-05-04 21:39:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-05-04 21:39:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558769221] [2024-05-04 21:39:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558769221] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:39:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 21:39:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 21:39:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782554904] [2024-05-04 21:39:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:36,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-04 21:39:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-04 21:39:36,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-04 21:39:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:36,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:36,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:36,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:36,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-04 21:39:36,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:36,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1310656459, now seen corresponding path program 1 times [2024-05-04 21:39:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:36,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730740938] [2024-05-04 21:39:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-05-04 21:39:37,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730740938] [2024-05-04 21:39:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730740938] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:39:37,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590207224] [2024-05-04 21:39:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:37,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:39:37,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:39:37,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:39:37,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-04 21:39:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:37,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 69 conjunts are in the unsatisfiable core [2024-05-04 21:39:38,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:39:39,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-04 21:39:39,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-05-04 21:39:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-05-04 21:39:40,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:39:40,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-05-04 21:39:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-05-04 21:39:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590207224] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-04 21:39:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-04 21:39:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [27, 27] total 70 [2024-05-04 21:39:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300463480] [2024-05-04 21:39:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:39:41,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-04 21:39:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:41,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-04 21:39:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4582, Unknown=0, NotChecked=0, Total=4830 [2024-05-04 21:39:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:41,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:41,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.727272727272727) internal successors, (192), 22 states have internal predecessors, (192), 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-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:41,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:39:44,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-04 21:39:44,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:39:44,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:44,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 417711860, now seen corresponding path program 2 times [2024-05-04 21:39:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743004704] [2024-05-04 21:39:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 96 proven. 69 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-05-04 21:39:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743004704] [2024-05-04 21:39:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743004704] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:39:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597448157] [2024-05-04 21:39:44,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 21:39:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:39:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:39:44,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:39:44,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-04 21:39:44,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 21:39:44,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 21:39:44,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-04 21:39:44,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:39:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 123 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-05-04 21:39:44,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:39:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 123 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-05-04 21:39:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597448157] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 21:39:45,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 21:39:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2024-05-04 21:39:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105620663] [2024-05-04 21:39:45,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 21:39:45,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-04 21:39:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-04 21:39:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-05-04 21:39:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:45,391 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:45,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 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-04 21:39:45,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:45,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:39:45,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:39:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 21:39:45,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-04 21:39:45,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:39:45,901 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:39:45,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:39:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -508002619, now seen corresponding path program 2 times [2024-05-04 21:39:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:39:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875358636] [2024-05-04 21:39:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:39:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:39:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:39:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 42 proven. 174 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-04 21:39:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:39:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875358636] [2024-05-04 21:39:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875358636] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:39:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186557613] [2024-05-04 21:39:47,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 21:39:47,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:39:47,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:39:47,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:39:47,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-04 21:39:48,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 21:39:48,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 21:39:48,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 71 conjunts are in the unsatisfiable core [2024-05-04 21:39:48,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:39:48,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-05-04 21:39:49,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-04 21:39:49,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2024-05-04 21:39:49,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-05-04 21:39:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 127 proven. 89 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-04 21:39:50,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 21:39:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-05-04 21:39:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 154 proven. 62 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-04 21:39:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186557613] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 21:39:52,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 21:39:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 29] total 88 [2024-05-04 21:39:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512327719] [2024-05-04 21:39:52,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 21:39:52,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-05-04 21:39:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:39:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-05-04 21:39:52,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=7349, Unknown=0, NotChecked=0, Total=7656 [2024-05-04 21:39:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:52,072 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:39:52,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 9.068181818181818) internal successors, (798), 88 states have internal predecessors, (798), 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-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 21:39:52,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-04 21:40:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2024-05-04 21:40:06,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-04 21:40:06,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-04 21:40:06,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:40:06,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:40:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash 201329716, now seen corresponding path program 1 times [2024-05-04 21:40:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:40:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526811958] [2024-05-04 21:40:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:40:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:40:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:40:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 245 proven. 1297 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-05-04 21:40:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:40:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526811958] [2024-05-04 21:40:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526811958] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:40:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743430673] [2024-05-04 21:40:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:40:07,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:40:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:40:07,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:40:07,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-04 21:40:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:40:07,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-04 21:40:07,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:40:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 1854 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-05-04 21:40:08,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-04 21:40:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743430673] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:40:08,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-04 21:40:08,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2024-05-04 21:40:08,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600257956] [2024-05-04 21:40:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:40:08,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-04 21:40:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:40:08,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-04 21:40:08,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-05-04 21:40:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:08,441 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:40:08,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.23076923076923) internal successors, (497), 13 states have internal predecessors, (497), 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-04 21:40:08,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:08,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:08,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 153 states. [2024-05-04 21:40:08,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:40:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:40:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:40:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:40:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:40:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-04 21:40:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2024-05-04 21:40:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-04 21:40:08,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-04 21:40:09,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-05-04 21:40:09,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:40:09,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:40:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1661272027, now seen corresponding path program 1 times [2024-05-04 21:40:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:40:09,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857456621] [2024-05-04 21:40:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:40:09,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:40:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:40:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 577 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:40:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 21:40:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857456621] [2024-05-04 21:40:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857456621] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 21:40:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236596482] [2024-05-04 21:40:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:40:09,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 21:40:09,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 21:40:09,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 21:40:09,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-04 21:40:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 21:40:09,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-04 21:40:09,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 21:40:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 21:40:10,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-04 21:40:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236596482] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 21:40:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-04 21:40:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2024-05-04 21:40:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433498459] [2024-05-04 21:40:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 21:40:10,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-04 21:40:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 21:40:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-04 21:40:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-05-04 21:40:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:10,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 21:40:10,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 states have internal predecessors, (476), 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-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:40:10,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:40:10,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:10,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:40:10,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-04 21:40:10,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states. [2024-05-04 21:40:10,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-04 21:40:10,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-04 21:40:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-04 21:40:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2024-05-04 21:40:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-04 21:40:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-04 21:40:10,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-04 21:40:11,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-04 21:40:11,121 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-04 21:40:11,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 21:40:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1236066170, now seen corresponding path program 3 times [2024-05-04 21:40:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 21:40:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270079368] [2024-05-04 21:40:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 21:40:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 21:40:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 21:40:11,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 21:40:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 21:40:11,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-04 21:40:11,408 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-04 21:40:11,408 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-04 21:40:11,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-05-04 21:40:11,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-04 21:40:11,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-05-04 21:40:11,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-04 21:40:11,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-04 21:40:11,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-04 21:40:11,414 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-04 21:40:11,419 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 21:40:11,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 21:40:11,535 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated [2024-05-04 21:40:11,537 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated [2024-05-04 21:40:11,538 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2024-05-04 21:40:11,542 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated [2024-05-04 21:40:11,544 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated [2024-05-04 21:40:11,544 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated [2024-05-04 21:40:11,545 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated [2024-05-04 21:40:11,548 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,548 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,548 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,548 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,549 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated [2024-05-04 21:40:11,550 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated [2024-05-04 21:40:11,551 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated [2024-05-04 21:40:11,551 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated [2024-05-04 21:40:11,552 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated [2024-05-04 21:40:11,553 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,553 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,553 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,553 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,553 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated [2024-05-04 21:40:11,555 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated [2024-05-04 21:40:11,556 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated [2024-05-04 21:40:11,556 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated [2024-05-04 21:40:11,557 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated [2024-05-04 21:40:11,558 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,558 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,558 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,558 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,558 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated [2024-05-04 21:40:11,559 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated [2024-05-04 21:40:11,560 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated [2024-05-04 21:40:11,560 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated [2024-05-04 21:40:11,561 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated [2024-05-04 21:40:11,561 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,561 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,561 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated [2024-05-04 21:40:11,561 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2024-05-04 21:40:11,561 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated [2024-05-04 21:40:11,562 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated [2024-05-04 21:40:11,563 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated [2024-05-04 21:40:11,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 09:40:11 BasicIcfg [2024-05-04 21:40:11,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 21:40:11,580 INFO L158 Benchmark]: Toolchain (without parser) took 42206.92ms. Allocated memory was 253.8MB in the beginning and 780.1MB in the end (delta: 526.4MB). Free memory was 183.3MB in the beginning and 334.9MB in the end (delta: -151.6MB). Peak memory consumption was 375.8MB. Max. memory is 8.0GB. [2024-05-04 21:40:11,580 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 253.8MB. Free memory is still 221.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 21:40:11,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.62ms. Allocated memory is still 253.8MB. Free memory was 183.0MB in the beginning and 219.8MB in the end (delta: -36.8MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. [2024-05-04 21:40:11,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.64ms. Allocated memory is still 253.8MB. Free memory was 219.8MB in the beginning and 217.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-04 21:40:11,580 INFO L158 Benchmark]: Boogie Preprocessor took 46.36ms. Allocated memory is still 253.8MB. Free memory was 217.3MB in the beginning and 215.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-04 21:40:11,580 INFO L158 Benchmark]: RCFGBuilder took 507.23ms. Allocated memory is still 253.8MB. Free memory was 215.2MB in the beginning and 195.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-04 21:40:11,581 INFO L158 Benchmark]: TraceAbstraction took 41064.36ms. Allocated memory was 253.8MB in the beginning and 780.1MB in the end (delta: 526.4MB). Free memory was 193.7MB in the beginning and 334.9MB in the end (delta: -141.2MB). Peak memory consumption was 384.6MB. Max. memory is 8.0GB. [2024-05-04 21:40:11,582 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 253.8MB. Free memory is still 221.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 512.62ms. Allocated memory is still 253.8MB. Free memory was 183.0MB in the beginning and 219.8MB in the end (delta: -36.8MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.64ms. Allocated memory is still 253.8MB. Free memory was 219.8MB in the beginning and 217.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.36ms. Allocated memory is still 253.8MB. Free memory was 217.3MB in the beginning and 215.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 507.23ms. Allocated memory is still 253.8MB. Free memory was 215.2MB in the beginning and 195.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 41064.36ms. Allocated memory was 253.8MB in the beginning and 780.1MB in the end (delta: 526.4MB). Free memory was 193.7MB in the beginning and 334.9MB in the end (delta: -141.2MB). Peak memory consumption was 384.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15628, independent: 12702, independent conditional: 11894, independent unconditional: 808, dependent: 2926, dependent conditional: 2926, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12709, independent: 12702, independent conditional: 11894, independent unconditional: 808, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12709, independent: 12702, independent conditional: 11894, independent unconditional: 808, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12709, independent: 12702, independent conditional: 11894, independent unconditional: 808, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12760, independent: 12702, independent conditional: 3980, independent unconditional: 8722, dependent: 58, dependent conditional: 44, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12760, independent: 12702, independent conditional: 1755, independent unconditional: 10947, dependent: 58, dependent conditional: 7, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12760, independent: 12702, independent conditional: 1755, independent unconditional: 10947, dependent: 58, dependent conditional: 7, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1171, independent: 1169, independent conditional: 88, independent unconditional: 1081, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1171, independent: 1167, independent conditional: 0, independent unconditional: 1167, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12760, independent: 11533, independent conditional: 1667, independent unconditional: 9866, dependent: 56, dependent conditional: 6, dependent unconditional: 50, unknown: 1171, unknown conditional: 89, unknown unconditional: 1082] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1169, Positive conditional cache size: 88, Positive unconditional cache size: 1081, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2262, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12760, independent: 12702, independent conditional: 3980, independent unconditional: 8722, dependent: 58, dependent conditional: 44, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12760, independent: 12702, independent conditional: 1755, independent unconditional: 10947, dependent: 58, dependent conditional: 7, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12760, independent: 12702, independent conditional: 1755, independent unconditional: 10947, dependent: 58, dependent conditional: 7, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1171, independent: 1169, independent conditional: 88, independent unconditional: 1081, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1171, independent: 1167, independent conditional: 0, independent unconditional: 1167, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12760, independent: 11533, independent conditional: 1667, independent unconditional: 9866, dependent: 56, dependent conditional: 6, dependent unconditional: 50, unknown: 1171, unknown conditional: 89, unknown unconditional: 1082] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1169, Positive conditional cache size: 88, Positive unconditional cache size: 1081, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2262 ], Independence queries for same thread: 2919 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; VAL [top=0] [L936] 0 static unsigned int arr[(5)]; VAL [arr={3:0}, top=0] [L937] 0 pthread_mutex_t m; VAL [arr={3:0}, m={4:0}, top=0] [L938] 0 _Bool flag=(0); VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1021] 0 pthread_t id1, id2; VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, top=0] [L990] 1 int i; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L991] 1 unsigned int tmp; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, top=0] [L1006] 2 int i; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1025] 0 \read(id1) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, tmp=4, top=0] [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=0, m={4:0}, top=0] [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; VAL [\result=0, arr={3:0}, flag=0, m={4:0}, top=0] [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=4, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=4] [L970] CALL 1 inc_top() [L946] 1 top++ VAL [arr={3:0}, flag=0, m={4:0}, top=1] [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(x)=4, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=4] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, tmp=4, top=1] [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=1, arr={3:0}, flag=1, m={4:0}, top=1] [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1] [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L984] 2 return stack[get_top()]; VAL [\result=4, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=0] [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=4, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=3, top=0] [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=1, m={4:0}, top=0] [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=3, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=3] [L970] CALL 1 inc_top() [L946] 1 top++ VAL [arr={3:0}, flag=1, m={4:0}, top=1] [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(x)=3, \result=0, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=3] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=3, top=1] [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=3, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=3, top=1] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=1, arr={3:0}, flag=1, m={4:0}, top=1] [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1] [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L984] 2 return stack[get_top()]; VAL [\result=3, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=3, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=4, top=0] [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=1, m={4:0}, top=0] [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=4, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=4] [L970] CALL 1 inc_top() [L946] 1 top++ VAL [arr={3:0}, flag=1, m={4:0}, top=1] [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(x)=4, \result=0, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=4] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=4, top=1] [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=4, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=1, arr={3:0}, flag=1, m={4:0}, top=1] [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1] [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L984] 2 return stack[get_top()]; VAL [\result=4, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=0] [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=4, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=4, top=0] [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=1, m={4:0}, top=0] [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=4, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=4] [L970] CALL 1 inc_top() [L946] 1 top++ VAL [arr={3:0}, flag=1, m={4:0}, top=1] [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(x)=4, \result=0, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=4] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=4, top=1] [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=4, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=1, arr={3:0}, flag=1, m={4:0}, top=1] [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=1] [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L984] 2 return stack[get_top()]; VAL [\result=4, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=0] [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, tmp=4, top=0] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 VAL [arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L979] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 274 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 40.8s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 20.9s, 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: 354, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 5473 NumberOfCodeBlocks, 5473 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6047 ConstructedInterpolants, 10 QuantifiedInterpolants, 29809 SizeOfPredicates, 114 NumberOfNonLiveVariables, 4342 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 5902/8191 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: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-04 21:40:11,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-04 21:40:11,805 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...