/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 DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 17:35:04,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 17:35:04,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 17:35:04,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 17:35:04,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 17:35:04,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 17:35:04,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 17:35:04,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 17:35:04,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 17:35:04,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 17:35:04,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 17:35:04,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 17:35:04,460 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 17:35:04,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 17:35:04,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 17:35:04,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 17:35:04,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 17:35:04,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 17:35:04,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 17:35:04,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 17:35:04,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 17:35:04,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 17:35:04,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 17:35:04,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 17:35:04,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 17:35:04,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 17:35:04,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 17:35:04,465 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 17:35:04,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 17:35:04,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 17:35:04,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 17:35:04,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 17:35:04,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 17:35:04,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 17:35:04,467 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 17:35:04,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 17:35:04,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 17:35:04,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 17:35:04,467 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 17:35:04,468 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 -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 17:35:04,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 17:35:04,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 17:35:04,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 17:35:04,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 17:35:04,701 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 17:35:04,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-06 17:35:05,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 17:35:06,087 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 17:35:06,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-06 17:35:06,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/daded6786/7695190b826f440aaf744a075d199282/FLAGf7e2a4397 [2024-05-06 17:35:06,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/daded6786/7695190b826f440aaf744a075d199282 [2024-05-06 17:35:06,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 17:35:06,122 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 17:35:06,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 17:35:06,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 17:35:06,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 17:35:06,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3375e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06, skipping insertion in model container [2024-05-06 17:35:06,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,168 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 17:35:06,318 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/parallel-lamport.wvr.c[4210,4223] [2024-05-06 17:35:06,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 17:35:06,336 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 17:35:06,370 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/parallel-lamport.wvr.c[4210,4223] [2024-05-06 17:35:06,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 17:35:06,381 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 17:35:06,381 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 17:35:06,403 INFO L206 MainTranslator]: Completed translation [2024-05-06 17:35:06,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06 WrapperNode [2024-05-06 17:35:06,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 17:35:06,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 17:35:06,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 17:35:06,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 17:35:06,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,443 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 243 [2024-05-06 17:35:06,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 17:35:06,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 17:35:06,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 17:35:06,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 17:35:06,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 17:35:06,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 17:35:06,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 17:35:06,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 17:35:06,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (1/1) ... [2024-05-06 17:35:06,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 17:35:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:35:06,509 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-06 17:35:06,524 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-06 17:35:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 17:35:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 17:35:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 17:35:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 17:35:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 17:35:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 17:35:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 17:35:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 17:35:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 17:35:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 17:35:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 17:35:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 17:35:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 17:35:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-06 17:35:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 17:35:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 17:35:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 17:35:06,561 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 17:35:06,650 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 17:35:06,652 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 17:35:06,954 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 17:35:07,045 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 17:35:07,045 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2024-05-06 17:35:07,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:35:07 BoogieIcfgContainer [2024-05-06 17:35:07,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 17:35:07,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 17:35:07,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 17:35:07,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 17:35:07,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 05:35:06" (1/3) ... [2024-05-06 17:35:07,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b8986b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:35:07, skipping insertion in model container [2024-05-06 17:35:07,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:35:06" (2/3) ... [2024-05-06 17:35:07,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b8986b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:35:07, skipping insertion in model container [2024-05-06 17:35:07,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:35:07" (3/3) ... [2024-05-06 17:35:07,054 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2024-05-06 17:35:07,061 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 17:35:07,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 17:35:07,070 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 17:35:07,070 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 17:35:07,150 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-06 17:35:07,206 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 17:35:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 17:35:07,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:35:07,210 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-06 17:35:07,211 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-06 17:35:07,253 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 17:35:07,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:35:07,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 17:35:07,273 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;@699f8cc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 17:35:07,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 17:35:07,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:35:07,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:35:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash 941376213, now seen corresponding path program 1 times [2024-05-06 17:35:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:35:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807190798] [2024-05-06 17:35:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:35:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807190798] [2024-05-06 17:35:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807190798] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:35:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:35:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 17:35:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551529373] [2024-05-06 17:35:07,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:35:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 17:35:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:35:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 17:35:07,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 17:35:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:07,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:35:07,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 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-06 17:35:07,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:07,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 17:35:07,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:35:07,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:35:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash -467458075, now seen corresponding path program 1 times [2024-05-06 17:35:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:35:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408230332] [2024-05-06 17:35:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:35:08,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408230332] [2024-05-06 17:35:08,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408230332] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:35:08,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 17:35:08,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 17:35:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022595510] [2024-05-06 17:35:08,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:35:08,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 17:35:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:35:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 17:35:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-06 17:35:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:08,317 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:35:08,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-06 17:35:08,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:08,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:08,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:08,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 17:35:08,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 17:35:08,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:35:08,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:35:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 120148031, now seen corresponding path program 1 times [2024-05-06 17:35:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:35:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336115077] [2024-05-06 17:35:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:35:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336115077] [2024-05-06 17:35:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336115077] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 17:35:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794231144] [2024-05-06 17:35:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 17:35:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:35:10,142 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-06 17:35:10,166 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-06 17:35:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:10,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 61 conjunts are in the unsatisfiable core [2024-05-06 17:35:10,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 17:35:10,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-06 17:35:10,446 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-06 17:35:10,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-05-06 17:35:10,937 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-06 17:35:10,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-05-06 17:35:11,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-06 17:35:12,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-06 17:35:12,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-06 17:35:12,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-06 17:35:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:13,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 17:35:13,232 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))))) (or (< c_~n~0 (+ .cse0 1)) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse0))) c_~i~0) (< .cse0 0))))) is different from false [2024-05-06 17:35:13,696 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (< .cse0 0) (< c_~n~0 (+ .cse0 1)) (< c_~n~0 (+ (select .cse1 (+ (* .cse0 4) c_~f~0.offset)) 2)))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1))))))) is different from false [2024-05-06 17:35:14,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) is different from false [2024-05-06 17:35:14,480 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2024-05-06 17:35:14,744 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-05-06 17:35:14,783 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-05-06 17:35:22,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:22,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2024-05-06 17:35:22,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:22,630 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 1012 [2024-05-06 17:35:22,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:22,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 480 treesize of output 404 [2024-05-06 17:35:22,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:22,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2024-05-06 17:35:22,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:22,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 175 [2024-05-06 17:35:23,829 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-06 17:35:23,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 1 [2024-05-06 17:35:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794231144] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 17:35:24,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 17:35:24,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31, 28] total 73 [2024-05-06 17:35:24,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513960627] [2024-05-06 17:35:24,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 17:35:24,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-05-06 17:35:24,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:35:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-05-06 17:35:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3851, Unknown=57, NotChecked=810, Total=5256 [2024-05-06 17:35:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:24,366 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:35:24,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 5.890410958904109) internal successors, (430), 73 states have internal predecessors, (430), 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-06 17:35:24,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:24,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 17:35:24,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:27,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-06 17:35:29,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-06 17:35:30,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~n~0 1)) (.cse3 (= c_~n~0 1))) (and (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse0 (select .cse1 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse0 0) (< c_~n~0 (+ .cse0 1)) (< c_~n~0 (+ (select .cse1 (+ (* .cse0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 2)))))) (< c_~n~0 (+ ~i~0 1)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8|) 0)))) .cse2 .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse4 (select .cse5 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse4 0) (< (select .cse5 (+ (* .cse4 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1) (< c_~n~0 (+ .cse4 1)))))))) (or (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse6 0) (< (select .cse7 (+ (* .cse6 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< c_~n~0 (+ .cse6 1)))))) (< c_~n~0 (+ ~i~0 1)))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse8 (select .cse9 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse8 0) (< (select .cse9 (+ (* .cse8 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1) (< c_~n~0 (+ .cse8 1)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse11 (select .cse10 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~n~0 (+ 2 (select .cse10 (+ (* .cse11 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< .cse11 0) (< c_~n~0 (+ .cse11 1)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~n~0 (+ (select .cse12 (+ (* .cse13 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (< .cse13 0) (< c_~n~0 (+ .cse13 1)))))))) (or .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3))) is different from false [2024-05-06 17:35:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 17:35:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 17:35:32,819 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-06 17:35:33,011 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,SelfDestructingSolverStorable2 [2024-05-06 17:35:33,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:35:33,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:35:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1785299303, now seen corresponding path program 2 times [2024-05-06 17:35:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:35:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329314162] [2024-05-06 17:35:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:35:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329314162] [2024-05-06 17:35:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329314162] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 17:35:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564985833] [2024-05-06 17:35:35,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 17:35:35,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 17:35:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:35:35,832 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-06 17:35:35,835 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-06 17:35:36,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-06 17:35:36,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 17:35:36,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-06 17:35:36,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 17:35:36,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-06 17:35:36,298 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-06 17:35:36,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-05-06 17:35:36,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 17:35:36,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-05-06 17:35:37,177 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 28 treesize of output 21 [2024-05-06 17:35:37,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:37,310 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-05-06 17:35:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:37,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 17:35:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564985833] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:35:37,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 17:35:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [32] total 48 [2024-05-06 17:35:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450550679] [2024-05-06 17:35:37,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:35:37,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-06 17:35:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:35:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-06 17:35:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2024-05-06 17:35:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:37,335 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:35:37,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 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-06 17:35:37,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:37,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 17:35:37,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 17:35:37,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 treesize of output 4 [2024-05-06 17:35:39,369 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:39,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 17:35:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash 608404265, now seen corresponding path program 1 times [2024-05-06 17:35:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:39,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 treesize of output 4 [2024-05-06 17:35:39,851 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:39,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 17:35:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2078801557, now seen corresponding path program 1 times [2024-05-06 17:35:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:39,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:40,208 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 17:35:40,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2024-05-06 17:35:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash -346215198, now seen corresponding path program 1 times [2024-05-06 17:35:40,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 17:35:40,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 17:35:41,933 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:41,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 17:35:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -957694256, now seen corresponding path program 1 times [2024-05-06 17:35:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:42,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1948868702, now seen corresponding path program 1 times [2024-05-06 17:35:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:42,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2070285016, now seen corresponding path program 1 times [2024-05-06 17:35:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:43,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 17:35:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-05-06 17:35:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash -957694256, now seen corresponding path program 2 times [2024-05-06 17:35:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:44,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1948868702, now seen corresponding path program 2 times [2024-05-06 17:35:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:44,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:44,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:44,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 treesize of output 4 [2024-05-06 17:35:45,169 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:45,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 17:35:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -859758043, now seen corresponding path program 2 times [2024-05-06 17:35:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:45,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:45,529 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 17:35:45,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2024-05-06 17:35:45,781 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:45,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 17:35:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -882687262, now seen corresponding path program 2 times [2024-05-06 17:35:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 17:35:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-05-06 17:35:47,316 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:47,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-05-06 17:35:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -957694256, now seen corresponding path program 3 times [2024-05-06 17:35:47,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:47,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:48,160 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:48,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 17:35:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2070285368, now seen corresponding path program 4 times [2024-05-06 17:35:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:48,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:48,636 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 17:35:48,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2024-05-06 17:35:49,024 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:49,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-05-06 17:35:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash -997932318, now seen corresponding path program 3 times [2024-05-06 17:35:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 17:35:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2024-05-06 17:35:50,358 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 17:35:50,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-05-06 17:35:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash 109054638, now seen corresponding path program 1 times [2024-05-06 17:35:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:50,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 17:35:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 17:35:50,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 treesize of output 4 [2024-05-06 17:35:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1888779429, now seen corresponding path program 3 times [2024-05-06 17:35:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:51,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 17:35:51,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2024-05-06 17:35:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 17:35:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 17:35:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-05-06 17:35:52,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-06 17:35:52,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 17:35:52,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 17:35:52,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 17:35:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 365871679, now seen corresponding path program 3 times [2024-05-06 17:35:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 17:35:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584309079] [2024-05-06 17:35:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 17:35:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 17:35:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 17:35:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 17:35:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 17:35:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584309079] [2024-05-06 17:35:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584309079] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 17:35:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028849248] [2024-05-06 17:35:54,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 17:35:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 17:35:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 17:35:54,192 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-06 17:35:54,200 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-06 17:35:54,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-05-06 17:35:54,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 17:35:54,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-06 17:35:54,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 17:35:54,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-06 17:35:54,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-06 17:35:54,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-05-06 17:35:54,970 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 28 treesize of output 21 [2024-05-06 17:35:55,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 17:35:55,050 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-05-06 17:35:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 17:35:55,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 17:35:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028849248] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 17:35:55,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 17:35:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [30] total 44 [2024-05-06 17:35:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776195479] [2024-05-06 17:35:55,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 17:35:55,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-06 17:35:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 17:35:55,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-06 17:35:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2024-05-06 17:35:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:55,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 17:35:55,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.3) internal successors, (166), 20 states have internal predecessors, (166), 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-06 17:35:55,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:35:55,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 17:35:55,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 17:35:55,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-05-06 17:35:55,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:36:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 17:36:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 17:36:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-05-06 17:36:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-05-06 17:36:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-06 17:36:04,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 17:36:04,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 17:36:04,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 17:36:04,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 17:36:04,548 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-06 17:36:04,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 17:36:04,749 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-05-06 17:36:04,752 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 17:36:04,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 17:36:04,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:36:04 BasicIcfg [2024-05-06 17:36:04,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 17:36:04,755 INFO L158 Benchmark]: Toolchain (without parser) took 58632.78ms. Allocated memory was 166.7MB in the beginning and 901.8MB in the end (delta: 735.1MB). Free memory was 101.9MB in the beginning and 357.0MB in the end (delta: -255.2MB). Peak memory consumption was 481.0MB. Max. memory is 8.0GB. [2024-05-06 17:36:04,755 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 166.7MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 17:36:04,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.25ms. Allocated memory was 166.7MB in the beginning and 233.8MB in the end (delta: 67.1MB). Free memory was 101.6MB in the beginning and 207.6MB in the end (delta: -105.9MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2024-05-06 17:36:04,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.43ms. Allocated memory is still 233.8MB. Free memory was 207.6MB in the beginning and 205.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 17:36:04,756 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 233.8MB. Free memory was 205.5MB in the beginning and 203.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 17:36:04,756 INFO L158 Benchmark]: RCFGBuilder took 567.75ms. Allocated memory is still 233.8MB. Free memory was 203.4MB in the beginning and 175.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2024-05-06 17:36:04,756 INFO L158 Benchmark]: TraceAbstraction took 57705.94ms. Allocated memory was 233.8MB in the beginning and 901.8MB in the end (delta: 667.9MB). Free memory was 173.5MB in the beginning and 357.0MB in the end (delta: -183.5MB). Peak memory consumption was 484.9MB. Max. memory is 8.0GB. [2024-05-06 17:36:04,760 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.13ms. Allocated memory is still 166.7MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.25ms. Allocated memory was 166.7MB in the beginning and 233.8MB in the end (delta: 67.1MB). Free memory was 101.6MB in the beginning and 207.6MB in the end (delta: -105.9MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.43ms. Allocated memory is still 233.8MB. Free memory was 207.6MB in the beginning and 205.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 233.8MB. Free memory was 205.5MB in the beginning and 203.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 567.75ms. Allocated memory is still 233.8MB. Free memory was 203.4MB in the beginning and 175.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 57705.94ms. Allocated memory was 233.8MB in the beginning and 901.8MB in the end (delta: 667.9MB). Free memory was 173.5MB in the beginning and 357.0MB in the end (delta: -183.5MB). Peak memory consumption was 484.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 181488, independent: 181300, independent conditional: 181213, independent unconditional: 87, dependent: 188, dependent conditional: 188, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 181405, independent: 181300, independent conditional: 181213, independent unconditional: 87, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181405, independent: 181300, independent conditional: 181213, independent unconditional: 87, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 181405, independent: 181300, independent conditional: 181213, independent unconditional: 87, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182082, independent: 181300, independent conditional: 88302, independent unconditional: 92998, dependent: 782, dependent conditional: 517, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182082, independent: 181300, independent conditional: 52529, independent unconditional: 128771, dependent: 782, dependent conditional: 147, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182082, independent: 181300, independent conditional: 52529, independent unconditional: 128771, dependent: 782, dependent conditional: 147, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1136, independent: 1097, independent conditional: 352, independent unconditional: 745, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1136, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 57, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, independent: 65, independent conditional: 60, independent unconditional: 5, dependent: 75, dependent conditional: 54, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182082, independent: 180203, independent conditional: 52177, independent unconditional: 128026, dependent: 743, dependent conditional: 125, dependent unconditional: 618, unknown: 1136, unknown conditional: 374, unknown unconditional: 762] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1097, Positive conditional cache size: 352, Positive unconditional cache size: 745, Negative cache size: 39, Negative conditional cache size: 22, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36143, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182082, independent: 181300, independent conditional: 88302, independent unconditional: 92998, dependent: 782, dependent conditional: 517, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182082, independent: 181300, independent conditional: 52529, independent unconditional: 128771, dependent: 782, dependent conditional: 147, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182082, independent: 181300, independent conditional: 52529, independent unconditional: 128771, dependent: 782, dependent conditional: 147, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1136, independent: 1097, independent conditional: 352, independent unconditional: 745, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1136, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 57, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 39, dependent conditional: 22, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, independent: 65, independent conditional: 60, independent unconditional: 5, dependent: 75, dependent conditional: 54, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182082, independent: 180203, independent conditional: 52177, independent unconditional: 128026, dependent: 743, dependent conditional: 125, dependent unconditional: 618, unknown: 1136, unknown conditional: 374, unknown unconditional: 762] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1097, Positive conditional cache size: 352, Positive unconditional cache size: 745, Negative cache size: 39, Negative conditional cache size: 22, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36143 ], Independence queries for same thread: 83 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 220 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 33.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1317 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1506 ConstructedInterpolants, 88 QuantifiedInterpolants, 23060 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1043 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 20/43 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 13.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 5, ConditionalCommutativityConditionCalculations: 54, ConditionalCommutativityTraceChecks: 15, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 17:36:04,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 17:36:05,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...