/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 14:56:39,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 14:56:39,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 14:56:39,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 14:56:39,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 14:56:39,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 14:56:39,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 14:56:39,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 14:56:39,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 14:56:39,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 14:56:39,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 14:56:39,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 14:56:39,306 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 14:56:39,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 14:56:39,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 14:56:39,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 14:56:39,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 14:56:39,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 14:56:39,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 14:56:39,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 14:56:39,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 14:56:39,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 14:56:39,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 14:56:39,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 14:56:39,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 14:56:39,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 14:56:39,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 14:56:39,311 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 14:56:39,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 14:56:39,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 14:56:39,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 14:56:39,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 14:56:39,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 14:56:39,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 14:56:39,314 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 14:56:39,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 14:56:39,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 14:56:39,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 14:56:39,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 14:56:39,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 14:56:39,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 14:56:39,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 14:56:39,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 14:56:39,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 14:56:39,646 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 14:56:39,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-05-07 14:56:40,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 14:56:41,058 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 14:56:41,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-05-07 14:56:41,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ed14cf8e9/ac18392a100b46d7a0a828efb96acb8f/FLAG8013f623a [2024-05-07 14:56:41,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ed14cf8e9/ac18392a100b46d7a0a828efb96acb8f [2024-05-07 14:56:41,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 14:56:41,084 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 14:56:41,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 14:56:41,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 14:56:41,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 14:56:41,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587466a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41, skipping insertion in model container [2024-05-07 14:56:41,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,119 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 14:56:41,308 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-05-07 14:56:41,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 14:56:41,323 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 14:56:41,348 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-05-07 14:56:41,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 14:56:41,359 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 14:56:41,359 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 14:56:41,364 INFO L206 MainTranslator]: Completed translation [2024-05-07 14:56:41,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41 WrapperNode [2024-05-07 14:56:41,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 14:56:41,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 14:56:41,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 14:56:41,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 14:56:41,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,408 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 197 [2024-05-07 14:56:41,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 14:56:41,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 14:56:41,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 14:56:41,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 14:56:41,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 14:56:41,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 14:56:41,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 14:56:41,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 14:56:41,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (1/1) ... [2024-05-07 14:56:41,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 14:56:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:56:41,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 14:56:41,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 14:56:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 14:56:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 14:56:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 14:56:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 14:56:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 14:56:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 14:56:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 14:56:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 14:56:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 14:56:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 14:56:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-07 14:56:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 14:56:41,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 14:56:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 14:56:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 14:56:41,535 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 14:56:41,621 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 14:56:41,623 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 14:56:41,908 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 14:56:41,982 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 14:56:41,983 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-07 14:56:41,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 02:56:41 BoogieIcfgContainer [2024-05-07 14:56:41,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 14:56:41,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 14:56:41,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 14:56:41,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 14:56:41,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 02:56:41" (1/3) ... [2024-05-07 14:56:41,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295db29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 02:56:41, skipping insertion in model container [2024-05-07 14:56:41,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:56:41" (2/3) ... [2024-05-07 14:56:41,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295db29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 02:56:41, skipping insertion in model container [2024-05-07 14:56:41,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 02:56:41" (3/3) ... [2024-05-07 14:56:41,993 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-05-07 14:56:42,001 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 14:56:42,011 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 14:56:42,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 14:56:42,011 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 14:56:42,074 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 14:56:42,117 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 14:56:42,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 14:56:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:56:42,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 14:56:42,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 14:56:42,177 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 14:56:42,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:56:42,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 14:56:42,203 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;@3c62fd17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 14:56:42,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-07 14:56:42,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:56:42,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:56:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash 715732991, now seen corresponding path program 1 times [2024-05-07 14:56:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:56:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608029193] [2024-05-07 14:56:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:42,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:56:42,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608029193] [2024-05-07 14:56:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608029193] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 14:56:42,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 14:56:42,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 14:56:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188621778] [2024-05-07 14:56:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 14:56:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 14:56:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:56:42,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 14:56:42,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 14:56:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:42,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:56:42,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:56:42,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash -677086386, now seen corresponding path program 1 times [2024-05-07 14:56:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 14:56:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:43,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 14:56:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 14:56:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 14:56:44,131 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 14:56:44,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2024-05-07 14:56:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1052604284, now seen corresponding path program 1 times [2024-05-07 14:56:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 14:56:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-05-07 14:56:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1410780353, now seen corresponding path program 1 times [2024-05-07 14:56:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:45,800 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 14:56:45,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2024-05-07 14:56:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1104143134, now seen corresponding path program 2 times [2024-05-07 14:56:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 14:56:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:46,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 14:56:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:46,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-05-07 14:56:46,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:56:46,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:56:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1475656213, now seen corresponding path program 1 times [2024-05-07 14:56:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:56:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427796106] [2024-05-07 14:56:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:48,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:56:48,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427796106] [2024-05-07 14:56:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427796106] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:56:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771686466] [2024-05-07 14:56:48,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:48,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:56:48,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:56:48,098 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-07 14:56:48,120 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-07 14:56:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:48,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 39 conjunts are in the unsatisfiable core [2024-05-07 14:56:48,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:56:50,045 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-05-07 14:56:50,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-05-07 14:56:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:50,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 14:56:50,689 INFO L349 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2024-05-07 14:56:50,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 99 [2024-05-07 14:56:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771686466] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 14:56:52,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 14:56:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 57 [2024-05-07 14:56:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181120902] [2024-05-07 14:56:52,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 14:56:52,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-05-07 14:56:52,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:56:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-05-07 14:56:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=2654, Unknown=0, NotChecked=0, Total=3192 [2024-05-07 14:56:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:52,797 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:56:52,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.157894736842105) internal successors, (408), 57 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:56:52,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:52,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-07 14:56:55,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-07 14:56:55,620 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,SelfDestructingSolverStorable9 [2024-05-07 14:56:55,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:56:55,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:56:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1964450984, now seen corresponding path program 2 times [2024-05-07 14:56:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:56:55,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888035879] [2024-05-07 14:56:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 21 proven. 86 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-07 14:56:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:56:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888035879] [2024-05-07 14:56:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888035879] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:56:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631061638] [2024-05-07 14:56:56,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 14:56:56,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:56:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:56:56,091 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-07 14:56:56,096 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-07 14:56:56,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 14:56:56,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 14:56:56,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-07 14:56:56,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:56:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 14:56:56,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 14:56:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 73 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 14:56:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631061638] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 14:56:56,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 14:56:56,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2024-05-07 14:56:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260504430] [2024-05-07 14:56:56,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 14:56:56,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-07 14:56:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:56:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-07 14:56:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2024-05-07 14:56:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:56,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:56:56,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 13.483870967741936) internal successors, (418), 31 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:56:56,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:56,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-07 14:56:56,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-07 14:56:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:56:57,452 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-07 14:56:57,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:56:57,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:56:57,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:56:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash -841643802, now seen corresponding path program 3 times [2024-05-07 14:56:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:56:57,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643221753] [2024-05-07 14:56:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:57,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 44 proven. 121 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 14:56:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:56:58,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643221753] [2024-05-07 14:56:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643221753] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:56:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705056171] [2024-05-07 14:56:58,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-07 14:56:58,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:56:58,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:56:58,279 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-07 14:56:58,303 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-07 14:56:58,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-07 14:56:58,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 14:56:58,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 5 conjunts are in the unsatisfiable core [2024-05-07 14:56:58,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:56:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-05-07 14:56:58,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 14:56:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705056171] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 14:56:58,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 14:56:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2024-05-07 14:56:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842410657] [2024-05-07 14:56:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 14:56:58,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-07 14:56:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:56:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 14:56:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-05-07 14:56:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:58,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:56:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:56:58,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:58,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-07 14:56:58,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:56:58,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:56:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-07 14:56:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:56:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:56:59,003 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-07 14:56:59,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:56:59,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:56:59,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:56:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -961853325, now seen corresponding path program 4 times [2024-05-07 14:56:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:56:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944973929] [2024-05-07 14:56:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:56:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:56:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:56:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 57 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-07 14:56:59,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:56:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944973929] [2024-05-07 14:56:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944973929] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:56:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189266197] [2024-05-07 14:56:59,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-07 14:56:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:56:59,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:56:59,589 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-07 14:56:59,609 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-07 14:56:59,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-07 14:56:59,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 14:56:59,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-07 14:56:59,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:57:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-05-07 14:57:00,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 14:57:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-05-07 14:57:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189266197] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 14:57:00,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 14:57:00,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2024-05-07 14:57:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097733518] [2024-05-07 14:57:00,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 14:57:00,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-07 14:57:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:57:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-07 14:57:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-05-07 14:57:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:00,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:57:00,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 15.76923076923077) internal successors, (410), 26 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:57:00,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:00,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-07 14:57:00,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:00,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:00,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-07 14:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:00,816 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-07 14:57:01,013 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,SelfDestructingSolverStorable12 [2024-05-07 14:57:01,014 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:57:01,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:57:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1429638737, now seen corresponding path program 5 times [2024-05-07 14:57:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:57:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963787213] [2024-05-07 14:57:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 57 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-07 14:57:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:57:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963787213] [2024-05-07 14:57:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963787213] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:57:01,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730521801] [2024-05-07 14:57:01,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-07 14:57:01,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:57:01,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:57:01,397 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-07 14:57:01,399 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-07 14:57:01,517 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-05-07 14:57:01,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 14:57:01,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-07 14:57:01,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:57:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-05-07 14:57:01,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 14:57:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-05-07 14:57:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730521801] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-07 14:57:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-07 14:57:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14, 5] total 18 [2024-05-07 14:57:01,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070012397] [2024-05-07 14:57:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 14:57:01,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 14:57:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:57:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 14:57:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-05-07 14:57:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:01,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:57:01,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:57:01,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:01,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-07 14:57:01,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:01,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:01,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:01,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -206520890, now seen corresponding path program 3 times [2024-05-07 14:57:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-05-07 14:57:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-05-07 14:57:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 14:57:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2024-05-07 14:57:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:02,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-07 14:57:02,662 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,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-05-07 14:57:02,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:57:02,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:57:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash -990492934, now seen corresponding path program 6 times [2024-05-07 14:57:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:57:02,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633493421] [2024-05-07 14:57:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-07 14:57:02,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:57:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633493421] [2024-05-07 14:57:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633493421] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:57:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539576895] [2024-05-07 14:57:02,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-07 14:57:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:57:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:57:02,973 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-07 14:57:02,992 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-07 14:57:03,503 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-05-07 14:57:03,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 14:57:03,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-07 14:57:03,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:57:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-07 14:57:04,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 14:57:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-07 14:57:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539576895] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 14:57:04,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 14:57:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-05-07 14:57:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838085875] [2024-05-07 14:57:04,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 14:57:04,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-07 14:57:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:57:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-07 14:57:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2024-05-07 14:57:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:04,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:57:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 13.46875) internal successors, (431), 32 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:57:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 14:57:04,938 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-07 14:57:05,133 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,SelfDestructingSolverStorable16 [2024-05-07 14:57:05,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:57:05,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:57:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 4918582, now seen corresponding path program 7 times [2024-05-07 14:57:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:57:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980404806] [2024-05-07 14:57:05,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-05-07 14:57:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:57:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980404806] [2024-05-07 14:57:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980404806] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 14:57:05,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 14:57:05,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 14:57:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034051574] [2024-05-07 14:57:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 14:57:05,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 14:57:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:57:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 14:57:05,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-07 14:57:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:57:05,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:57:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 14:57:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 14:57:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 14:57:05,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-07 14:57:05,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:57:05,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:57:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1279844263, now seen corresponding path program 8 times [2024-05-07 14:57:05,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:57:05,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053652395] [2024-05-07 14:57:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-05-07 14:57:05,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:57:05,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053652395] [2024-05-07 14:57:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053652395] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 14:57:05,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 14:57:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 14:57:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177197707] [2024-05-07 14:57:05,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 14:57:05,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 14:57:05,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 14:57:05,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 14:57:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-07 14:57:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 14:57:05,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 14:57:05,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 14:57:05,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 14:57:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-07 14:57:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-07 14:57:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-07 14:57:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 14:57:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 14:57:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 14:57:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 14:57:05,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-07 14:57:05,822 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 14:57:05,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 14:57:05,823 INFO L85 PathProgramCache]: Analyzing trace with hash 224511107, now seen corresponding path program 9 times [2024-05-07 14:57:05,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 14:57:05,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593116122] [2024-05-07 14:57:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 14:57:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 14:57:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 14:57:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-07 14:57:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 14:57:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593116122] [2024-05-07 14:57:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593116122] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 14:57:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696702030] [2024-05-07 14:57:06,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-07 14:57:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 14:57:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 14:57:06,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 14:57:06,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-07 14:57:06,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-07 14:57:06,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 14:57:06,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 58 conjunts are in the unsatisfiable core [2024-05-07 14:57:06,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 14:57:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 14:57:07,909 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 16 treesize of output 11 [2024-05-07 14:57:08,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 14:57:08,001 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 16 treesize of output 11 [2024-05-07 14:57:08,988 INFO L349 Elim1Store]: treesize reduction 36, result has 74.5 percent of original size [2024-05-07 14:57:08,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 120 [2024-05-07 14:57:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-05-07 14:57:09,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 14:57:18,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= (mod c_~ok~0 256) 0))) (let ((.cse14 (+ c_~v_old~0 1)) (.cse6 (* c_~start~0 4)) (.cse24 (not .cse10)) (.cse5 (* c_~end~0 4)) (.cse8 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((v_ArrVal_534 (Array Int Int)) (v_subst_12 Int) (~queue~0.base Int) (v_~i~0_85 Int) (~queue~0.offset Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse4 (select .cse9 ~queue~0.base)) (.cse7 (select .cse9 c_~A~0.base))) (let ((.cse0 (select .cse7 (+ c_~A~0.offset (* v_~i~0_85 4)))) (.cse1 (select .cse4 (+ (* v_subst_12 4) ~queue~0.offset))) (.cse2 (select .cse7 .cse8)) (.cse3 (select .cse4 (+ .cse6 ~queue~0.offset)))) (or (not (= .cse0 .cse1)) (< .cse2 .cse0) (< v_subst_12 0) (< .cse1 (+ .cse3 1)) (not (= (select .cse4 (+ .cse5 ~queue~0.offset)) .cse2)) (< c_~v_old~0 .cse3)))))) .cse10) (forall ((v_ArrVal_534 (Array Int Int)) (v_~i~0_84 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse16 (select .cse15 c_~A~0.base))) (let ((.cse12 (select .cse16 (+ c_~A~0.offset (* v_~i~0_84 4)))) (.cse11 (select .cse16 .cse8))) (or (< .cse11 .cse12) (forall ((v_subst_13 Int)) (or (< v_subst_13 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse13 (select .cse15 ~queue~0.base))) (or (not (= (select .cse13 (+ (* v_subst_13 4) ~queue~0.offset)) .cse12)) (< (select .cse13 (+ .cse6 ~queue~0.offset)) .cse14) (not (= (select .cse13 (+ .cse5 ~queue~0.offset)) .cse11)))))))))))) (forall ((v_ArrVal_534 (Array Int Int)) (v_~i~0_83 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse23 (select .cse22 c_~A~0.base))) (let ((.cse18 (select .cse23 (+ c_~A~0.offset (* v_~i~0_83 4)))) (.cse17 (select .cse23 .cse8))) (or (< .cse17 .cse18) (forall ((v_subst_12 Int)) (or (< v_subst_12 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse21 (select .cse22 ~queue~0.base))) (let ((.cse20 (select .cse21 (+ (* v_subst_12 4) ~queue~0.offset))) (.cse19 (select .cse21 (+ .cse6 ~queue~0.offset)))) (or (< .cse19 .cse14) (not (= .cse20 .cse18)) (< .cse20 (+ .cse19 1)) (not (= (select .cse21 (+ .cse5 ~queue~0.offset)) .cse17))))))))))))) (or .cse24 (forall ((v_ArrVal_534 (Array Int Int)) (v_subst_12 Int) (v_~i~0_83 Int) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse28 (select .cse30 ~queue~0.base)) (.cse29 (select .cse30 c_~A~0.base))) (let ((.cse26 (select .cse29 (+ c_~A~0.offset (* v_~i~0_83 4)))) (.cse27 (select .cse28 (+ (* v_subst_12 4) ~queue~0.offset))) (.cse25 (select .cse29 .cse8))) (or (< .cse25 .cse26) (< v_subst_12 0) (not (= .cse27 .cse26)) (< .cse27 (+ (select .cse28 (+ .cse6 ~queue~0.offset)) 1)) (not (= (select .cse28 (+ .cse5 ~queue~0.offset)) .cse25)))))))) (or .cse24 (forall ((v_ArrVal_534 (Array Int Int)) (v_subst_13 Int) (v_~i~0_84 Int) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse34 (select .cse35 c_~A~0.base))) (let ((.cse32 (select .cse34 (+ c_~A~0.offset (* v_~i~0_84 4)))) (.cse31 (select .cse35 ~queue~0.base)) (.cse33 (select .cse34 .cse8))) (or (< v_subst_13 0) (not (= (select .cse31 (+ (* v_subst_13 4) ~queue~0.offset)) .cse32)) (< .cse33 .cse32) (not (= (select .cse31 (+ .cse5 ~queue~0.offset)) .cse33))))))))))) is different from false [2024-05-07 14:57:19,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (= (mod c_~ok~0 256) 0))) (let ((.cse9 (not .cse21)) (.cse1 (* c_~end~0 4)) (.cse18 (+ c_~v_old~0 1)) (.cse4 (* c_~start~0 4)) (.cse7 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((v_ArrVal_534 (Array Int Int)) (v_subst_12 Int) (v_~i~0_83 Int) (~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse0 (select .cse8 ~queue~0.base)) (.cse6 (select .cse8 c_~A~0.base))) (let ((.cse2 (select .cse6 .cse7)) (.cse3 (select .cse0 (+ (* v_subst_12 4) ~queue~0.offset))) (.cse5 (select .cse6 (+ c_~A~0.offset (* v_~i~0_83 4))))) (or (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) .cse2)) (< .cse3 (+ (select .cse0 (+ .cse4 ~queue~0.offset)) 1)) (< v_subst_12 0) (< .cse2 .cse5) (not (= .cse3 .cse5))))))) .cse9) (or (forall ((v_ArrVal_534 (Array Int Int)) (v_subst_13 Int) (v_~i~0_84 Int) (~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse13 (select .cse14 c_~A~0.base))) (let ((.cse11 (select .cse13 .cse7)) (.cse10 (select .cse14 ~queue~0.base)) (.cse12 (select .cse13 (+ c_~A~0.offset (* v_~i~0_84 4))))) (or (not (= (select .cse10 (+ .cse1 ~queue~0.offset)) .cse11)) (< v_subst_13 0) (< .cse11 .cse12) (not (= (select .cse10 (+ (* v_subst_13 4) ~queue~0.offset)) .cse12))))))) .cse9) (forall ((v_ArrVal_534 (Array Int Int)) (v_~i~0_84 Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse20 (select .cse19 c_~A~0.base))) (let ((.cse15 (select .cse20 .cse7)) (.cse16 (select .cse20 (+ c_~A~0.offset (* v_~i~0_84 4))))) (or (< .cse15 .cse16) (forall ((v_subst_13 Int)) (or (< v_subst_13 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse17 (select .cse19 ~queue~0.base))) (or (not (= (select .cse17 (+ .cse1 ~queue~0.offset)) .cse15)) (not (= (select .cse17 (+ (* v_subst_13 4) ~queue~0.offset)) .cse16)) (< (select .cse17 (+ .cse4 ~queue~0.offset)) .cse18))))))))))) (or .cse21 (forall ((v_ArrVal_534 (Array Int Int)) (v_subst_12 Int) (~queue~0.base Int) (v_~i~0_85 Int) (~queue~0.offset Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse27 (select .cse28 c_~A~0.base)) (.cse22 (select .cse28 ~queue~0.base))) (let ((.cse24 (select .cse22 (+ .cse4 ~queue~0.offset))) (.cse23 (select .cse27 .cse7)) (.cse26 (select .cse27 (+ c_~A~0.offset (* v_~i~0_85 4)))) (.cse25 (select .cse22 (+ (* v_subst_12 4) ~queue~0.offset)))) (or (not (= (select .cse22 (+ .cse1 ~queue~0.offset)) .cse23)) (< c_~v_old~0 .cse24) (< .cse25 (+ .cse24 1)) (< .cse23 .cse26) (< v_subst_12 0) (not (= .cse26 .cse25)))))))) (forall ((v_ArrVal_534 (Array Int Int)) (v_~i~0_83 Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534))) (let ((.cse35 (select .cse34 c_~A~0.base))) (let ((.cse29 (select .cse35 .cse7)) (.cse30 (select .cse35 (+ c_~A~0.offset (* v_~i~0_83 4))))) (or (< .cse29 .cse30) (forall ((v_subst_12 Int)) (or (forall ((~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse31 (select .cse34 ~queue~0.base))) (let ((.cse33 (select .cse31 (+ .cse4 ~queue~0.offset))) (.cse32 (select .cse31 (+ (* v_subst_12 4) ~queue~0.offset)))) (or (not (= (select .cse31 (+ .cse1 ~queue~0.offset)) .cse29)) (< .cse32 (+ .cse33 1)) (< .cse33 .cse18) (not (= .cse32 .cse30)))))) (< v_subst_12 0))))))))))) is different from false [2024-05-07 14:57:30,026 WARN L293 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 928 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-05-07 14:57:30,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:30,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 11932 treesize of output 13584 [2024-05-07 14:57:32,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:32,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4392 treesize of output 4269 [2024-05-07 14:57:33,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:33,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4140 treesize of output 4143 [2024-05-07 14:57:34,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:34,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4014 treesize of output 4023 [2024-05-07 14:57:35,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:35,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3894 treesize of output 3783 [2024-05-07 14:57:36,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3654 treesize of output 3627 [2024-05-07 14:57:37,880 INFO L224 Elim1Store]: Index analysis took 107 ms [2024-05-07 14:57:38,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:38,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3546 treesize of output 3447 [2024-05-07 14:57:39,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:39,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3318 treesize of output 3333 [2024-05-07 14:57:40,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:40,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3204 treesize of output 3213 [2024-05-07 14:57:42,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:42,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3084 treesize of output 2973 [2024-05-07 14:57:43,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 14:57:43,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2844 treesize of output 2709 [2024-05-07 15:04:47,356 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-07 15:04:47,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-05-07 15:04:47,357 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-07 15:04:47,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-07 15:04:47,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:04:47,559 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2024-05-07 15:04:47,562 INFO L158 Benchmark]: Toolchain (without parser) took 486478.14ms. Allocated memory was 302.0MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 231.1MB in the beginning and 932.5MB in the end (delta: -701.4MB). Peak memory consumption was 646.6MB. Max. memory is 8.0GB. [2024-05-07 15:04:47,563 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 302.0MB. Free memory is still 269.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 15:04:47,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 302.0MB. Free memory was 230.6MB in the beginning and 218.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-07 15:04:47,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.03ms. Allocated memory is still 302.0MB. Free memory was 218.5MB in the beginning and 216.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 15:04:47,563 INFO L158 Benchmark]: Boogie Preprocessor took 31.35ms. Allocated memory is still 302.0MB. Free memory was 216.4MB in the beginning and 214.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 15:04:47,564 INFO L158 Benchmark]: RCFGBuilder took 543.48ms. Allocated memory is still 302.0MB. Free memory was 214.9MB in the beginning and 188.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-05-07 15:04:47,564 INFO L158 Benchmark]: TraceAbstraction took 485574.70ms. Allocated memory was 302.0MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 186.5MB in the beginning and 932.5MB in the end (delta: -746.0MB). Peak memory consumption was 601.5MB. Max. memory is 8.0GB. [2024-05-07 15:04:47,565 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.16ms. Allocated memory is still 302.0MB. Free memory is still 269.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 302.0MB. Free memory was 230.6MB in the beginning and 218.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.03ms. Allocated memory is still 302.0MB. Free memory was 218.5MB in the beginning and 216.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.35ms. Allocated memory is still 302.0MB. Free memory was 216.4MB in the beginning and 214.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 543.48ms. Allocated memory is still 302.0MB. Free memory was 214.9MB in the beginning and 188.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 485574.70ms. Allocated memory was 302.0MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 186.5MB in the beginning and 932.5MB in the end (delta: -746.0MB). Peak memory consumption was 601.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-05-07 15:04:47,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...