/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:07:27,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:07:28,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:07:28,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:07:28,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:07:28,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:07:28,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:07:28,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:07:28,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:07:28,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:07:28,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:07:28,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:07:28,070 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:07:28,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:07:28,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:07:28,071 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:07:28,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:07:28,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:07:28,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:07:28,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:07:28,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:07:28,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:07:28,073 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:07:28,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:07:28,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:07:28,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:07:28,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:07:28,074 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:07:28,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:07:28,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:07:28,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:07:28,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:07:28,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:07:28,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:07:28,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:07:28,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:07:28,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:07:28,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:07:28,077 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:07:28,077 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:07:28,077 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/UAutomizer-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 -> PSEUDO_LOCKSTEP [2023-11-17 18:07:28,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:07:28,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:07:28,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:07:28,351 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:07:28,352 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:07:28,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-11-17 18:07:29,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:07:29,846 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:07:29,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-11-17 18:07:29,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9858fbe/e2613f003045439d881d364acabf2cc3/FLAG7bce4f988 [2023-11-17 18:07:29,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9858fbe/e2613f003045439d881d364acabf2cc3 [2023-11-17 18:07:29,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:07:29,881 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:07:29,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:07:29,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:07:29,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:07:29,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:07:29" (1/1) ... [2023-11-17 18:07:29,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a40a841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:29, skipping insertion in model container [2023-11-17 18:07:29,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:07:29" (1/1) ... [2023-11-17 18:07:29,923 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:07:30,089 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-min-max-1.wvr.c[3096,3109] [2023-11-17 18:07:30,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:07:30,110 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:07:30,130 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-min-max-1.wvr.c[3096,3109] [2023-11-17 18:07:30,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:07:30,141 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:07:30,141 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:07:30,147 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:07:30,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30 WrapperNode [2023-11-17 18:07:30,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:07:30,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:07:30,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:07:30,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:07:30,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,190 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-11-17 18:07:30,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:07:30,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:07:30,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:07:30,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:07:30,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:07:30,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:07:30,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:07:30,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:07:30,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (1/1) ... [2023-11-17 18:07:30,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:07:30,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:30,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 18:07:30,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 18:07:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:07:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:07:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:07:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:07:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:07:30,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:07:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:07:30,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:07:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 18:07:30,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 18:07:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:07:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 18:07:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 18:07:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:07:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:07:30,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:07:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:07:30,324 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 18:07:30,464 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:07:30,466 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:07:30,878 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:07:30,941 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:07:30,942 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 18:07:30,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:07:30 BoogieIcfgContainer [2023-11-17 18:07:30,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:07:30,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:07:30,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:07:30,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:07:30,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:07:29" (1/3) ... [2023-11-17 18:07:30,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114760f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:07:30, skipping insertion in model container [2023-11-17 18:07:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:07:30" (2/3) ... [2023-11-17 18:07:30,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114760f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:07:30, skipping insertion in model container [2023-11-17 18:07:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:07:30" (3/3) ... [2023-11-17 18:07:30,951 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2023-11-17 18:07:30,960 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:07:30,969 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:07:30,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:07:30,970 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:07:31,066 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 18:07:31,116 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:07:31,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:07:31,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:31,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 18:07:31,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 18:07:31,179 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:07:31,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:07:31,204 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;@41db9424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:07:31,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 18:07:31,522 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)] === [2023-11-17 18:07:31,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:31,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1920779197, now seen corresponding path program 1 times [2023-11-17 18:07:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552843837] [2023-11-17 18:07:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-17 18:07:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552843837] [2023-11-17 18:07:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552843837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:07:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:07:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:07:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909980109] [2023-11-17 18:07:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:07:31,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:07:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:07:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:07:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:31,891 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:31,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 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) [2023-11-17 18:07:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:31,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:07:31,948 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)] === [2023-11-17 18:07:31,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash -124555887, now seen corresponding path program 1 times [2023-11-17 18:07:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553907034] [2023-11-17 18:07:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:31,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-17 18:07:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553907034] [2023-11-17 18:07:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553907034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:07:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:07:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 18:07:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989668504] [2023-11-17 18:07:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:07:32,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 18:07:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 18:07:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 18:07:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:32,390 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:32,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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) [2023-11-17 18:07:32,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:32,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:32,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 18:07:32,553 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)] === [2023-11-17 18:07:32,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1896427152, now seen corresponding path program 1 times [2023-11-17 18:07:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051245079] [2023-11-17 18:07:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 18:07:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:33,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051245079] [2023-11-17 18:07:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051245079] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:07:33,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305590171] [2023-11-17 18:07:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:33,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:33,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:33,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:07:33,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 18:07:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:33,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 18:07:33,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:07:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 18:07:33,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:07:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 18:07:33,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305590171] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:07:33,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:07:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-17 18:07:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390162521] [2023-11-17 18:07:33,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:07:33,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 18:07:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 18:07:33,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-17 18:07:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:33,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:33,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 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) [2023-11-17 18:07:33,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:33,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:33,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:34,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 18:07:34,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-17 18:07:34,438 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)] === [2023-11-17 18:07:34,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1477869425, now seen corresponding path program 2 times [2023-11-17 18:07:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441633310] [2023-11-17 18:07:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 18:07:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441633310] [2023-11-17 18:07:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441633310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:07:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527375599] [2023-11-17 18:07:34,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:07:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:34,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:07:34,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 18:07:35,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:07:35,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:07:35,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 18:07:35,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:07:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:07:35,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:07:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:07:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527375599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:07:35,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:07:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2023-11-17 18:07:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041997348] [2023-11-17 18:07:35,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:07:35,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 18:07:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 18:07:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2023-11-17 18:07:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:35,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:35,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.088235294117647) internal successors, (309), 34 states have internal predecessors, (309), 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) [2023-11-17 18:07:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:07:36,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 18:07:37,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:37,029 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)] === [2023-11-17 18:07:37,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 183469680, now seen corresponding path program 3 times [2023-11-17 18:07:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514767869] [2023-11-17 18:07:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 18:07:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514767869] [2023-11-17 18:07:37,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514767869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:07:37,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726290294] [2023-11-17 18:07:37,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:07:37,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:37,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:37,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:07:37,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 18:07:37,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-17 18:07:37,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:07:37,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 18:07:37,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:07:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 18:07:38,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:07:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 18:07:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726290294] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:07:38,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:07:38,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 49 [2023-11-17 18:07:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087001541] [2023-11-17 18:07:38,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:07:38,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-17 18:07:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:38,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-17 18:07:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2020, Unknown=0, NotChecked=0, Total=2352 [2023-11-17 18:07:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:38,959 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:38,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.142857142857143) internal successors, (350), 49 states have internal predecessors, (350), 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) [2023-11-17 18:07:38,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:38,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:38,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:38,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:07:38,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:07:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 18:07:39,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-17 18:07:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:39,813 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)] === [2023-11-17 18:07:39,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -464210799, now seen corresponding path program 4 times [2023-11-17 18:07:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765208852] [2023-11-17 18:07:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-17 18:07:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765208852] [2023-11-17 18:07:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765208852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:07:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287388186] [2023-11-17 18:07:41,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 18:07:41,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:41,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:41,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:07:41,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 18:07:41,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 18:07:41,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:07:41,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 18:07:41,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:07:42,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:07:42,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 18:07:42,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:07:42,535 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 69 treesize of output 52 [2023-11-17 18:07:42,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:07:42,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 61 treesize of output 45 [2023-11-17 18:07:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-17 18:07:42,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:07:47,496 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (let ((.cse2 (forall ((v_ArrVal_182 (Array Int Int))) (< c_~max~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))) (.cse3 (+ c_~max~0 1)) (.cse0 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ c_~min~0 1))) (and (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 c_~max~0) (< c_~min~0 (+ .cse1 1))))) (or .cse2 (< c_~min~0 .cse3)))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse4 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse4) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 c_~max~0) (< .cse4 (+ .cse5 1)))))))) (or .cse2 (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse6 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse6) (< .cse6 .cse3)))))))) is different from false [2023-11-17 18:07:47,874 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse1 c_~A~0.offset))) (and (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse0) (< .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))))) (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4)))) (.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (< .cse3 (+ .cse4 1)) (< .cse2 (+ 2 .cse4))))) (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (< (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ c_~min~0 1))) (and (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse3 (+ .cse5 1)) (< c_~min~0 (+ 2 .cse5))))) (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-11-17 18:07:48,232 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse3 c_~A~0.offset)) (.cse0 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (and (let ((.cse1 (+ c_~min~0 1))) (or (< .cse0 .cse1) (and (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse2) (< .cse2 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))))) (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4)))) (.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse4) (< .cse5 (+ .cse6 1)) (< .cse4 (+ 2 .cse6))))) (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (< (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) .cse1)) (and (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 (+ .cse7 1)) (< c_~min~0 (+ 2 .cse7))))) (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))))) (or (< c_~min~0 .cse0) (and (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_1 Int)) (let ((.cse8 (select .cse3 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (< .cse8 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< .cse0 .cse8)))) (or (forall ((v_subst_2 Int)) (< (select .cse3 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse0 1))) (and (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 2 .cse9)) (< .cse5 (+ .cse9 1))))) (forall ((v_ArrVal_182 (Array Int Int))) (< .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))))) (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_3 Int)) (let ((.cse11 (select .cse3 (+ c_~A~0.offset (* 4 v_subst_3)))) (.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 (+ .cse10 1)) (< .cse0 .cse11) (< .cse11 (+ 2 .cse10)))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-11-17 18:07:48,414 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) (.cse7 (+ c_~min~0 1))) (and (forall ((v_ArrVal_181 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse0 (select .cse3 c_~A~0.base))) (let ((.cse1 (select .cse0 .cse4))) (or (< (select .cse0 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse1 1)) (< c_~min~0 .cse1) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 (+ .cse2 2)) (< (select .cse0 c_~A~0.offset) (+ .cse2 1)))))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_42 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse6 (select .cse5 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))) (< (select .cse6 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_42 4))) .cse7) (< (select .cse6 .cse4) .cse7))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse11 (select .cse12 c_~A~0.base))) (let ((.cse8 (select .cse11 .cse4))) (or (< c_~min~0 .cse8) (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_3 Int)) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset)) (.cse9 (select .cse11 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse9 (+ .cse10 2)) (< (select .cse11 c_~A~0.offset) (+ .cse10 1)) (< .cse8 .cse9))))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_42 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse13 (select .cse15 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse13 c_~A~0.offset) (+ .cse14 1)) (< c_~min~0 (+ .cse14 2))))) (< (select .cse13 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_42 4))) .cse7) (< (select .cse13 .cse4) .cse7))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse19 (select .cse18 c_~A~0.base))) (let ((.cse16 (select .cse19 .cse4))) (or (< c_~min~0 .cse16) (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_1 Int)) (let ((.cse17 (select .cse19 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (< .cse17 (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< .cse16 .cse17))))))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse20 (select .cse23 c_~A~0.base))) (or (< (select .cse20 .cse4) .cse7) (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse22 (select .cse20 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4)))) (.cse21 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse20 c_~A~0.offset) (+ .cse21 1)) (< c_~min~0 .cse22) (< .cse22 (+ .cse21 2))))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_subst_2 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse24 (select .cse26 c_~A~0.base))) (let ((.cse25 (select .cse24 .cse4))) (or (< (select .cse24 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse25 1)) (< c_~min~0 .cse25) (forall ((v_ArrVal_182 (Array Int Int))) (< .cse25 (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse27 (select .cse29 c_~A~0.base))) (or (< (select .cse27 .cse4) .cse7) (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse28 (select .cse27 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse28 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< c_~min~0 .cse28)))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-11-17 18:07:48,919 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~min~0 1))) (and (forall ((v_ArrVal_181 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_42 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse1 (select .cse0 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))) (< (select .cse1 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_42 4))) .cse2) (< (select .cse1 c_~A~0.offset) .cse2))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_42 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse4 c_~A~0.base))) (or (< (select .cse3 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_42 4))) .cse2) (< (select .cse3 c_~A~0.offset) .cse2) (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_subst_2 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse7 (select .cse6 c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset))) (or (forall ((v_ArrVal_182 (Array Int Int))) (< .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))) (< (select .cse7 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse5 1)) (< c_~min~0 .cse5)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse10 (select .cse9 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse8 (select .cse10 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse8) (< .cse8 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))) (< (select .cse10 c_~A~0.offset) .cse2))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse11 (select .cse13 c_~A~0.base))) (let ((.cse12 (select .cse11 c_~A~0.offset))) (or (< (select .cse11 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse12 1)) (forall ((v_ArrVal_182 (Array Int Int))) (< .cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))) (< c_~min~0 .cse12)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse16 (select .cse15 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse14 (select .cse16 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse14 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< c_~min~0 .cse14)))) (< (select .cse16 c_~A~0.offset) .cse2))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse20 (select .cse19 c_~A~0.base))) (let ((.cse17 (select .cse20 c_~A~0.offset))) (or (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_1 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (< .cse17 .cse18) (< .cse18 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))))) (< c_~min~0 .cse17)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse24 (select .cse22 c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_3 Int)) (let ((.cse21 (select .cse24 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse21 (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2)) (< .cse23 .cse21)))) (< c_~min~0 .cse23)))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-11-17 18:07:49,145 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~min~0 1))) (and (forall ((v_ArrVal_181 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_42 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse1 (select .cse0 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))) (< (select .cse1 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_42 4))) .cse2) (< (select .cse1 c_~A~0.offset) .cse2))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_thread1Thread1of1ForFork2_~i~0_42 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse4 c_~A~0.base))) (or (< (select .cse3 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_42 4))) .cse2) (< (select .cse3 c_~A~0.offset) .cse2) (forall ((v_ArrVal_182 (Array Int Int))) (< c_~min~0 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_subst_2 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse7 (select .cse6 c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset))) (or (forall ((v_ArrVal_182 (Array Int Int))) (< .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))) (< (select .cse7 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse5 1)) (< c_~min~0 .cse5)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse10 (select .cse9 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse8 (select .cse10 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse8) (< .cse8 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))) (< (select .cse10 c_~A~0.offset) .cse2))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse11 (select .cse13 c_~A~0.base))) (let ((.cse12 (select .cse11 c_~A~0.offset))) (or (< (select .cse11 (+ c_~A~0.offset (* 4 v_subst_2))) (+ .cse12 1)) (forall ((v_ArrVal_182 (Array Int Int))) (< .cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))) (< c_~min~0 .cse12)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse16 (select .cse15 c_~A~0.base))) (or (forall ((v_ArrVal_182 (Array Int Int)) (thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse14 (select .cse16 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse14 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< c_~min~0 .cse14)))) (< (select .cse16 c_~A~0.offset) .cse2))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse20 (select .cse19 c_~A~0.base))) (let ((.cse17 (select .cse20 c_~A~0.offset))) (or (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_1 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* 4 v_subst_1))))) (or (< .cse17 .cse18) (< .cse18 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1))))) (< c_~min~0 .cse17)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181))) (let ((.cse24 (select .cse22 c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (forall ((v_ArrVal_182 (Array Int Int)) (v_subst_3 Int)) (let ((.cse21 (select .cse24 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse21 (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2)) (< .cse23 .cse21)))) (< c_~min~0 .cse23)))))))) is different from false [2023-11-17 18:07:49,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:07:49,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 430 treesize of output 342 [2023-11-17 18:07:49,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:07:49,292 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 88 treesize of output 72 [2023-11-17 18:07:49,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-17 18:07:49,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,329 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2023-11-17 18:07:49,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,347 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 1 [2023-11-17 18:07:49,350 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,354 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 1 [2023-11-17 18:07:49,360 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,368 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2023-11-17 18:07:49,372 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,376 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 1 [2023-11-17 18:07:49,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,387 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 1 [2023-11-17 18:07:49,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:07:49,395 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 18:07:49,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 1 [2023-11-17 18:07:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 72 trivial. 19 not checked. [2023-11-17 18:07:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287388186] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:07:49,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:07:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 21] total 49 [2023-11-17 18:07:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807326358] [2023-11-17 18:07:49,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:07:49,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-17 18:07:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:49,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-17 18:07:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1633, Unknown=17, NotChecked=522, Total=2352 [2023-11-17 18:07:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:49,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:49,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 9.673469387755102) internal successors, (474), 49 states have internal predecessors, (474), 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) [2023-11-17 18:07:49,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:49,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:49,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:49,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:07:49,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-17 18:07:49,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-17 18:07:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:07:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 18:07:54,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 18:07:54,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:54,298 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)] === [2023-11-17 18:07:54,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 887051043, now seen corresponding path program 1 times [2023-11-17 18:07:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195564973] [2023-11-17 18:07:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-17 18:07:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:54,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195564973] [2023-11-17 18:07:54,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195564973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:07:54,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354122941] [2023-11-17 18:07:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:54,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:54,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:07:54,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 18:07:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:54,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 18:07:54,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:07:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:07:55,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:07:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:07:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354122941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:07:55,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:07:55,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 19] total 39 [2023-11-17 18:07:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457067062] [2023-11-17 18:07:55,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:07:55,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-17 18:07:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-17 18:07:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2023-11-17 18:07:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:55,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:55,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.871794871794872) internal successors, (346), 39 states have internal predecessors, (346), 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) [2023-11-17 18:07:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-11-17 18:07:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:07:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 18:07:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-17 18:07:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:07:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 18:07:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:07:56,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 18:07:57,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:57,097 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)] === [2023-11-17 18:07:57,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:07:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1763856455, now seen corresponding path program 5 times [2023-11-17 18:07:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:07:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259176886] [2023-11-17 18:07:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:07:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:07:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:07:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-17 18:07:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:07:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259176886] [2023-11-17 18:07:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259176886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:07:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957884193] [2023-11-17 18:07:57,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 18:07:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:07:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:07:57,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:07:57,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 18:07:57,549 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-17 18:07:57,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:07:57,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 18:07:57,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:07:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:07:57,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:07:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:07:57,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957884193] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:07:57,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:07:57,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2023-11-17 18:07:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13144479] [2023-11-17 18:07:57,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:07:57,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 18:07:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:07:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 18:07:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2023-11-17 18:07:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:58,000 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:07:58,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.642857142857142) internal successors, (298), 28 states have internal predecessors, (298), 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) [2023-11-17 18:07:58,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:07:58,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 18:08:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:08:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-17 18:08:00,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 18:08:00,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:08:00,214 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)] === [2023-11-17 18:08:00,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:08:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813241, now seen corresponding path program 6 times [2023-11-17 18:08:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:08:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653363591] [2023-11-17 18:08:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:08:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:08:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:08:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-17 18:08:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:08:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653363591] [2023-11-17 18:08:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653363591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:08:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032847524] [2023-11-17 18:08:00,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 18:08:00,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:08:00,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:08:00,701 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:08:00,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 18:08:00,879 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-17 18:08:00,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:08:00,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 18:08:00,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:08:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-17 18:08:01,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:08:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-17 18:08:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032847524] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:08:01,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:08:01,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 8] total 31 [2023-11-17 18:08:01,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594978461] [2023-11-17 18:08:01,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:08:01,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 18:08:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:08:01,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 18:08:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2023-11-17 18:08:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:01,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:08:01,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.451612903225806) internal successors, (355), 31 states have internal predecessors, (355), 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) [2023-11-17 18:08:01,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:01,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-17 18:08:01,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-17 18:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:08:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-17 18:08:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-11-17 18:08:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:08:04,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 18:08:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-17 18:08:04,477 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)] === [2023-11-17 18:08:04,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:08:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash -692469683, now seen corresponding path program 7 times [2023-11-17 18:08:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:08:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776654400] [2023-11-17 18:08:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:08:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:08:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:08:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-17 18:08:05,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:08:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776654400] [2023-11-17 18:08:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776654400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:08:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943184630] [2023-11-17 18:08:05,084 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 18:08:05,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:08:05,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:08:05,085 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:08:05,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 18:08:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:08:05,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 18:08:05,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:08:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-17 18:08:05,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:08:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-17 18:08:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943184630] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:08:05,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:08:05,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2023-11-17 18:08:05,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666746479] [2023-11-17 18:08:05,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:08:05,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 18:08:05,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:08:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 18:08:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-17 18:08:05,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:05,582 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:08:05,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.846153846153847) internal successors, (245), 13 states have internal predecessors, (245), 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) [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-17 18:08:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-11-17 18:08:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-17 18:08:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 18:08:12,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 18:08:12,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 18:08:12,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 18:08:12,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 18:08:12,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 18:08:12,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 18:08:12,316 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2023-11-17 18:08:12,318 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 18:08:12,319 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 18:08:12,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:08:12 BasicIcfg [2023-11-17 18:08:12,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 18:08:12,323 INFO L158 Benchmark]: Toolchain (without parser) took 42441.69ms. Allocated memory was 327.2MB in the beginning and 815.8MB in the end (delta: 488.6MB). Free memory was 278.6MB in the beginning and 603.1MB in the end (delta: -324.6MB). Peak memory consumption was 164.8MB. Max. memory is 8.0GB. [2023-11-17 18:08:12,323 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:08:12,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.79ms. Allocated memory is still 327.2MB. Free memory was 278.2MB in the beginning and 266.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 18:08:12,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.84ms. Allocated memory is still 327.2MB. Free memory was 266.2MB in the beginning and 264.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:08:12,324 INFO L158 Benchmark]: Boogie Preprocessor took 44.47ms. Allocated memory is still 327.2MB. Free memory was 264.2MB in the beginning and 262.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 18:08:12,324 INFO L158 Benchmark]: RCFGBuilder took 707.55ms. Allocated memory is still 327.2MB. Free memory was 262.5MB in the beginning and 239.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 18:08:12,325 INFO L158 Benchmark]: TraceAbstraction took 41376.79ms. Allocated memory was 327.2MB in the beginning and 815.8MB in the end (delta: 488.6MB). Free memory was 238.7MB in the beginning and 603.1MB in the end (delta: -364.4MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. [2023-11-17 18:08:12,326 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.14ms. Allocated memory is still 218.1MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.79ms. Allocated memory is still 327.2MB. Free memory was 278.2MB in the beginning and 266.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.84ms. Allocated memory is still 327.2MB. Free memory was 266.2MB in the beginning and 264.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.47ms. Allocated memory is still 327.2MB. Free memory was 264.2MB in the beginning and 262.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 707.55ms. Allocated memory is still 327.2MB. Free memory was 262.5MB in the beginning and 239.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 41376.79ms. Allocated memory was 327.2MB in the beginning and 815.8MB in the end (delta: 488.6MB). Free memory was 238.7MB in the beginning and 603.1MB in the end (delta: -364.4MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 133912, independent: 118983, independent conditional: 116919, independent unconditional: 2064, dependent: 14929, dependent conditional: 14900, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119087, independent: 118983, independent conditional: 116919, independent unconditional: 2064, dependent: 104, dependent conditional: 75, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119087, independent: 118983, independent conditional: 116919, independent unconditional: 2064, dependent: 104, dependent conditional: 75, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125939, independent: 118983, independent conditional: 2171, independent unconditional: 116812, dependent: 6956, dependent conditional: 4681, dependent unconditional: 2275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125939, independent: 118983, independent conditional: 2171, independent unconditional: 116812, dependent: 6956, dependent conditional: 2976, dependent unconditional: 3980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125939, independent: 118983, independent conditional: 2171, independent unconditional: 116812, dependent: 6956, dependent conditional: 2976, dependent unconditional: 3980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2071, independent: 1844, independent conditional: 74, independent unconditional: 1770, dependent: 227, dependent conditional: 198, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2071, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 303, independent: 76, independent conditional: 74, independent unconditional: 2, dependent: 227, dependent conditional: 198, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 303, independent: 76, independent conditional: 74, independent unconditional: 2, dependent: 227, dependent conditional: 198, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1344, independent: 369, independent conditional: 315, independent unconditional: 54, dependent: 975, dependent conditional: 863, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125939, independent: 117139, independent conditional: 2097, independent unconditional: 115042, dependent: 6729, dependent conditional: 2778, dependent unconditional: 3951, unknown: 2071, unknown conditional: 272, unknown unconditional: 1799] , Statistics on independence cache: Total cache size (in pairs): 2071, Positive cache size: 1844, Positive conditional cache size: 74, Positive unconditional cache size: 1770, Negative cache size: 227, Negative conditional cache size: 198, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1705, Maximal queried relation: 5, Independence queries for same thread: 14825 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1484, Number of trivial persistent sets: 1211, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2093, independent: 2064, independent conditional: 0, independent unconditional: 2064, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 133912, independent: 118983, independent conditional: 116919, independent unconditional: 2064, dependent: 14929, dependent conditional: 14900, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119087, independent: 118983, independent conditional: 116919, independent unconditional: 2064, dependent: 104, dependent conditional: 75, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119087, independent: 118983, independent conditional: 116919, independent unconditional: 2064, dependent: 104, dependent conditional: 75, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125939, independent: 118983, independent conditional: 2171, independent unconditional: 116812, dependent: 6956, dependent conditional: 4681, dependent unconditional: 2275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125939, independent: 118983, independent conditional: 2171, independent unconditional: 116812, dependent: 6956, dependent conditional: 2976, dependent unconditional: 3980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125939, independent: 118983, independent conditional: 2171, independent unconditional: 116812, dependent: 6956, dependent conditional: 2976, dependent unconditional: 3980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2071, independent: 1844, independent conditional: 74, independent unconditional: 1770, dependent: 227, dependent conditional: 198, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2071, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 303, independent: 76, independent conditional: 74, independent unconditional: 2, dependent: 227, dependent conditional: 198, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 303, independent: 76, independent conditional: 74, independent unconditional: 2, dependent: 227, dependent conditional: 198, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1344, independent: 369, independent conditional: 315, independent unconditional: 54, dependent: 975, dependent conditional: 863, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125939, independent: 117139, independent conditional: 2097, independent unconditional: 115042, dependent: 6729, dependent conditional: 2778, dependent unconditional: 3951, unknown: 2071, unknown conditional: 272, unknown unconditional: 1799] , Statistics on independence cache: Total cache size (in pairs): 2071, Positive cache size: 1844, Positive conditional cache size: 74, Positive unconditional cache size: 1770, Negative cache size: 227, Negative conditional cache size: 198, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1705, Maximal queried relation: 5, Independence queries for same thread: 14825 - PositiveResult [Line: 115]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 208 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 19.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 568, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 3463 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 5002 ConstructedInterpolants, 28 QuantifiedInterpolants, 22154 SizeOfPredicates, 127 NumberOfNonLiveVariables, 3253 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 1397/2021 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-17 18:08:12,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-17 18:08:12,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...