/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/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:29:08,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:29:08,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:29:08,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:29:08,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:29:08,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:29:08,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:29:08,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:29:08,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:29:08,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:29:08,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:29:08,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:29:08,603 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:29:08,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:29:08,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:29:08,605 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:29:08,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:29:08,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:29:08,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:29:08,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:29:08,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:29:08,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:29:08,607 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:29:08,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:29:08,607 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:29:08,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:29:08,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:29:08,608 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:29:08,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:29:08,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:29:08,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:29:08,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:29:08,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:29:08,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:29:08,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:29:08,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:29:08,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:29:08,611 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:29:08,611 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:29:08,611 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:29:08,611 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:29:08,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:29:08,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:29:08,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:29:08,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:29:08,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:29:08,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 18:29:10,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:29:10,298 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:29:10,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 18:29:10,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ae72090/2ca6ff5e168b4ceca74b08ec7a54bb49/FLAG1fada5c96 [2023-11-17 18:29:10,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ae72090/2ca6ff5e168b4ceca74b08ec7a54bb49 [2023-11-17 18:29:10,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:29:10,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:29:10,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:29:10,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:29:10,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:29:10,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcf4e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10, skipping insertion in model container [2023-11-17 18:29:10,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,365 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:29:10,533 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 18:29:10,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:29:10,551 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:29:10,578 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 18:29:10,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:29:10,590 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:29:10,591 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:29:10,597 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:29:10,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10 WrapperNode [2023-11-17 18:29:10,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:29:10,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:29:10,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:29:10,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:29:10,611 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:29:10" (1/1) ... [2023-11-17 18:29:10,621 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:29:10" (1/1) ... [2023-11-17 18:29:10,640 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 18:29:10,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:29:10,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:29:10,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:29:10,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:29:10,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:29:10,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:29:10,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:29:10,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:29:10,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (1/1) ... [2023-11-17 18:29:10,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:29:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:29:10,708 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:29:10,714 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:29:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:29:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:29:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:29:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:29:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:29:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 18:29:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 18:29:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:29:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:29:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:29:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 18:29:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 18:29:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:29:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:29:10,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:29:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:29:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:29:10,738 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:29:10,823 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:29:10,825 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:29:11,079 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:29:11,152 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:29:11,152 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 18:29:11,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:29:11 BoogieIcfgContainer [2023-11-17 18:29:11,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:29:11,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:29:11,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:29:11,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:29:11,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:29:10" (1/3) ... [2023-11-17 18:29:11,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e08d236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:29:11, skipping insertion in model container [2023-11-17 18:29:11,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:29:10" (2/3) ... [2023-11-17 18:29:11,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e08d236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:29:11, skipping insertion in model container [2023-11-17 18:29:11,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:29:11" (3/3) ... [2023-11-17 18:29:11,163 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-11-17 18:29:11,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:29:11,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:29:11,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:29:11,180 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:29:11,251 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 18:29:11,290 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:29:11,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:29:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:29:11,297 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:29:11,335 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:29:11,355 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:29:11,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:29:11,371 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;@3fcc45b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:29:11,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 18:29:11,664 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:29:11,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:29:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1043430592, now seen corresponding path program 1 times [2023-11-17 18:29:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:29:11,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753712472] [2023-11-17 18:29:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:11,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:29:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-17 18:29:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:29:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753712472] [2023-11-17 18:29:11,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753712472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:29:11,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:29:11,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:29:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976238817] [2023-11-17 18:29:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:29:11,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:29:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:29:11,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:29:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:29:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:11,983 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:29:11,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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:29:11,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:12,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:29:12,050 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:29:12,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:29:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1944192509, now seen corresponding path program 1 times [2023-11-17 18:29:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:29:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421853889] [2023-11-17 18:29:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:29:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 18:29:12,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:29:12,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421853889] [2023-11-17 18:29:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421853889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:29:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:29:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 18:29:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062678194] [2023-11-17 18:29:12,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:29:12,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 18:29:12,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:29:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 18:29:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 18:29:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:12,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:29:12,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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:29:12,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:12,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:29:12,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 18:29:12,628 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:29:12,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:29:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1205075594, now seen corresponding path program 1 times [2023-11-17 18:29:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:29:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784699410] [2023-11-17 18:29:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:29:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:29:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:29:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784699410] [2023-11-17 18:29:13,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784699410] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:29:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519718233] [2023-11-17 18:29:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:13,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:29:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:29:13,107 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:29:13,115 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:29:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:13,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 18:29:13,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:29:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:29:13,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:29:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:29:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519718233] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:29:13,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:29:13,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-17 18:29:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112735376] [2023-11-17 18:29:13,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:29:13,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 18:29:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:29:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 18:29:13,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-17 18:29:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:13,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:29:13,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 24 states have internal predecessors, (196), 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:29:13,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:13,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:29:13,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:29:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:29:14,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 18:29:14,344 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:29:14,344 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:29:14,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:29:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash -794594321, now seen corresponding path program 2 times [2023-11-17 18:29:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:29:14,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697616648] [2023-11-17 18:29:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:29:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:29:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:29:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697616648] [2023-11-17 18:29:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697616648] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:29:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925891483] [2023-11-17 18:29:14,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:29:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:29:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:29:14,699 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:29:14,726 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:29:14,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-17 18:29:14,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:29:14,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 18:29:14,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:29:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-17 18:29:15,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 18:29:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925891483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:29:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 18:29:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2023-11-17 18:29:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372402719] [2023-11-17 18:29:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:29:15,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 18:29:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:29:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 18:29:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-17 18:29:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:15,117 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:29:15,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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:29:15,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:15,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:29:15,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:29:15,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:29:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:29:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:29:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:29:15,284 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:29:15,484 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:29:15,484 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:29:15,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:29:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1967343428, now seen corresponding path program 1 times [2023-11-17 18:29:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:29:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992398469] [2023-11-17 18:29:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:29:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:29:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:29:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992398469] [2023-11-17 18:29:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992398469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:29:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624113624] [2023-11-17 18:29:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:29:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:29:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:29:20,354 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:29:20,381 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:29:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:29:20,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-17 18:29:20,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:29:20,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-17 18:29:20,619 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 18:29:20,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-17 18:29:20,897 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-17 18:29:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 18:29:22,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-17 18:29:23,519 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 133 treesize of output 104 [2023-11-17 18:29:24,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:24,624 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 160 treesize of output 82 [2023-11-17 18:29:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:29:25,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:29:31,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (= c_~min1~0 c_~min3~0)) (.cse31 (+ c_~min3~0 1)) (.cse69 (= c_~min2~0 c_~min1~0)) (.cse5 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_#t~post1| 4) 4)) (.cse3 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse4 (select .cse2 c_~A~0.base))) (let ((.cse0 (select .cse4 c_~A~0.offset)) (.cse1 (select .cse4 .cse5))) (or (= .cse0 .cse1) (< c_~min2~0 (+ .cse0 1)) (< c_~min3~0 .cse0) (< c_~min1~0 (+ .cse1 1)) (< (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse7 (select .cse8 c_~A~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (= c_~min2~0 .cse6) (= c_~min3~0 .cse6) (< (select .cse7 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse6 1)) (< (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse13 (select .cse12 c_~A~0.base))) (let ((.cse9 (select .cse13 c_~A~0.offset)) (.cse10 (select .cse13 .cse5))) (or (= .cse9 .cse10) (< c_~min2~0 (+ .cse9 1)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse11 1)) (= .cse11 .cse10)))) (< c_~min1~0 (+ .cse10 1))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse15 (select .cse17 c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5))) (or (= c_~min2~0 .cse14) (< (select .cse15 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse14 1)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse16 1)) (< .cse16 c_~min2~0))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse19 (select .cse22 c_~A~0.base))) (let ((.cse18 (select .cse19 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse18 1)) (< (select .cse19 .cse5) c_~min1~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (let ((.cse20 (+ .cse21 1))) (or (< c_~min3~0 .cse20) (= c_~min1~0 .cse21) (< .cse18 .cse20)))))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse26 (select .cse25 c_~A~0.base))) (let ((.cse24 (select .cse26 c_~A~0.offset)) (.cse23 (select .cse26 .cse5))) (or (= c_~min3~0 .cse23) (= .cse24 .cse23) (< c_~min2~0 (+ .cse24 1)) (< c_~min1~0 (+ .cse23 1)) (< (select (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse28 (select .cse29 c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse27 1)) (= c_~min1~0 .cse27) (< (select .cse28 .cse5) c_~min1~0) (< c_~min3~0 .cse27) (< (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse32 (select .cse33 c_~A~0.base))) (let ((.cse30 (select .cse32 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse30 1)) (< .cse30 .cse31) (< (select .cse32 .cse5) c_~min1~0) (< (select (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) .cse34) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse39 (select .cse38 c_~A~0.base))) (let ((.cse37 (select .cse39 .cse5))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse36 (select (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (let ((.cse35 (+ .cse36 1))) (or (< c_~min3~0 .cse35) (= .cse36 .cse37) (< c_~min2~0 .cse35))))) (< (select .cse39 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse37 1))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse44 (select .cse43 c_~A~0.base))) (let ((.cse40 (select .cse44 c_~A~0.offset)) (.cse41 (select .cse44 .cse5))) (or (= .cse40 .cse41) (< c_~min2~0 (+ .cse40 1)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse42 1)) (< .cse42 .cse40)))) (< c_~min1~0 (+ .cse41 1))))))) (or .cse34 (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse46 (select .cse47 c_~A~0.base))) (let ((.cse45 (select .cse46 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse45 1)) (= c_~min1~0 .cse45) (< (select .cse46 .cse5) c_~min1~0) (< (select (select (store .cse47 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse48 (select .cse51 c_~A~0.base))) (or (< (select .cse48 .cse5) c_~min1~0) (< (select .cse48 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (let ((.cse49 (+ .cse50 1))) (or (< c_~min3~0 .cse49) (= c_~min1~0 .cse50) (< c_~min2~0 .cse49))))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse55 (select .cse54 c_~A~0.base))) (let ((.cse53 (select .cse55 c_~A~0.offset)) (.cse52 (select .cse55 .cse5))) (or (= c_~min3~0 .cse52) (< c_~min2~0 (+ .cse53 1)) (< .cse53 .cse31) (< c_~min1~0 (+ .cse52 1)) (< (select (select (store .cse54 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse57 (select .cse58 c_~A~0.base))) (let ((.cse56 (select .cse57 .cse5))) (or (= c_~min2~0 .cse56) (< (select .cse57 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse56 1)) (< (select (select (store .cse58 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse60 (select .cse62 c_~A~0.base))) (let ((.cse59 (select .cse60 .cse5))) (or (= c_~min2~0 .cse59) (< (select .cse60 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse61 (select (select (store .cse62 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse61 1)) (= .cse61 .cse59)))) (< c_~min1~0 (+ .cse59 1))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse68 (select .cse67 c_~A~0.base))) (let ((.cse64 (select .cse68 c_~A~0.offset)) (.cse66 (select .cse68 .cse5))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse65 (select (select (store .cse67 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (let ((.cse63 (+ .cse65 1))) (or (< c_~min3~0 .cse63) (< .cse64 .cse63) (= .cse65 .cse66))))) (< c_~min2~0 (+ .cse64 1)) (< c_~min1~0 (+ .cse66 1))))))) (or (and .cse69 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse70 (select .cse71 c_~A~0.base))) (or (< (select .cse70 .cse5) c_~min1~0) (< (select .cse70 c_~A~0.offset) c_~min2~0) (< (select (select (store .cse71 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0))))) (and .cse34 (<= .cse31 c_~min2~0))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse73 (select .cse74 c_~A~0.base))) (let ((.cse72 (select .cse73 .cse5))) (or (= c_~min3~0 .cse72) (< (select .cse73 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse72 1)) (< (select (select (store .cse74 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3) c_~min3~0)))))) (< c_~min2~0 .cse31)) (or .cse69 (and (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse75 (select .cse77 c_~A~0.base))) (or (< (select .cse75 .cse5) c_~min1~0) (< (select .cse75 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse76 (select (select (store .cse77 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse76 1)) (= c_~min1~0 .cse76)))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse78 (select .cse80 c_~A~0.base))) (or (< (select .cse78 .cse5) c_~min1~0) (< (select .cse78 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse79 (select (select (store .cse80 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse79 1)) (< .cse79 c_~min2~0)))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse82 (select .cse84 c_~A~0.base))) (let ((.cse81 (select .cse82 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse81 1)) (= c_~min1~0 .cse81) (< (select .cse82 .cse5) c_~min1~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse83 1)) (= c_~min1~0 .cse83))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse86 (select .cse88 c_~A~0.base))) (let ((.cse85 (select .cse86 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse85 1)) (= c_~min1~0 .cse85) (< (select .cse86 .cse5) c_~min1~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse87 (select (select (store .cse88 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse3))) (or (< c_~min3~0 (+ .cse87 1)) (< .cse87 .cse85))))))))))) is different from false [2023-11-17 18:29:32,116 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (= c_~min1~0 c_~min3~0)) (.cse14 (+ c_~min3~0 1)) (.cse26 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse5 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse1 (select .cse4 c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse0 1)) (= c_~min1~0 .cse0) (< (select .cse1 .cse2) c_~min1~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse3 1)) (= c_~min1~0 .cse3))))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse9 (select .cse8 c_~A~0.base))) (let ((.cse6 (select .cse9 .cse2)) (.cse7 (select .cse9 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse6 1)) (= .cse6 c_~min3~0) (< c_~min2~0 (+ .cse7 1)) (= .cse6 .cse7) (< (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse11 (select .cse12 c_~A~0.base))) (let ((.cse10 (select .cse11 .cse2))) (or (< c_~min1~0 (+ .cse10 1)) (= .cse10 c_~min3~0) (= .cse10 c_~min2~0) (< (select .cse11 c_~A~0.offset) c_~min2~0) (< (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse15 (select .cse16 c_~A~0.base))) (let ((.cse13 (select .cse15 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse13 1)) (< .cse13 .cse14) (< (select .cse15 .cse2) c_~min1~0) (< (select (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) .cse17) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse21 (select .cse20 c_~A~0.base))) (let ((.cse18 (select .cse21 .cse2)) (.cse19 (select .cse21 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse18 1)) (< c_~min2~0 (+ .cse19 1)) (= .cse18 .cse19) (< c_~min3~0 .cse19) (< (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse23 (select .cse25 c_~A~0.base))) (let ((.cse22 (select .cse23 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse22 1)) (= c_~min1~0 .cse22) (< (select .cse23 .cse2) c_~min1~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse24 1)) (< .cse24 .cse22))))))))) (or (and .cse26 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse27 (select .cse28 c_~A~0.base))) (or (< (select .cse27 .cse2) c_~min1~0) (< (select .cse27 c_~A~0.offset) c_~min2~0) (< (select (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0))))) (and .cse17 (<= .cse14 c_~min2~0))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse30 (select .cse31 c_~A~0.base))) (let ((.cse29 (select .cse30 .cse2))) (or (< c_~min1~0 (+ .cse29 1)) (= .cse29 c_~min2~0) (< (select .cse30 c_~A~0.offset) c_~min2~0) (< (select (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse36 (select .cse35 c_~A~0.base))) (let ((.cse32 (select .cse36 .cse2))) (or (< c_~min1~0 (+ .cse32 1)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (let ((.cse33 (+ .cse34 1))) (or (< c_~min3~0 .cse33) (< c_~min2~0 .cse33) (= .cse32 .cse34))))) (< (select .cse36 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse38 (select .cse39 c_~A~0.base))) (let ((.cse37 (select .cse38 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse37 1)) (= c_~min1~0 .cse37) (< (select .cse38 .cse2) c_~min1~0) (< c_~min3~0 .cse37) (< (select (select (store .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse41 (select .cse43 c_~A~0.base))) (let ((.cse40 (select .cse41 .cse2))) (or (< c_~min1~0 (+ .cse40 1)) (= .cse40 c_~min2~0) (< (select .cse41 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse42 1)) (< .cse42 c_~min2~0))))))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse45 (select .cse46 c_~A~0.base))) (let ((.cse44 (select .cse45 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse44 1)) (= c_~min1~0 .cse44) (< (select .cse45 .cse2) c_~min1~0) (< (select (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) .cse17) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse48 (select .cse49 c_~A~0.base))) (let ((.cse47 (select .cse48 .cse2))) (or (< c_~min1~0 (+ .cse47 1)) (= .cse47 c_~min3~0) (< (select .cse48 c_~A~0.offset) c_~min2~0) (< (select (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (< c_~min2~0 .cse14)) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse55 (select .cse54 c_~A~0.base))) (let ((.cse50 (select .cse55 .cse2)) (.cse52 (select .cse55 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse50 1)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (let ((.cse51 (+ .cse53 1))) (or (< c_~min3~0 .cse51) (< .cse52 .cse51) (= .cse50 .cse53))))) (< c_~min2~0 (+ .cse52 1))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse60 (select .cse59 c_~A~0.base))) (let ((.cse56 (select .cse60 .cse2)) (.cse57 (select .cse60 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse56 1)) (< c_~min2~0 (+ .cse57 1)) (= .cse56 .cse57) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse58 1)) (< .cse58 .cse57))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse61 (select .cse64 c_~A~0.base))) (or (< (select .cse61 .cse2) c_~min1~0) (< (select .cse61 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (let ((.cse62 (+ .cse63 1))) (or (< c_~min3~0 .cse62) (= c_~min1~0 .cse63) (< c_~min2~0 .cse62))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse66 (select .cse68 c_~A~0.base))) (let ((.cse65 (select .cse66 .cse2))) (or (< c_~min1~0 (+ .cse65 1)) (= .cse65 c_~min2~0) (< (select .cse66 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse67 (select (select (store .cse68 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse67 1)) (= .cse65 .cse67))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse73 (select .cse72 c_~A~0.base))) (let ((.cse70 (select .cse73 c_~A~0.offset)) (.cse69 (select .cse73 .cse2))) (or (< c_~min1~0 (+ .cse69 1)) (< c_~min2~0 (+ .cse70 1)) (= .cse69 .cse70) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse71 1)) (= .cse69 .cse71))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse75 (select .cse78 c_~A~0.base))) (let ((.cse74 (select .cse75 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse74 1)) (< (select .cse75 .cse2) c_~min1~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (let ((.cse76 (+ .cse77 1))) (or (< c_~min3~0 .cse76) (= c_~min1~0 .cse77) (< .cse74 .cse76)))))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse82 (select .cse81 c_~A~0.base))) (let ((.cse79 (select .cse82 .cse2)) (.cse80 (select .cse82 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse79 1)) (= .cse79 c_~min3~0) (< c_~min2~0 (+ .cse80 1)) (< .cse80 .cse14) (< (select (select (store .cse81 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5) c_~min3~0)))))) (or .cse26 (and (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse83 (select .cse85 c_~A~0.base))) (or (< (select .cse83 .cse2) c_~min1~0) (< (select .cse83 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse84 1)) (< .cse84 c_~min2~0)))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse86 (select .cse88 c_~A~0.base))) (or (< (select .cse86 .cse2) c_~min1~0) (< (select .cse86 c_~A~0.offset) c_~min2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse87 (select (select (store .cse88 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse5))) (or (< c_~min3~0 (+ .cse87 1)) (= c_~min1~0 .cse87)))))))))))) is different from false [2023-11-17 18:29:32,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:32,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6770 treesize of output 5636 [2023-11-17 18:29:32,999 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 3610 treesize of output 3594 [2023-11-17 18:29:33,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3594 treesize of output 3596 [2023-11-17 18:29:33,202 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 3577 treesize of output 3561 [2023-11-17 18:29:33,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:33,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3561 treesize of output 3563 [2023-11-17 18:29:33,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:33,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3544 treesize of output 3540 [2023-11-17 18:29:33,572 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 3521 treesize of output 3505 [2023-11-17 18:29:33,671 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 3505 treesize of output 3489 [2023-11-17 18:29:33,774 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 3489 treesize of output 3465 [2023-11-17 18:29:33,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:33,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3465 treesize of output 3469 [2023-11-17 18:29:34,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:34,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3450 treesize of output 3440 [2023-11-17 18:29:34,166 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 3421 treesize of output 3413 [2023-11-17 18:29:34,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:34,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3413 treesize of output 3410 [2023-11-17 18:29:34,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:34,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3391 treesize of output 3391 [2023-11-17 18:29:34,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:34,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3372 treesize of output 3361 [2023-11-17 18:29:34,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3342 treesize of output 3323 [2023-11-17 18:29:34,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3304 treesize of output 3306 [2023-11-17 18:29:35,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:35,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3287 treesize of output 3266 [2023-11-17 18:29:35,206 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 3247 treesize of output 3239 [2023-11-17 18:29:35,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:35,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3239 treesize of output 3243 [2023-11-17 18:29:35,445 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 3224 treesize of output 3216 [2023-11-17 18:29:35,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:35,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3216 treesize of output 3196 [2023-11-17 18:29:35,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:35,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3177 treesize of output 3169 [2023-11-17 18:29:35,825 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 3150 treesize of output 3142 [2023-11-17 18:29:35,946 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 3142 treesize of output 3126 [2023-11-17 18:29:36,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:36,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3126 treesize of output 3121 [2023-11-17 18:29:36,217 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 3102 treesize of output 3094 [2023-11-17 18:29:36,428 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 3094 treesize of output 3086 [2023-11-17 18:29:36,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:36,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3086 treesize of output 3085 [2023-11-17 18:29:36,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:36,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3066 treesize of output 3061 [2023-11-17 18:29:36,882 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 3042 treesize of output 3034 [2023-11-17 18:29:37,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:37,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3034 treesize of output 3018 [2023-11-17 18:29:37,184 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 2999 treesize of output 2983 [2023-11-17 18:29:37,335 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 2983 treesize of output 2967 [2023-11-17 18:29:37,469 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 2967 treesize of output 2959 [2023-11-17 18:29:37,603 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 2959 treesize of output 2943 [2023-11-17 18:29:37,738 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 2943 treesize of output 2919 [2023-11-17 18:29:37,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:37,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2919 treesize of output 2913 [2023-11-17 18:29:38,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:38,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2894 treesize of output 2893 [2023-11-17 18:29:38,200 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 2874 treesize of output 2866 [2023-11-17 18:29:38,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:38,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2866 treesize of output 2872 [2023-11-17 18:29:38,510 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 2853 treesize of output 2845 [2023-11-17 18:29:38,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:29:38,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2845 treesize of output 2843 [2023-11-17 18:29:38,874 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 2824 treesize of output 2800 [2023-11-17 18:29:39,022 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 2800 treesize of output 2776 [2023-11-17 18:34:44,523 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 18:34:44,524 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 18:34:44,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-17 18:34:44,529 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:34:44,724 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:34:44,725 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2023-11-17 18:34:44,729 INFO L158 Benchmark]: Toolchain (without parser) took 334398.02ms. Allocated memory was 218.1MB in the beginning and 803.2MB in the end (delta: 585.1MB). Free memory was 173.2MB in the beginning and 390.2MB in the end (delta: -217.1MB). Peak memory consumption was 368.5MB. Max. memory is 8.0GB. [2023-11-17 18:34:44,729 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 137.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:34:44,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.44ms. Allocated memory is still 218.1MB. Free memory was 173.2MB in the beginning and 161.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 18:34:44,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.50ms. Allocated memory is still 218.1MB. Free memory was 161.2MB in the beginning and 159.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:34:44,730 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 218.1MB. Free memory was 159.5MB in the beginning and 157.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 18:34:44,730 INFO L158 Benchmark]: RCFGBuilder took 480.87ms. Allocated memory is still 218.1MB. Free memory was 157.4MB in the beginning and 135.4MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 18:34:44,730 INFO L158 Benchmark]: TraceAbstraction took 333571.22ms. Allocated memory was 218.1MB in the beginning and 803.2MB in the end (delta: 585.1MB). Free memory was 134.4MB in the beginning and 390.2MB in the end (delta: -255.9MB). Peak memory consumption was 329.7MB. Max. memory is 8.0GB. [2023-11-17 18:34:44,732 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 181.4MB. Free memory is still 137.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.44ms. Allocated memory is still 218.1MB. Free memory was 173.2MB in the beginning and 161.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.50ms. Allocated memory is still 218.1MB. Free memory was 161.2MB in the beginning and 159.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 218.1MB. Free memory was 159.5MB in the beginning and 157.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 480.87ms. Allocated memory is still 218.1MB. Free memory was 157.4MB in the beginning and 135.4MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 333571.22ms. Allocated memory was 218.1MB in the beginning and 803.2MB in the end (delta: 585.1MB). Free memory was 134.4MB in the beginning and 390.2MB in the end (delta: -255.9MB). Peak memory consumption was 329.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-17 18:34:44,752 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 Received shutdown request...