/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 LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 05:53:01,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 05:53:01,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 05:53:01,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 05:53:01,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 05:53:01,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 05:53:01,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 05:53:01,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 05:53:01,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 05:53:01,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 05:53:01,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 05:53:01,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 05:53:01,651 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 05:53:01,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 05:53:01,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 05:53:01,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 05:53:01,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 05:53:01,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 05:53:01,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 05:53:01,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 05:53:01,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 05:53:01,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 05:53:01,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 05:53:01,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 05:53:01,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 05:53:01,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 05:53:01,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 05:53:01,659 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 05:53:01,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 05:53:01,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 05:53:01,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 05:53:01,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 05:53:01,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 05:53:01,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 05:53:01,661 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 05:53:01,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 05:53:01,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 05:53:01,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 05:53:01,662 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 05:53:01,662 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 -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 05:53:01,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 05:53:01,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 05:53:01,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 05:53:01,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 05:53:01,897 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 05:53:01,897 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-07 05:53:02,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 05:53:03,030 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 05:53:03,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-07 05:53:03,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38f4a83d2/339713b942ee446998beb13a114b52cf/FLAG5177ebab0 [2024-05-07 05:53:03,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38f4a83d2/339713b942ee446998beb13a114b52cf [2024-05-07 05:53:03,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 05:53:03,049 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 05:53:03,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 05:53:03,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 05:53:03,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 05:53:03,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e9dbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03, skipping insertion in model container [2024-05-07 05:53:03,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,070 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 05:53:03,192 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-07 05:53:03,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 05:53:03,215 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 05:53:03,238 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-07 05:53:03,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 05:53:03,246 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 05:53:03,247 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 05:53:03,252 INFO L206 MainTranslator]: Completed translation [2024-05-07 05:53:03,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03 WrapperNode [2024-05-07 05:53:03,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 05:53:03,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 05:53:03,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 05:53:03,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 05:53:03,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,297 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 243 [2024-05-07 05:53:03,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 05:53:03,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 05:53:03,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 05:53:03,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 05:53:03,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 05:53:03,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 05:53:03,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 05:53:03,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 05:53:03,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (1/1) ... [2024-05-07 05:53:03,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 05:53:03,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 05:53:03,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 05:53:03,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 05:53:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 05:53:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 05:53:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-07 05:53:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-07 05:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 05:53:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 05:53:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 05:53:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-07 05:53:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 05:53:03,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 05:53:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 05:53:03,415 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 05:53:03,526 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 05:53:03,528 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 05:53:03,837 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 05:53:03,897 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 05:53:03,898 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2024-05-07 05:53:03,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:53:03 BoogieIcfgContainer [2024-05-07 05:53:03,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 05:53:03,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 05:53:03,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 05:53:03,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 05:53:03,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 05:53:03" (1/3) ... [2024-05-07 05:53:03,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c22a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:53:03, skipping insertion in model container [2024-05-07 05:53:03,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:53:03" (2/3) ... [2024-05-07 05:53:03,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c22a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:53:03, skipping insertion in model container [2024-05-07 05:53:03,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:53:03" (3/3) ... [2024-05-07 05:53:03,914 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2024-05-07 05:53:03,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 05:53:03,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 05:53:03,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 05:53:03,927 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 05:53:03,974 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-07 05:53:04,006 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 05:53:04,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 05:53:04,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 05:53:04,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 05:53:04,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 05:53:04,040 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 05:53:04,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:04,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 05:53:04,058 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;@2434b848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 05:53:04,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 05:53:04,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:04,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash 941376213, now seen corresponding path program 1 times [2024-05-07 05:53:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411742620] [2024-05-07 05:53:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 05:53:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411742620] [2024-05-07 05:53:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411742620] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 05:53:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208488039] [2024-05-07 05:53:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 05:53:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 05:53:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 05:53:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:04,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:04,511 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-07 05:53:04,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:04,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 05:53:04,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:04,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -467458075, now seen corresponding path program 1 times [2024-05-07 05:53:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943868329] [2024-05-07 05:53:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 05:53:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:04,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943868329] [2024-05-07 05:53:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943868329] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:04,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 05:53:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646510438] [2024-05-07 05:53:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:04,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 05:53:04,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 05:53:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 05:53:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:04,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:04,912 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-07 05:53:04,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:04,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:05,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 05:53:05,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:05,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash 120148031, now seen corresponding path program 1 times [2024-05-07 05:53:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835945671] [2024-05-07 05:53:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:06,171 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-07 05:53:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835945671] [2024-05-07 05:53:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835945671] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 05:53:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237771691] [2024-05-07 05:53:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 05:53:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 05:53:06,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 05:53:06,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 05:53:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:06,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 61 conjunts are in the unsatisfiable core [2024-05-07 05:53:06,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 05:53:06,406 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-07 05:53:06,448 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-07 05:53:06,451 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-07 05:53:06,814 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-07 05:53:06,815 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-07 05:53:07,006 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-07 05:53:07,824 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-07 05:53:08,002 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-07 05:53:08,223 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-07 05:53:08,426 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-07 05:53:08,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 05:53:08,574 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-07 05:53:08,942 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-07 05:53:09,236 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-07 05:53:09,498 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-07 05:53:09,716 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-07 05:53:09,746 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-07 05:53:20,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:20,088 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-07 05:53:20,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:20,102 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-07 05:53:20,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:20,146 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-07 05:53:20,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:20,171 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-07 05:53:20,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:20,200 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-07 05:53:21,025 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-07 05:53:21,025 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-07 05:53:21,528 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-07 05:53:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237771691] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 05:53:21,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 05:53:21,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31, 28] total 73 [2024-05-07 05:53:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115617502] [2024-05-07 05:53:21,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 05:53:21,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-05-07 05:53:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:21,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-05-07 05:53:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3853, Unknown=55, NotChecked=810, Total=5256 [2024-05-07 05:53:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:21,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:21,541 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-07 05:53:21,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:21,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:21,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:21,648 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~f~0.base)) (.cse14 (+ c_~f~0.offset (* c_~j~0 4)))) (let ((.cse0 (select .cse9 .cse14)) (.cse21 (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse26 (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 ((.cse27 (select .cse26 .cse14))) (or (< c_~n~0 (+ 2 (select .cse26 (+ (* .cse27 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse27 1)) (< .cse27 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse29 (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 ((.cse28 (select .cse29 .cse14))) (or (< c_~n~0 (+ .cse28 1)) (< (select .cse29 (+ (* .cse28 4) c_~f~0.offset)) 1) (< .cse28 0))))))) (.cse5 (< c_~n~0 1)) (.cse6 (= c_~n~0 1))) (and (or (< c_~j~0 0) (< c_~n~0 (+ c_~j~0 1)) (= .cse0 c_~i~0)) (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 ((.cse2 (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 .cse2 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< c_~n~0 (+ .cse1 1)) (< .cse1 0) (< c_~n~0 (+ (select .cse2 (+ (* .cse1 4) c_~f~0.offset)) 2)))))))) (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 ((.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_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< c_~n~0 (+ (select .cse4 (+ (* .cse3 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)))) .cse5 .cse6 (< 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 ((.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_~f~0.base))) (let ((.cse8 (select .cse7 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< (select .cse7 (+ (* .cse8 4) c_~f~0.offset)) 1) (< c_~n~0 (+ .cse8 1)) (< .cse8 0))))))) (or (< c_~n~0 (+ .cse0 1)) (< .cse0 0) (= c_~i~0 (select .cse9 (+ c_~f~0.offset (* .cse0 4))))) (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 ((.cse11 (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 ((.cse10 (select .cse11 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse10 0) (< (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1) (< c_~n~0 (+ .cse10 1)))))))) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse13 (select .cse12 .cse14))) (or (< (select .cse12 (+ c_~f~0.offset (* 4 .cse13))) 1) (< c_~n~0 (+ .cse13 1)) (< .cse13 0))))) (or (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (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 ((.cse16 (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 ((.cse15 (select .cse16 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse15 0) (< (select .cse16 (+ (* .cse15 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< c_~n~0 (+ .cse15 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 ((.cse18 (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 ((.cse17 (select .cse18 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse17 0) (< (select .cse18 (+ (* .cse17 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1) (< c_~n~0 (+ .cse17 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 ((.cse19 (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 ((.cse20 (select .cse19 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~n~0 (+ 2 (select .cse19 (+ (* .cse20 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< .cse20 0) (< c_~n~0 (+ .cse20 1)))))))) (or .cse21 (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) (or .cse21 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (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 ((.cse22 (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 ((.cse23 (select .cse22 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~n~0 (+ (select .cse22 (+ (* .cse23 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (< .cse23 0) (< c_~n~0 (+ .cse23 1)))))))) (or .cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse24 (select .cse25 .cse14))) (or (< c_~n~0 (+ .cse24 1)) (< c_~n~0 (+ (select .cse25 (+ c_~f~0.offset (* 4 .cse24))) 2)) (< .cse24 0)))))))) is different from false [2024-05-07 05:53:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:23,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-07 05:53:23,460 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-07 05:53:23,461 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-07 05:53:23,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1785299303, now seen corresponding path program 2 times [2024-05-07 05:53:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358841592] [2024-05-07 05:53:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:25,465 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-07 05:53:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358841592] [2024-05-07 05:53:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358841592] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 05:53:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492567631] [2024-05-07 05:53:25,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 05:53:25,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 05:53:25,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 05:53:25,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 05:53:25,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 05:53:25,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-07 05:53:25,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 05:53:25,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-07 05:53:25,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 05:53:25,695 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-07 05:53:25,844 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 05:53:25,844 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-07 05:53:26,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 05:53:26,416 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-07 05:53:26,572 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-07 05:53:26,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:26,669 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-07 05:53:26,699 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-07 05:53:26,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 05:53:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492567631] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 05:53:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [32] total 48 [2024-05-07 05:53:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523835321] [2024-05-07 05:53:26,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:26,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-07 05:53:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-07 05:53:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2024-05-07 05:53:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:26,701 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:26,701 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-07 05:53:26,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:26,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:26,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:26,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:28,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 05:53:28,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 05:53:28,551 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-07 05:53:28,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash -402900861, now seen corresponding path program 3 times [2024-05-07 05:53:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:28,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024898867] [2024-05-07 05:53:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:28,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:28,695 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-07 05:53:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024898867] [2024-05-07 05:53:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024898867] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 05:53:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893774611] [2024-05-07 05:53:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:28,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 05:53:28,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:28,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 05:53:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 05:53:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:28,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:28,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 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-07 05:53:28,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:28,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:28,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:28,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:28,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:29,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-07 05:53:29,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:29,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1178618859, now seen corresponding path program 4 times [2024-05-07 05:53:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039985558] [2024-05-07 05:53:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:29,136 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-07 05:53:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039985558] [2024-05-07 05:53:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039985558] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-07 05:53:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542716822] [2024-05-07 05:53:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 05:53:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 05:53:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 05:53:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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-07 05:53:29,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:29,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:29,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:29,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:29,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:29,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-07 05:53:29,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:29,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -53267319, now seen corresponding path program 5 times [2024-05-07 05:53:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:29,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929662670] [2024-05-07 05:53:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:29,535 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-07 05:53:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929662670] [2024-05-07 05:53:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929662670] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 05:53:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295409006] [2024-05-07 05:53:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:29,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 05:53:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 05:53:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 05:53:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:29,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 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-07 05:53:29,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:29,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:29,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:29,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:29,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:29,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:29,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-07 05:53:29,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:29,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash 684790823, now seen corresponding path program 6 times [2024-05-07 05:53:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:29,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427980842] [2024-05-07 05:53:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:30,089 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-07 05:53:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427980842] [2024-05-07 05:53:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427980842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:30,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-07 05:53:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570588042] [2024-05-07 05:53:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:30,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 05:53:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:30,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 05:53:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 05:53:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:30,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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-07 05:53:30,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-07 05:53:30,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:30,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1756952055, now seen corresponding path program 7 times [2024-05-07 05:53:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675800] [2024-05-07 05:53:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:30,571 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-07 05:53:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675800] [2024-05-07 05:53:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675800] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 05:53:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 05:53:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452001262] [2024-05-07 05:53:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 05:53:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 05:53:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 05:53:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:30,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 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-07 05:53:30,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:30,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:30,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:30,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:30,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-07 05:53:30,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 05:53:30,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 05:53:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 365871679, now seen corresponding path program 8 times [2024-05-07 05:53:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 05:53:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101800427] [2024-05-07 05:53:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 05:53:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 05:53:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 05:53:32,222 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-07 05:53:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 05:53:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101800427] [2024-05-07 05:53:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101800427] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 05:53:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852515376] [2024-05-07 05:53:32,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 05:53:32,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 05:53:32,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 05:53:32,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 05:53:32,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-07 05:53:32,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-07 05:53:32,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 05:53:32,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-07 05:53:32,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 05:53:32,337 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-07 05:53:32,382 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 05:53:32,382 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-07 05:53:32,855 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-07 05:53:32,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 05:53:32,929 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-07 05:53:32,947 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-07 05:53:32,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 05:53:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852515376] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 05:53:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 05:53:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [30] total 44 [2024-05-07 05:53:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752173129] [2024-05-07 05:53:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 05:53:32,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-07 05:53:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 05:53:32,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-07 05:53:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1757, Unknown=0, NotChecked=0, Total=1892 [2024-05-07 05:53:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:32,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 05:53:32,949 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-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 05:53:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 05:53:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-07 05:53:38,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 05:53:38,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 05:53:38,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 05:53:38,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 05:53:38,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-07 05:53:38,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 05:53:38,894 INFO L448 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-05-07 05:53:38,896 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 05:53:38,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 05:53:38,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:53:38 BasicIcfg [2024-05-07 05:53:38,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 05:53:38,899 INFO L158 Benchmark]: Toolchain (without parser) took 35850.74ms. Allocated memory was 179.3MB in the beginning and 823.1MB in the end (delta: 643.8MB). Free memory was 109.9MB in the beginning and 378.3MB in the end (delta: -268.5MB). Peak memory consumption was 376.1MB. Max. memory is 8.0GB. [2024-05-07 05:53:38,899 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 05:53:38,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.91ms. Allocated memory is still 179.3MB. Free memory was 109.7MB in the beginning and 97.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-07 05:53:38,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.53ms. Allocated memory is still 179.3MB. Free memory was 97.2MB in the beginning and 94.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 05:53:38,900 INFO L158 Benchmark]: Boogie Preprocessor took 38.34ms. Allocated memory is still 179.3MB. Free memory was 94.9MB in the beginning and 93.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 05:53:38,900 INFO L158 Benchmark]: RCFGBuilder took 562.93ms. Allocated memory was 179.3MB in the beginning and 286.3MB in the end (delta: 107.0MB). Free memory was 93.1MB in the beginning and 232.3MB in the end (delta: -139.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-07 05:53:38,900 INFO L158 Benchmark]: TraceAbstraction took 34997.83ms. Allocated memory was 286.3MB in the beginning and 823.1MB in the end (delta: 536.9MB). Free memory was 230.7MB in the beginning and 378.3MB in the end (delta: -147.6MB). Peak memory consumption was 388.7MB. Max. memory is 8.0GB. [2024-05-07 05:53:38,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.91ms. Allocated memory is still 179.3MB. Free memory was 109.7MB in the beginning and 97.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.53ms. Allocated memory is still 179.3MB. Free memory was 97.2MB in the beginning and 94.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.34ms. Allocated memory is still 179.3MB. Free memory was 94.9MB in the beginning and 93.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.93ms. Allocated memory was 179.3MB in the beginning and 286.3MB in the end (delta: 107.0MB). Free memory was 93.1MB in the beginning and 232.3MB in the end (delta: -139.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 34997.83ms. Allocated memory was 286.3MB in the beginning and 823.1MB in the end (delta: 536.9MB). Free memory was 230.7MB in the beginning and 378.3MB in the end (delta: -147.6MB). Peak memory consumption was 388.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 191653, independent: 191428, independent conditional: 191341, independent unconditional: 87, dependent: 225, dependent conditional: 225, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 191565, independent: 191428, independent conditional: 191341, independent unconditional: 87, dependent: 137, dependent conditional: 137, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191565, independent: 191428, independent conditional: 191341, independent unconditional: 87, dependent: 137, dependent conditional: 137, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191565, independent: 191428, independent conditional: 191341, independent unconditional: 87, dependent: 137, dependent conditional: 137, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192340, independent: 191428, independent conditional: 93372, independent unconditional: 98056, dependent: 912, dependent conditional: 600, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192340, independent: 191428, independent conditional: 55900, independent unconditional: 135528, dependent: 912, dependent conditional: 192, dependent unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192340, independent: 191428, independent conditional: 55900, independent unconditional: 135528, dependent: 912, dependent conditional: 192, dependent unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1151, independent: 1106, independent conditional: 359, independent unconditional: 747, dependent: 45, dependent conditional: 26, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1151, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 45, dependent conditional: 26, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 45, dependent conditional: 26, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 53, independent conditional: 50, independent unconditional: 3, dependent: 62, dependent conditional: 43, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 192340, independent: 190322, independent conditional: 55541, independent unconditional: 134781, dependent: 867, dependent conditional: 166, dependent unconditional: 701, unknown: 1151, unknown conditional: 385, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1106, Positive conditional cache size: 359, Positive unconditional cache size: 747, Negative cache size: 45, Negative conditional cache size: 26, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37880, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192340, independent: 191428, independent conditional: 93372, independent unconditional: 98056, dependent: 912, dependent conditional: 600, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192340, independent: 191428, independent conditional: 55900, independent unconditional: 135528, dependent: 912, dependent conditional: 192, dependent unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192340, independent: 191428, independent conditional: 55900, independent unconditional: 135528, dependent: 912, dependent conditional: 192, dependent unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1151, independent: 1106, independent conditional: 359, independent unconditional: 747, dependent: 45, dependent conditional: 26, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1151, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 45, dependent conditional: 26, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 45, dependent conditional: 26, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 53, independent conditional: 50, independent unconditional: 3, dependent: 62, dependent conditional: 43, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 192340, independent: 190322, independent conditional: 55541, independent unconditional: 134781, dependent: 867, dependent conditional: 166, dependent unconditional: 701, unknown: 1151, unknown conditional: 385, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1106, Positive conditional cache size: 359, Positive unconditional cache size: 747, Negative cache size: 45, Negative conditional cache size: 26, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37880 ], Independence queries for same thread: 88 - 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: 34.9s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 11.2s, 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: 158, 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.5s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 2219 NumberOfCodeBlocks, 2187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2371 ConstructedInterpolants, 88 QuantifiedInterpolants, 24216 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1043 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 70/93 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.4s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 05:53:38,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-07 05:53:39,150 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...