/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 --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 13:57:42,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 13:57:42,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 13:57:42,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 13:57:42,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 13:57:42,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 13:57:42,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 13:57:42,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 13:57:42,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 13:57:42,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 13:57:42,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 13:57:42,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 13:57:42,405 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 13:57:42,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 13:57:42,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 13:57:42,406 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 13:57:42,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 13:57:42,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 13:57:42,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 13:57:42,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 13:57:42,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 13:57:42,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 13:57:42,407 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 13:57:42,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 13:57:42,407 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 13:57:42,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 13:57:42,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 13:57:42,408 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 13:57:42,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 13:57:42,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:57:42,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 13:57:42,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 13:57:42,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 13:57:42,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 13:57:42,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 13:57:42,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 13:57:42,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 13:57:42,410 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 13:57:42,410 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 13:57:42,410 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 13:57:42,410 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 13:57:42,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 13:57:42,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 13:57:42,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 13:57:42,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 13:57:42,580 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 13:57:42,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2023-11-17 13:57:43,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 13:57:43,684 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 13:57:43,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2023-11-17 13:57:43,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e7b8370/10de71a15bba49448c609b82925559d7/FLAG8c17910c2 [2023-11-17 13:57:43,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e7b8370/10de71a15bba49448c609b82925559d7 [2023-11-17 13:57:43,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 13:57:43,702 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 13:57:43,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 13:57:43,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 13:57:43,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 13:57:43,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300586a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43, skipping insertion in model container [2023-11-17 13:57:43,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,730 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 13:57:43,850 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/loop-tiling-eq.wvr.c[2644,2657] [2023-11-17 13:57:43,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:57:43,876 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 13:57:43,898 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/loop-tiling-eq.wvr.c[2644,2657] [2023-11-17 13:57:43,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:57:43,910 INFO L206 MainTranslator]: Completed translation [2023-11-17 13:57:43,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43 WrapperNode [2023-11-17 13:57:43,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 13:57:43,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 13:57:43,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 13:57:43,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 13:57:43,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,941 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2023-11-17 13:57:43,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 13:57:43,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 13:57:43,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 13:57:43,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 13:57:43,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 13:57:43,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 13:57:43,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 13:57:43,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 13:57:43,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (1/1) ... [2023-11-17 13:57:43,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:57:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:43,988 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 13:57:44,004 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 13:57:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 13:57:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-17 13:57:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 13:57:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 13:57:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 13:57:44,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-17 13:57:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 13:57:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 13:57:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 13:57:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 13:57:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 13:57:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 13:57:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 13:57:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 13:57:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 13:57:44,015 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 13:57:44,089 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 13:57:44,091 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 13:57:44,405 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 13:57:44,712 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 13:57:44,712 INFO L307 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-17 13:57:44,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:57:44 BoogieIcfgContainer [2023-11-17 13:57:44,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 13:57:44,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 13:57:44,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 13:57:44,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 13:57:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:57:43" (1/3) ... [2023-11-17 13:57:44,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bd6998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:57:44, skipping insertion in model container [2023-11-17 13:57:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:57:43" (2/3) ... [2023-11-17 13:57:44,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bd6998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:57:44, skipping insertion in model container [2023-11-17 13:57:44,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:57:44" (3/3) ... [2023-11-17 13:57:44,720 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2023-11-17 13:57:44,726 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 13:57:44,733 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 13:57:44,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 13:57:44,733 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 13:57:44,770 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 13:57:44,802 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:57:44,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:57:44,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:44,806 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 13:57:44,807 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 13:57:44,838 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:57:44,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 13:57:44,850 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;@1e3f296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:57:44,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 13:57:50,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:57:50,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:57:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1528181285, now seen corresponding path program 1 times [2023-11-17 13:57:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:57:50,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626797256] [2023-11-17 13:57:50,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:57:50,919 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-17 13:57:50,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315687285] [2023-11-17 13:57:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:50,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:50,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:50,929 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 13:57:50,949 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 13:57:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:57:51,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-17 13:57:51,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:57:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:57:51,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 13:57:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:57:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626797256] [2023-11-17 13:57:51,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 13:57:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315687285] [2023-11-17 13:57:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315687285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:57:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:57:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 13:57:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940832836] [2023-11-17 13:57:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:57:51,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 13:57:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:57:51,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 13:57:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 13:57:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:51,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:57:51,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 13:57:51,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:51,253 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 13:57:51,444 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,SelfDestructingSolverStorable0 [2023-11-17 13:57:51,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:57:51,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:57:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -38573667, now seen corresponding path program 1 times [2023-11-17 13:57:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:57:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801995781] [2023-11-17 13:57:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:57:51,457 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-17 13:57:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270379874] [2023-11-17 13:57:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:51,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:51,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:51,472 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 13:57:51,477 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 13:57:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:57:51,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-17 13:57:51,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:57:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 13:57:51,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 13:57:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:57:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801995781] [2023-11-17 13:57:51,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 13:57:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270379874] [2023-11-17 13:57:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270379874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:57:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:57:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 13:57:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359810530] [2023-11-17 13:57:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:57:51,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 13:57:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:57:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 13:57:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 13:57:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:51,633 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:57:51,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 13:57:51,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:51,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:51,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 13:57:51,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:51,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:57:51,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:57:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2010198842, now seen corresponding path program 1 times [2023-11-17 13:57:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:57:51,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112956879] [2023-11-17 13:57:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:57:51,905 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-17 13:57:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456297335] [2023-11-17 13:57:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:51,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:51,906 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 13:57:51,919 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 13:57:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:57:52,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:57:52,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:57:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:57:52,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:57:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:57:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:57:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112956879] [2023-11-17 13:57:52,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 13:57:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456297335] [2023-11-17 13:57:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456297335] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 13:57:52,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 13:57:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-17 13:57:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153849304] [2023-11-17 13:57:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:57:52,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 13:57:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:57:52,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 13:57:52,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:57:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:52,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:57:52,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 13:57:52,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:52,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:52,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:52,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 13:57:52,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:52,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:57:52,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:57:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1281656123, now seen corresponding path program 1 times [2023-11-17 13:57:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:57:52,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619722597] [2023-11-17 13:57:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:52,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:57:52,387 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-17 13:57:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860257810] [2023-11-17 13:57:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:52,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:57:52,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 13:57:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:57:52,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 13:57:52,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:57:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 13:57:52,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:57:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 13:57:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:57:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619722597] [2023-11-17 13:57:52,588 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 13:57:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860257810] [2023-11-17 13:57:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860257810] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 13:57:52,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 13:57:52,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-17 13:57:52,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777713854] [2023-11-17 13:57:52,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:57:52,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 13:57:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:57:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 13:57:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:57:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:52,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:57:52,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 13:57:52,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:52,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:52,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:52,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:53,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 13:57:54,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:54,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:57:54,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:57:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -706208331, now seen corresponding path program 1 times [2023-11-17 13:57:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:57:54,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274254371] [2023-11-17 13:57:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:57:54,025 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-17 13:57:54,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651445752] [2023-11-17 13:57:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:54,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:54,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:57:54,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 13:57:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:57:54,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:57:54,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:57:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:57:54,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:57:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:57:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:57:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274254371] [2023-11-17 13:57:54,230 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 13:57:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651445752] [2023-11-17 13:57:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651445752] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 13:57:54,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 13:57:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-17 13:57:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155336765] [2023-11-17 13:57:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:57:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 13:57:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:57:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 13:57:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:57:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:54,231 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:57:54,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 13:57:54,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:54,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:54,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:54,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:54,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:57:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:57:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:57:56,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 13:57:56,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:56,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:57:56,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:57:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash 145782710, now seen corresponding path program 1 times [2023-11-17 13:57:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:57:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301556579] [2023-11-17 13:57:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:57:56,746 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-17 13:57:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851862888] [2023-11-17 13:57:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:57:56,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:57:56,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:57:56,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:57:56,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 13:57:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:57:56,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-17 13:57:56,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:57:57,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 13:57:57,025 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 13:57:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-17 13:57:57,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 13:57:57,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 13:57:57,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:57:57,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 13:57:57,108 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 13:57:57,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 13:57:57,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 13:57:57,206 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-17 13:57:57,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-17 13:57:57,280 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-17 13:57:57,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-17 13:57:57,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 13:57:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 13:57:57,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 13:57:57,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:57:57,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-11-17 13:57:57,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 13:57:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:57:57,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-11-17 13:57:57,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 13:57:57,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-11-17 13:57:57,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-11-17 13:57:58,002 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-17 13:57:58,003 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 73 [2023-11-17 13:57:58,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-17 13:57:58,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-11-17 13:57:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 13:57:58,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:57:58,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:57:58,296 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 322 treesize of output 290 [2023-11-17 13:57:58,303 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 143 treesize of output 137 [2023-11-17 13:58:12,274 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_int| c_~A~0.base (let ((.cse30 (* c_thread1Thread1of1ForFork0_~i~0 4))) (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse30) (select (select |c_#memory_int| c_~F~0.base) (+ c_~F~0.offset .cse30))))))) (let ((.cse7 (select (select .cse6 c_~F~0.base) c_~F~0.offset))) (and (forall ((v_ArrVal_515 (Array Int Int)) (v_~b~0_59 Int)) (or (forall ((v_~a~0_59 Int)) (or (< v_~a~0_59 0) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_515))) (let ((.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (let ((.cse1 (* v_~b~0_59 4)) (.cse3 (store .cse6 .cse5 (store (select .cse6 .cse5) v_arrayElimCell_18 .cse7)))) (let ((.cse0 (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset)))) (.cse2 (select (select .cse3 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse1)))) (or (forall ((v_arrayElimCell_20 Int)) (= (select .cse0 (+ .cse1 v_arrayElimCell_20)) .cse2)) (= (select .cse0 (+ .cse1 v_arrayElimCell_19)) .cse2))))))))) (< c_~M~0 (+ v_~b~0_59 1)) (< v_~b~0_59 0))) (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_515))) (let ((.cse11 (select (select .cse10 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int) (v_arrayElimCell_20 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse8 (store .cse6 .cse11 (store (select .cse6 .cse11) v_arrayElimCell_19 .cse7))) (.cse9 (* v_~b~0_59 4))) (= (select (select .cse8 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse9)) (select (select .cse8 (select (select (store .cse10 .cse11 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse9 v_arrayElimCell_20)))) (< v_~b~0_59 0))) (not (= c_~B~0.base .cse11)))))) (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_515))) (let ((.cse12 (select (select .cse14 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse12) (forall ((v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse13 (store .cse6 .cse12 (store (select .cse6 .cse12) v_arrayElimCell_19 .cse7))) (.cse15 (* v_~b~0_59 4))) (= (select (select .cse13 (select (select (store .cse14 .cse12 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse15 v_arrayElimCell_19)) (select (select .cse13 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse15)))) (< v_~b~0_59 0))))))) (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_515))) (let ((.cse18 (select (select .cse17 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse16 (store .cse6 .cse18 (store (select .cse6 .cse18) v_arrayElimCell_18 .cse7))) (.cse19 (* v_~b~0_59 4))) (= (select (select .cse16 (select (select (store .cse17 .cse18 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse19 v_arrayElimCell_19)) (select (select .cse16 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse19)))) (< v_~b~0_59 0))) (= c_~B~0.base .cse18))))) (forall ((v_ArrVal_515 (Array Int Int)) (v_~b~0_59 Int)) (or (< c_~M~0 (+ v_~b~0_59 1)) (< v_~b~0_59 0) (forall ((v_~a~0_59 Int)) (or (< v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (forall ((v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_515))) (let ((.cse25 (select (select .cse24 c_~B~0.base) c_~B~0.offset))) (let ((.cse22 (* v_~b~0_59 4)) (.cse23 (store .cse6 .cse25 (store (select .cse6 .cse25) v_arrayElimCell_19 .cse7)))) (let ((.cse21 (select .cse23 (select (select (store .cse24 .cse25 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset)))) (.cse20 (select (select .cse23 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse22)))) (or (forall ((v_arrayElimCell_20 Int)) (= .cse20 (select .cse21 (+ .cse22 v_arrayElimCell_20)))) (= (select .cse21 (+ .cse22 v_arrayElimCell_19)) .cse20))))))))))) (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_515))) (let ((.cse28 (select (select .cse27 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_20 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse26 (store .cse6 .cse28 (store (select .cse6 .cse28) v_arrayElimCell_18 .cse7))) (.cse29 (* v_~b~0_59 4))) (= (select (select .cse26 (select (select (store .cse27 .cse28 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse29 v_arrayElimCell_20)) (select (select .cse26 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse29)))) (< v_~b~0_59 0))) (not (= c_~B~0.base .cse28))))))))) is different from false [2023-11-17 13:58:12,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse42 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse8 (+ c_~A~0.offset .cse42)) (.cse9 (+ c_~F~0.offset .cse42))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~b~0_59 Int)) (or (forall ((v_~a~0_59 Int)) (or (forall ((v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (let ((.cse3 (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse7 c_~A~0.base (store (select .cse7 c_~A~0.base) .cse8 (select (select .cse7 c_~F~0.base) .cse9)))))) (store .cse6 .cse5 (store (select .cse6 .cse5) v_arrayElimCell_19 (select (select .cse6 c_~F~0.base) c_~F~0.offset))))) (.cse2 (* v_~b~0_59 4))) (let ((.cse0 (select (select .cse3 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse2))) (.cse1 (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))))) (or (= .cse0 (select .cse1 (+ .cse2 v_arrayElimCell_19))) (forall ((v_arrayElimCell_20 Int)) (= .cse0 (select .cse1 (+ .cse2 v_arrayElimCell_20)))))))))) (< v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)))) (< c_~M~0 (+ v_~b~0_59 1)) (< v_~b~0_59 0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse10 (select (select .cse12 c_~B~0.base) c_~B~0.offset))) (or (= .cse10 c_~B~0.base) (forall ((v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse11 (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse15 c_~A~0.base (store (select .cse15 c_~A~0.base) .cse8 (select (select .cse15 c_~F~0.base) .cse9)))))) (store .cse14 .cse10 (store (select .cse14 .cse10) v_arrayElimCell_18 (select (select .cse14 c_~F~0.base) c_~F~0.offset))))) (.cse13 (* v_~b~0_59 4))) (= (select (select .cse11 (select (select (store .cse12 .cse10 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse13 v_arrayElimCell_19)) (select (select .cse11 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse13)))) (< v_~b~0_59 0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~b~0_59 Int)) (or (< c_~M~0 (+ v_~b~0_59 1)) (forall ((v_~a~0_59 Int)) (or (< v_~a~0_59 0) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse21 (select (select .cse20 c_~B~0.base) c_~B~0.offset))) (let ((.cse19 (let ((.cse22 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse23 c_~A~0.base (store (select .cse23 c_~A~0.base) .cse8 (select (select .cse23 c_~F~0.base) .cse9)))))) (store .cse22 .cse21 (store (select .cse22 .cse21) v_arrayElimCell_18 (select (select .cse22 c_~F~0.base) c_~F~0.offset))))) (.cse17 (* v_~b~0_59 4))) (let ((.cse18 (select (select .cse19 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse17))) (.cse16 (select .cse19 (select (select (store .cse20 .cse21 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))))) (or (= (select .cse16 (+ .cse17 v_arrayElimCell_19)) .cse18) (forall ((v_arrayElimCell_20 Int)) (= .cse18 (select .cse16 (+ .cse17 v_arrayElimCell_20)))))))))))) (< v_~b~0_59 0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse24 (select (select .cse27 c_~B~0.base) c_~B~0.offset))) (or (not (= .cse24 c_~B~0.base)) (forall ((v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int) (v_arrayElimCell_20 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse25 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse29 c_~A~0.base (store (select .cse29 c_~A~0.base) .cse8 (select (select .cse29 c_~F~0.base) .cse9)))))) (store .cse28 .cse24 (store (select .cse28 .cse24) v_arrayElimCell_19 (select (select .cse28 c_~F~0.base) c_~F~0.offset))))) (.cse26 (* v_~b~0_59 4))) (= (select (select .cse25 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse26)) (select (select .cse25 (select (select (store .cse27 .cse24 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse26 v_arrayElimCell_20)))) (< v_~b~0_59 0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse33 (select (select .cse32 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse30 (let ((.cse34 (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse35 c_~A~0.base (store (select .cse35 c_~A~0.base) .cse8 (select (select .cse35 c_~F~0.base) .cse9)))))) (store .cse34 .cse33 (store (select .cse34 .cse33) v_arrayElimCell_19 (select (select .cse34 c_~F~0.base) c_~F~0.offset))))) (.cse31 (* v_~b~0_59 4))) (= (select (select .cse30 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse31)) (select (select .cse30 (select (select (store .cse32 .cse33 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse31 v_arrayElimCell_19)))) (< v_~b~0_59 0))) (= .cse33 c_~B~0.base))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse36 (select (select .cse39 c_~B~0.base) c_~B~0.offset))) (or (not (= .cse36 c_~B~0.base)) (forall ((v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_20 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse37 (let ((.cse40 (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse41 c_~A~0.base (store (select .cse41 c_~A~0.base) .cse8 (select (select .cse41 c_~F~0.base) .cse9)))))) (store .cse40 .cse36 (store (select .cse40 .cse36) v_arrayElimCell_18 (select (select .cse40 c_~F~0.base) c_~F~0.offset))))) (.cse38 (* v_~b~0_59 4))) (= (select (select .cse37 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse38)) (select (select .cse37 (select (select (store .cse39 .cse36 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse38 v_arrayElimCell_20)))) (< v_~b~0_59 0)))))))))) is different from false [2023-11-17 13:58:13,078 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~b~0_59 Int)) (or (< c_~M~0 (+ v_~b~0_59 1)) (forall ((v_~a~0_59 Int)) (or (< v_~a~0_59 0) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (let ((.cse1 (* v_~b~0_59 4)) (.cse3 (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse7 c_~A~0.base (store (select .cse7 c_~A~0.base) c_~A~0.offset (select (select .cse7 c_~F~0.base) c_~F~0.offset)))))) (store .cse6 .cse5 (store (select .cse6 .cse5) v_arrayElimCell_18 (select (select .cse6 c_~F~0.base) c_~F~0.offset)))))) (let ((.cse0 (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset)))) (.cse2 (select (select .cse3 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse1)))) (or (= (select .cse0 (+ .cse1 v_arrayElimCell_19)) .cse2) (forall ((v_arrayElimCell_20 Int)) (= (select .cse0 (+ .cse1 v_arrayElimCell_20)) .cse2)))))))))) (< v_~b~0_59 0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse11 (select (select .cse10 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int) (v_arrayElimCell_20 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse8 (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse13 c_~A~0.base (store (select .cse13 c_~A~0.base) c_~A~0.offset (select (select .cse13 c_~F~0.base) c_~F~0.offset)))))) (store .cse12 .cse11 (store (select .cse12 .cse11) v_arrayElimCell_19 (select (select .cse12 c_~F~0.base) c_~F~0.offset))))) (.cse9 (* v_~b~0_59 4))) (= (select (select .cse8 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse9)) (select (select .cse8 (select (select (store .cse10 .cse11 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse9 v_arrayElimCell_20)))) (< v_~b~0_59 0))) (not (= .cse11 c_~B~0.base)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~b~0_59 Int)) (or (< c_~M~0 (+ v_~b~0_59 1)) (forall ((v_~a~0_59 Int)) (or (< v_~a~0_59 0) (forall ((v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse19 (select (select .cse18 c_~B~0.base) c_~B~0.offset))) (let ((.cse17 (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse21 c_~A~0.base (store (select .cse21 c_~A~0.base) c_~A~0.offset (select (select .cse21 c_~F~0.base) c_~F~0.offset)))))) (store .cse20 .cse19 (store (select .cse20 .cse19) v_arrayElimCell_19 (select (select .cse20 c_~F~0.base) c_~F~0.offset))))) (.cse16 (* v_~b~0_59 4))) (let ((.cse14 (select (select .cse17 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse16))) (.cse15 (select .cse17 (select (select (store .cse18 .cse19 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))))) (or (= .cse14 (select .cse15 (+ .cse16 v_arrayElimCell_19))) (forall ((v_arrayElimCell_20 Int)) (= .cse14 (select .cse15 (+ .cse16 v_arrayElimCell_20)))))))))) (< c_~N~0 (+ v_~a~0_59 1)))) (< v_~b~0_59 0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse22 (select (select .cse24 c_~B~0.base) c_~B~0.offset))) (or (= .cse22 c_~B~0.base) (forall ((v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse23 (let ((.cse26 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse27 c_~A~0.base (store (select .cse27 c_~A~0.base) c_~A~0.offset (select (select .cse27 c_~F~0.base) c_~F~0.offset)))))) (store .cse26 .cse22 (store (select .cse26 .cse22) v_arrayElimCell_18 (select (select .cse26 c_~F~0.base) c_~F~0.offset))))) (.cse25 (* v_~b~0_59 4))) (= (select (select .cse23 (select (select (store .cse24 .cse22 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse25 v_arrayElimCell_19)) (select (select .cse23 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse25)))) (< v_~b~0_59 0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse28 (select (select .cse30 c_~B~0.base) c_~B~0.offset))) (or (not (= .cse28 c_~B~0.base)) (forall ((v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_20 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse29 (let ((.cse32 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse33 c_~A~0.base (store (select .cse33 c_~A~0.base) c_~A~0.offset (select (select .cse33 c_~F~0.base) c_~F~0.offset)))))) (store .cse32 .cse28 (store (select .cse32 .cse28) v_arrayElimCell_18 (select (select .cse32 c_~F~0.base) c_~F~0.offset))))) (.cse31 (* v_~b~0_59 4))) (= (select (select .cse29 (select (select (store .cse30 .cse28 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse31 v_arrayElimCell_20)) (select (select .cse29 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse31)))) (< v_~b~0_59 0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse37 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int)) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (< c_~N~0 (+ v_~a~0_59 1)) (let ((.cse34 (let ((.cse38 (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse39 c_~A~0.base (store (select .cse39 c_~A~0.base) c_~A~0.offset (select (select .cse39 c_~F~0.base) c_~F~0.offset)))))) (store .cse38 .cse37 (store (select .cse38 .cse37) v_arrayElimCell_19 (select (select .cse38 c_~F~0.base) c_~F~0.offset))))) (.cse35 (* v_~b~0_59 4))) (= (select (select .cse34 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse35)) (select (select .cse34 (select (select (store .cse36 .cse37 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse35 v_arrayElimCell_19)))) (< v_~b~0_59 0))) (= .cse37 c_~B~0.base)))))) is different from false [2023-11-17 13:58:13,982 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_20 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse3 (select (select .cse2 c_~B~0.base) c_~B~0.offset))) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= v_~a~0_59 0) (< |c_ULTIMATE.start_main_~i~2#1| (+ v_~a~0_59 1)) (let ((.cse0 (let ((.cse4 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse5 c_~A~0.base (store (select .cse5 c_~A~0.base) c_~A~0.offset (select (select .cse5 c_~F~0.base) c_~F~0.offset)))))) (store .cse4 .cse3 (store (select .cse4 .cse3) v_arrayElimCell_18 (select (select .cse4 c_~F~0.base) c_~F~0.offset))))) (.cse1 (* v_~b~0_59 4))) (= (select (select .cse0 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse1)) (select (select .cse0 (select (select (store .cse2 .cse3 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse1 v_arrayElimCell_20)))) (not (= .cse3 c_~B~0.base)) (< v_~b~0_59 0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse8 (select (select .cse7 c_~B~0.base) c_~B~0.offset))) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (let ((.cse6 (let ((.cse10 (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse11 c_~A~0.base (store (select .cse11 c_~A~0.base) c_~A~0.offset (select (select .cse11 c_~F~0.base) c_~F~0.offset)))))) (store .cse10 .cse8 (store (select .cse10 .cse8) v_arrayElimCell_18 (select (select .cse10 c_~F~0.base) c_~F~0.offset))))) (.cse9 (* v_~b~0_59 4))) (= (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse9 v_arrayElimCell_19)) (select (select .cse6 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse9)))) (= v_~a~0_59 0) (= .cse8 c_~B~0.base) (< |c_ULTIMATE.start_main_~i~2#1| (+ v_~a~0_59 1)) (< v_~b~0_59 0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int) (v_~b~0_59 Int) (v_arrayElimCell_20 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (let ((.cse15 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse19 c_~A~0.base (store (select .cse19 c_~A~0.base) c_~A~0.offset (select (select .cse19 c_~F~0.base) c_~F~0.offset)))))) (store .cse18 .cse17 (store (select .cse18 .cse17) v_arrayElimCell_19 (select (select .cse18 c_~F~0.base) c_~F~0.offset))))) (.cse13 (* v_~b~0_59 4))) (let ((.cse14 (select (select .cse15 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse13))) (.cse12 (select .cse15 (select (select (store .cse16 .cse17 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))))) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= (select .cse12 (+ .cse13 v_arrayElimCell_20)) .cse14) (< |c_ULTIMATE.start_main_~i~2#1| (+ v_~a~0_59 1)) (< v_~b~0_59 0) (= .cse14 (select .cse12 (+ .cse13 v_arrayElimCell_19))))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int) (v_~b~0_59 Int) (v_arrayElimCell_20 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse22 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (let ((.cse20 (let ((.cse24 (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse25 c_~A~0.base (store (select .cse25 c_~A~0.base) c_~A~0.offset (select (select .cse25 c_~F~0.base) c_~F~0.offset)))))) (store .cse24 .cse22 (store (select .cse24 .cse22) v_arrayElimCell_19 (select (select .cse24 c_~F~0.base) c_~F~0.offset))))) (.cse23 (* v_~b~0_59 4))) (= (select (select .cse20 (select (select (store .cse21 .cse22 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse23 v_arrayElimCell_20)) (select (select .cse20 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse23)))) (< |c_ULTIMATE.start_main_~i~2#1| (+ v_~a~0_59 1)) (not (= .cse22 c_~B~0.base)) (< v_~b~0_59 0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~a~0_59 Int) (v_ArrVal_519 (Array Int Int)) (v_arrayElimCell_19 Int) (v_~b~0_59 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse26 (select (select .cse29 c_~B~0.base) c_~B~0.offset))) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= .cse26 c_~B~0.base) (< |c_ULTIMATE.start_main_~i~2#1| (+ v_~a~0_59 1)) (< v_~b~0_59 0) (let ((.cse27 (let ((.cse30 (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse31 c_~A~0.base (store (select .cse31 c_~A~0.base) c_~A~0.offset (select (select .cse31 c_~F~0.base) c_~F~0.offset)))))) (store .cse30 .cse26 (store (select .cse30 .cse26) v_arrayElimCell_19 (select (select .cse30 c_~F~0.base) c_~F~0.offset))))) (.cse28 (* v_~b~0_59 4))) (= (select (select .cse27 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse28)) (select (select .cse27 (select (select (store .cse29 .cse26 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))) (+ .cse28 v_arrayElimCell_19)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_~a~0_59 Int) (v_arrayElimCell_18 Int) (v_ArrVal_519 (Array Int Int)) (v_~b~0_59 Int) (v_arrayElimCell_19 Int) (v_arrayElimCell_20 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base v_ArrVal_515))) (let ((.cse37 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse35 (let ((.cse38 (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513))) (store .cse39 c_~A~0.base (store (select .cse39 c_~A~0.base) c_~A~0.offset (select (select .cse39 c_~F~0.base) c_~F~0.offset)))))) (store .cse38 .cse37 (store (select .cse38 .cse37) v_arrayElimCell_18 (select (select .cse38 c_~F~0.base) c_~F~0.offset))))) (.cse33 (* v_~b~0_59 4))) (let ((.cse34 (select (select .cse35 c_~A~0.base) (+ (* (* v_~a~0_59 c_~M~0) 4) c_~A~0.offset .cse33))) (.cse32 (select .cse35 (select (select (store .cse36 .cse37 v_ArrVal_519) c_~B~0.base) (+ (* v_~a~0_59 4) c_~B~0.offset))))) (or (< v_~a~0_59 0) (< c_~M~0 (+ v_~b~0_59 1)) (= (select .cse32 (+ .cse33 v_arrayElimCell_19)) .cse34) (= v_~a~0_59 0) (< |c_ULTIMATE.start_main_~i~2#1| (+ v_~a~0_59 1)) (= .cse34 (select .cse32 (+ .cse33 v_arrayElimCell_20))) (< v_~b~0_59 0)))))))) is different from false [2023-11-17 13:58:14,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:58:14,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3738 treesize of output 3127 [2023-11-17 14:00:10,228 WARN L293 SmtUtils]: Spent 1.93m on a formula simplification. DAG size of input: 129 DAG size of output: 125 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-17 14:00:10,229 INFO L349 Elim1Store]: treesize reduction 8, result has 96.4 percent of original size [2023-11-17 14:00:10,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 197003977 treesize of output 195308537 [2023-11-17 14:00:13,954 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 146421 treesize of output 146325 [2023-11-17 14:00:15,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:15,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146325 treesize of output 146282 [2023-11-17 14:00:18,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:18,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146273 treesize of output 146074 [2023-11-17 14:00:22,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:22,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146065 treesize of output 145970 [2023-11-17 14:00:22,727 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 145961 treesize of output 145913 [2023-11-17 14:00:23,029 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 145913 treesize of output 145865 [2023-11-17 14:00:25,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:25,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145865 treesize of output 145762 [2023-11-17 14:00:28,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:28,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145753 treesize of output 145330 [2023-11-17 14:00:29,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:29,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145321 treesize of output 145102 [2023-11-17 14:00:30,261 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 145093 treesize of output 144709 [2023-11-17 14:00:31,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:31,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144709 treesize of output 144262 [2023-11-17 14:00:34,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:34,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144253 treesize of output 143350 [2023-11-17 14:00:37,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:37,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143341 treesize of output 143238 [2023-11-17 14:00:39,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:39,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143229 treesize of output 143182 [2023-11-17 14:00:42,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:42,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143173 treesize of output 143154 [2023-11-17 14:00:42,848 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 143145 treesize of output 142377 [2023-11-17 14:00:44,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:44,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142377 treesize of output 141522 [2023-11-17 14:00:46,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:46,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141513 treesize of output 139794 [2023-11-17 14:00:46,822 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 139785 treesize of output 139737 [2023-11-17 14:00:48,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:48,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139737 treesize of output 139634 [2023-11-17 14:00:51,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:51,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139625 treesize of output 139606 [2023-11-17 14:00:55,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:55,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139597 treesize of output 139550 [2023-11-17 14:00:57,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:00:57,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139541 treesize of output 139494 [2023-11-17 14:01:01,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:01:01,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139485 treesize of output 139466 [2023-11-17 14:03:05,160 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 1668 DAG size of output: 2540 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-11-17 14:07:14,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 14:07:14,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 14:07:14,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 14:07:14,942 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 14:07:14,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 14:07:15,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:07:15,150 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-57-2-1 context. [2023-11-17 14:07:15,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 14:07:15,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 14:07:15,155 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-17 14:07:15,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 14:07:15,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 14:07:15,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 02:07:15 BasicIcfg [2023-11-17 14:07:15,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 14:07:15,159 INFO L158 Benchmark]: Toolchain (without parser) took 571456.46ms. Allocated memory was 239.1MB in the beginning and 792.7MB in the end (delta: 553.6MB). Free memory was 196.7MB in the beginning and 367.8MB in the end (delta: -171.1MB). Peak memory consumption was 491.8MB. Max. memory is 8.0GB. [2023-11-17 14:07:15,159 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 14:07:15,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.69ms. Allocated memory is still 239.1MB. Free memory was 196.4MB in the beginning and 184.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 14:07:15,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.90ms. Allocated memory is still 239.1MB. Free memory was 184.1MB in the beginning and 182.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 14:07:15,160 INFO L158 Benchmark]: Boogie Preprocessor took 22.63ms. Allocated memory is still 239.1MB. Free memory was 182.0MB in the beginning and 179.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 14:07:15,160 INFO L158 Benchmark]: RCFGBuilder took 748.23ms. Allocated memory is still 239.1MB. Free memory was 179.9MB in the beginning and 181.5MB in the end (delta: -1.6MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. [2023-11-17 14:07:15,160 INFO L158 Benchmark]: TraceAbstraction took 570443.17ms. Allocated memory was 239.1MB in the beginning and 792.7MB in the end (delta: 553.6MB). Free memory was 181.0MB in the beginning and 367.8MB in the end (delta: -186.8MB). Peak memory consumption was 475.4MB. Max. memory is 8.0GB. [2023-11-17 14:07:15,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.69ms. Allocated memory is still 239.1MB. Free memory was 196.4MB in the beginning and 184.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.90ms. Allocated memory is still 239.1MB. Free memory was 184.1MB in the beginning and 182.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.63ms. Allocated memory is still 239.1MB. Free memory was 182.0MB in the beginning and 179.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 748.23ms. Allocated memory is still 239.1MB. Free memory was 179.9MB in the beginning and 181.5MB in the end (delta: -1.6MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. * TraceAbstraction took 570443.17ms. Allocated memory was 239.1MB in the beginning and 792.7MB in the end (delta: 553.6MB). Free memory was 181.0MB in the beginning and 367.8MB in the end (delta: -186.8MB). Peak memory consumption was 475.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 506, independent: 327, independent conditional: 213, independent unconditional: 114, dependent: 162, dependent conditional: 150, dependent unconditional: 12, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 389, independent: 327, independent conditional: 213, independent unconditional: 114, dependent: 45, dependent conditional: 33, dependent unconditional: 12, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 389, independent: 327, independent conditional: 213, independent unconditional: 114, dependent: 45, dependent conditional: 33, dependent unconditional: 12, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 479, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 112, dependent conditional: 67, dependent unconditional: 45, unknown: 40, unknown conditional: 23, unknown unconditional: 17] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 479, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 112, dependent conditional: 24, dependent unconditional: 88, unknown: 40, unknown conditional: 8, unknown unconditional: 32] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 479, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 112, dependent conditional: 24, dependent unconditional: 88, unknown: 40, unknown conditional: 8, unknown unconditional: 32] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 140, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9334, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 232, dependent conditional: 108, dependent unconditional: 124, unknown: 9075, unknown conditional: 3276, unknown unconditional: 5799] , Protected Queries: 0 ], Cache Queries: [ total: 479, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 94, dependent conditional: 18, dependent unconditional: 76, unknown: 172, unknown conditional: 14, unknown unconditional: 158] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 6, Negative unconditional cache size: 12, Unknown cache size: 8, Unknown conditional cache size: 3, Unknown unconditional cache size: 5, Eliminated conditions: 58, Maximal queried relation: 4, Independence queries for same thread: 117 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 6.0s, Number of persistent set computation: 29, Number of trivial persistent sets: 22, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 506, independent: 327, independent conditional: 213, independent unconditional: 114, dependent: 162, dependent conditional: 150, dependent unconditional: 12, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 389, independent: 327, independent conditional: 213, independent unconditional: 114, dependent: 45, dependent conditional: 33, dependent unconditional: 12, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 389, independent: 327, independent conditional: 213, independent unconditional: 114, dependent: 45, dependent conditional: 33, dependent unconditional: 12, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 479, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 112, dependent conditional: 67, dependent unconditional: 45, unknown: 40, unknown conditional: 23, unknown unconditional: 17] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 479, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 112, dependent conditional: 24, dependent unconditional: 88, unknown: 40, unknown conditional: 8, unknown unconditional: 32] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 479, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 112, dependent conditional: 24, dependent unconditional: 88, unknown: 40, unknown conditional: 8, unknown unconditional: 32] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 140, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9334, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 232, dependent conditional: 108, dependent unconditional: 124, unknown: 9075, unknown conditional: 3276, unknown unconditional: 5799] , Protected Queries: 0 ], Cache Queries: [ total: 479, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 94, dependent conditional: 18, dependent unconditional: 76, unknown: 172, unknown conditional: 14, unknown unconditional: 158] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 6, Negative unconditional cache size: 12, Unknown cache size: 8, Unknown conditional cache size: 3, Unknown unconditional cache size: 5, Eliminated conditions: 58, Maximal queried relation: 4, Independence queries for same thread: 117 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-57-2-1 context. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-57-2-1 context. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-57-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 32 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 570.3s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 9.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1447 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 28/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown