/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 22:39:18,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 22:39:18,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 22:39:18,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 22:39:18,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 22:39:18,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 22:39:18,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 22:39:18,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 22:39:18,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 22:39:18,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 22:39:18,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 22:39:18,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 22:39:18,910 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 22:39:18,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 22:39:18,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 22:39:18,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 22:39:18,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 22:39:18,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 22:39:18,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 22:39:18,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 22:39:18,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 22:39:18,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 22:39:18,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 22:39:18,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 22:39:18,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 22:39:18,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 22:39:18,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 22:39:18,915 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 22:39:18,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 22:39:18,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 22:39:18,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 22:39:18,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 22:39:18,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 22:39:18,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2024-05-30 22:39:19,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 22:39:19,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 22:39:19,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 22:39:19,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 22:39:19,177 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 22:39:19,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-05-30 22:39:20,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 22:39:20,545 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 22:39:20,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-05-30 22:39:20,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0c305fea2/df3a3254354746d2bf4484f29f3a8224/FLAG0c79f930f [2024-05-30 22:39:20,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0c305fea2/df3a3254354746d2bf4484f29f3a8224 [2024-05-30 22:39:20,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 22:39:20,581 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 22:39:20,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 22:39:20,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 22:39:20,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 22:39:20,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ded1619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20, skipping insertion in model container [2024-05-30 22:39:20,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 22:39:20,777 WARN L239 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[2618,2631] [2024-05-30 22:39:20,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 22:39:20,794 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 22:39:20,819 WARN L239 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[2618,2631] [2024-05-30 22:39:20,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 22:39:20,841 INFO L206 MainTranslator]: Completed translation [2024-05-30 22:39:20,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20 WrapperNode [2024-05-30 22:39:20,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 22:39:20,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 22:39:20,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 22:39:20,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 22:39:20,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,903 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2024-05-30 22:39:20,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 22:39:20,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 22:39:20,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 22:39:20,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 22:39:20,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 22:39:20,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 22:39:20,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 22:39:20,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 22:39:20,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (1/1) ... [2024-05-30 22:39:20,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 22:39:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:20,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 22:39:21,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 22:39:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 22:39:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-30 22:39:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 22:39:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 22:39:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 22:39:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-05-30 22:39:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 22:39:21,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 22:39:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 22:39:21,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 22:39:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 22:39:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 22:39:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 22:39:21,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 22:39:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 22:39:21,047 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 22:39:21,159 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 22:39:21,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 22:39:21,522 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 22:39:21,539 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 22:39:21,539 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2024-05-30 22:39:21,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 10:39:21 BoogieIcfgContainer [2024-05-30 22:39:21,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 22:39:21,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 22:39:21,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 22:39:21,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 22:39:21,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 10:39:20" (1/3) ... [2024-05-30 22:39:21,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac2d5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 10:39:21, skipping insertion in model container [2024-05-30 22:39:21,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:39:20" (2/3) ... [2024-05-30 22:39:21,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac2d5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 10:39:21, skipping insertion in model container [2024-05-30 22:39:21,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 10:39:21" (3/3) ... [2024-05-30 22:39:21,548 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2024-05-30 22:39:21,556 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 22:39:21,565 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 22:39:21,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 22:39:21,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 22:39:21,635 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 22:39:21,690 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 22:39:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 22:39:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:21,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 22:39:21,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 22:39:21,748 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 22:39:21,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 22:39:21,763 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;@587490ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 22:39:21,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 22:39:22,051 INFO L78 Accepts]: Start accepts. Automaton has currently 387 states, but on-demand construction may add more states Word has length 178 [2024-05-30 22:39:22,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:22,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:22,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash 626981254, now seen corresponding path program 1 times [2024-05-30 22:39:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363587088] [2024-05-30 22:39:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363587088] [2024-05-30 22:39:22,234 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-05-30 22:39:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450775366] [2024-05-30 22:39:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:22,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:22,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:22,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 22:39:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:22,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjunts are in the unsatisfiable core [2024-05-30 22:39:22,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:39:22,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 22:39:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450775366] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 22:39:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 22:39:22,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 22:39:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567697688] [2024-05-30 22:39:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:39:22,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 22:39:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 22:39:22,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 22:39:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:22,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:22,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:22,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:22,537 INFO L78 Accepts]: Start accepts. Automaton has currently 387 states, but on-demand construction may add more states Word has length 168 [2024-05-30 22:39:22,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:22,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:22,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-05-30 22:39:22,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:22,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash -327476268, now seen corresponding path program 1 times [2024-05-30 22:39:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869556957] [2024-05-30 22:39:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:22,783 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812092804] [2024-05-30 22:39:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:22,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:22,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:22,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 22:39:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:22,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-30 22:39:22,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:39:23,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 22:39:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:23,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869556957] [2024-05-30 22:39:23,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:39:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812092804] [2024-05-30 22:39:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812092804] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 22:39:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 22:39:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 22:39:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773273370] [2024-05-30 22:39:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:39:23,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 22:39:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 22:39:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 22:39:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:23,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:23,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:23,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:23,286 INFO L78 Accepts]: Start accepts. Automaton has currently 428 states, but on-demand construction may add more states Word has length 200 [2024-05-30 22:39:23,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:23,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:23,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:23,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1971730840, now seen corresponding path program 1 times [2024-05-30 22:39:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248129592] [2024-05-30 22:39:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:23,548 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072671110] [2024-05-30 22:39:23,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:23,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:23,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:23,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 22:39:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:23,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 22:39:23,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:39:23,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:39:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:39:23,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:23,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248129592] [2024-05-30 22:39:23,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:39:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072671110] [2024-05-30 22:39:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072671110] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:39:23,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:39:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-05-30 22:39:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960404736] [2024-05-30 22:39:23,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:39:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 22:39:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 22:39:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-30 22:39:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:23,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:23,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:23,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:23,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:23,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:24,107 INFO L78 Accepts]: Start accepts. Automaton has currently 526 states, but on-demand construction may add more states Word has length 207 [2024-05-30 22:39:24,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:24,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:24,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:24,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:24,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 154478364, now seen corresponding path program 1 times [2024-05-30 22:39:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893579295] [2024-05-30 22:39:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:24,368 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763322119] [2024-05-30 22:39:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:24,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:24,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 22:39:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:24,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-30 22:39:24,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 22:39:24,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 22:39:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893579295] [2024-05-30 22:39:24,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:39:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763322119] [2024-05-30 22:39:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763322119] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 22:39:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 22:39:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-30 22:39:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207448976] [2024-05-30 22:39:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:39:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 22:39:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 22:39:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-30 22:39:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:24,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:24,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:24,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:24,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:24,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:24,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:25,129 INFO L78 Accepts]: Start accepts. Automaton has currently 2415 states, but on-demand construction may add more states Word has length 215 [2024-05-30 22:39:25,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:25,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:25,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:25,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:25,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1031581341, now seen corresponding path program 1 times [2024-05-30 22:39:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749436094] [2024-05-30 22:39:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:25,372 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692683429] [2024-05-30 22:39:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:25,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:25,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:25,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:25,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 22:39:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:25,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 22:39:25,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:39:25,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:39:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:39:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749436094] [2024-05-30 22:39:25,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:39:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692683429] [2024-05-30 22:39:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692683429] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 22:39:25,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 22:39:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-05-30 22:39:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621321161] [2024-05-30 22:39:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:39:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 22:39:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:25,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 22:39:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-30 22:39:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:25,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:25,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:25,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:25,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:25,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:25,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:25,981 INFO L78 Accepts]: Start accepts. Automaton has currently 2531 states, but on-demand construction may add more states Word has length 224 [2024-05-30 22:39:25,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:25,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:26,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:26,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1813709585, now seen corresponding path program 1 times [2024-05-30 22:39:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714728870] [2024-05-30 22:39:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:26,216 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:26,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323718697] [2024-05-30 22:39:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:26,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:26,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:26,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:26,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 22:39:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:26,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 22:39:26,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 22:39:26,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 22:39:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714728870] [2024-05-30 22:39:26,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:39:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323718697] [2024-05-30 22:39:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323718697] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 22:39:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 22:39:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-30 22:39:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918694921] [2024-05-30 22:39:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:39:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-30 22:39:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-30 22:39:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-05-30 22:39:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:26,844 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:26,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.666666666666668) internal successors, (224), 12 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:27,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:39:27,281 INFO L78 Accepts]: Start accepts. Automaton has currently 2547 states, but on-demand construction may add more states Word has length 240 [2024-05-30 22:39:27,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:27,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:27,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-30 22:39:27,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:27,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 698309975, now seen corresponding path program 1 times [2024-05-30 22:39:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771746402] [2024-05-30 22:39:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:27,527 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359074576] [2024-05-30 22:39:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:27,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:27,530 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:27,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 22:39:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:27,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 22:39:27,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 22:39:27,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:39:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 22:39:28,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:39:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771746402] [2024-05-30 22:39:28,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:39:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359074576] [2024-05-30 22:39:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359074576] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 22:39:28,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 22:39:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-05-30 22:39:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508519017] [2024-05-30 22:39:28,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:39:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 22:39:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:39:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 22:39:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-30 22:39:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:28,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:39:28,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:39:28,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:39:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:39:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:39:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:39:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:39:28,198 INFO L78 Accepts]: Start accepts. Automaton has currently 2495 states, but on-demand construction may add more states Word has length 247 [2024-05-30 22:39:28,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:39:28,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-30 22:39:28,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:28,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:39:28,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:39:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash 675644443, now seen corresponding path program 1 times [2024-05-30 22:39:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:39:28,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011974181] [2024-05-30 22:39:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:28,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:39:28,432 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:39:28,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731173509] [2024-05-30 22:39:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:39:28,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:39:28,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:39:28,434 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:39:28,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 22:39:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:39:28,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 134 conjunts are in the unsatisfiable core [2024-05-30 22:39:28,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:39:29,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-30 22:39:29,588 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-30 22:39:29,588 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 19 treesize of output 16 [2024-05-30 22:39:30,026 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-30 22:39:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2024-05-30 22:39:30,715 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-05-30 22:39:30,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-05-30 22:39:31,666 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 15 treesize of output 1 [2024-05-30 22:39:32,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:39:32,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-30 22:39:32,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:39:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-30 22:39:32,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-05-30 22:39:32,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-30 22:39:33,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-30 22:39:33,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2024-05-30 22:39:33,198 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-05-30 22:39:33,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2024-05-30 22:39:33,210 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 55 treesize of output 40 [2024-05-30 22:39:34,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-05-30 22:39:34,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-05-30 22:39:34,452 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 22:39:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-05-30 22:39:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 22:39:34,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:39:35,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 22:39:35,717 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 [2024-05-30 22:39:35,725 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 [2024-05-30 22:40:07,145 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-30 22:40:07,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3372 treesize of output 2806 [2024-05-30 22:40:11,159 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-30 22:40:11,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2320 treesize of output 1754 [2024-05-30 22:40:13,701 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-05-30 22:40:13,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9411 treesize of output 7835 [2024-05-30 22:40:35,915 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-30 22:40:35,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4602 treesize of output 3836 [2024-05-30 22:40:40,552 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-30 22:40:40,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3308 treesize of output 2542 [2024-05-30 22:40:43,465 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-05-30 22:40:43,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5727 treesize of output 4615 [2024-05-30 22:40:55,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse8 (< c_~N~0 1)) (.cse7 (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset))))) (.cse3 (< c_~N~0 2)) (.cse18 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse26 (+ c_~F~0.offset .cse66)) (.cse2 (= c_~F~0.base c_~A~0.base)) (.cse20 (= (+ c_~A~0.offset .cse66) c_~F~0.offset)) (.cse19 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse12 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse59 (* 4 c_~M~0)) (.cse56 (+ 5 c_~F~0.offset)) (.cse1 (< c_~M~0 1))) (and (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (= c_~F~0.base (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (store .cse0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) v_ArrVal_603)) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse1 .cse2) (or .cse3 .cse1) (or .cse1 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse5 (select (select .cse6 c_~B~0.base) c_~B~0.offset))) (let ((.cse4 (select (select (store .cse6 .cse5 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse4 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse4 .cse5))))))) (or .cse7 .cse1 .cse8) (or .cse1 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse10 (select (select .cse11 c_~B~0.base) c_~B~0.offset))) (let ((.cse9 (select (select (store .cse11 .cse10 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse9) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse9 .cse10))))))) (or .cse1 .cse12 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse13 (select (select .cse15 c_~B~0.base) c_~B~0.offset))) (let ((.cse14 (select (select (store .cse15 .cse13 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse13) (< ~a~0 0) (not (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0)) (= .cse14 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse14 .cse13))))))) (or .cse8 (< c_~M~0 2)) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse16 .cse17 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse17))))) .cse1) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) .cse18) (< c_~N~0 (+ ~a~0 1)))) .cse19 .cse1 .cse2) (or .cse1 .cse12 (and (or .cse8 .cse2) (or .cse20 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or .cse1 .cse12 (and (or .cse20 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse21 (select (select .cse22 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse21)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse22 .cse21 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse2 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse25 (* ~a~0 c_~M~0))) (or (not (let ((.cse23 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse24 (select (select .cse23 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse23 .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse24)))) (< ~a~0 0) (not (= .cse25 c_thread1Thread1of1ForFork0_~i~0)) (= (+ c_~A~0.offset (* .cse25 4)) .cse26) (< c_~N~0 (+ ~a~0 1)))))) (or (and .cse20 .cse2) (and (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse28 (select (select .cse30 c_~B~0.base) c_~B~0.offset))) (let ((.cse29 (* ~a~0 c_~M~0)) (.cse27 (select (select (store .cse30 .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse27 .cse28)) (< ~a~0 0) (not (= .cse29 c_thread1Thread1of1ForFork0_~i~0)) (= (+ c_~A~0.offset (* .cse29 4)) .cse26) (= .cse27 c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) .cse2) (forall ((~a~0 Int)) (let ((.cse31 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse31 .cse26) (= c_~F~0.offset .cse31) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse32)) (= (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)))))))))) (or .cse20 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse34 (select (select (store .cse36 .cse35 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse34 .cse35)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse34 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse20 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse37 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse38 (select (select .cse37 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse37 .cse38 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse38)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or .cse19 .cse3 .cse1) (or .cse7 .cse3 .cse1) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse40 (select (select .cse41 c_~B~0.base) c_~B~0.offset))) (let ((.cse39 (select (select (store .cse41 .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse39 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse39 .cse40) (= c_~B~0.base .cse40)))))) .cse1) (or (forall ((~a~0 Int)) (let ((.cse42 (* ~a~0 c_~M~0))) (let ((.cse43 (+ c_~A~0.offset (* .cse42 4)))) (or (= .cse42 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse43 .cse26) (= c_~F~0.offset .cse43) (< c_~N~0 (+ ~a~0 1)))))) .cse1) (or .cse1 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse45 (select (select .cse44 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= (select (select (store .cse44 .cse45 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse45) (= c_~B~0.base .cse45)))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse46 (select (select .cse47 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base .cse46) (< ~a~0 0) (not (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0)) (< c_~N~0 (+ ~a~0 1)) (= (select (select (store .cse47 .cse46 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse46))))) .cse1 .cse12) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse49 (select (select .cse50 c_~B~0.base) c_~B~0.offset))) (let ((.cse48 (select (select (store .cse50 .cse49 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse48) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse48 .cse49) (= c_~B~0.base .cse49)))))) .cse1) (or .cse19 (let ((.cse63 (* c_~A~0.offset (- 1)))) (let ((.cse54 (div (+ .cse63 c_~F~0.offset) 4)) (.cse57 (+ 5 c_~F~0.offset .cse66))) (and (or .cse1 (forall ((~a~0 Int)) (let ((.cse51 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse51 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse51 1)))))) (forall ((~a~0 Int)) (let ((.cse52 (* ~a~0 c_~M~0))) (let ((.cse53 (+ .cse52 c_~M~0))) (or (< ~a~0 0) (< .cse26 (+ c_~A~0.offset (* .cse52 4) 1)) (< .cse53 .cse18) (< c_~N~0 (+ ~a~0 1)) (< .cse53 (+ 2 .cse54)))))) (or .cse1 (forall ((~a~0 Int)) (let ((.cse58 (* ~a~0 c_~M~0))) (let ((.cse55 (+ c_~A~0.offset (* .cse58 4) .cse59))) (or (< ~a~0 0) (< .cse55 .cse56) (< .cse55 .cse57) (< (+ .cse58 c_~M~0) .cse18) (< c_~N~0 (+ ~a~0 1))))))) (or .cse1 (forall ((~a~0 Int)) (let ((.cse61 (* ~a~0 c_~M~0))) (let ((.cse60 (+ c_~A~0.offset (* .cse61 4) 1))) (or (< ~a~0 0) (< .cse26 .cse60) (< (+ .cse61 c_~M~0) .cse18) (< c_~F~0.offset .cse60) (< c_~N~0 (+ ~a~0 1))))))) (or .cse1 (forall ((~a~0 Int)) (let ((.cse62 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse62 4) .cse59) .cse56) (< (+ (div (+ (- 1) .cse63 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse62) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse62 1)))))) (or (forall ((~a~0 Int)) (let ((.cse64 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse64 c_~M~0) (+ 2 .cse54 c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse64 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse1) (or (forall ((~a~0 Int)) (let ((.cse65 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse65 4) .cse59) .cse57) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse65 1))))) .cse1))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse68 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse67 (select (select .cse69 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse67)) (< ~a~0 0) (= .cse68 .cse26) (= c_~F~0.offset .cse68) (= (select (select (store .cse69 .cse67 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse1) (or (forall ((~a~0 Int)) (or (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse1 .cse2) (or .cse20 .cse19 .cse12 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse59) .cse56) (< c_~N~0 (+ ~a~0 1)))) .cse1) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse1)))))) is different from false [2024-05-30 22:41:02,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 22:41:02,878 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 90 treesize of output 66 [2024-05-30 22:41:02,907 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-30 22:41:02,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18732 treesize of output 18020 [2024-05-30 22:41:02,947 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 316 treesize of output 268 [2024-05-30 22:41:02,959 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-30 22:41:02,959 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 384 treesize of output 364 [2024-05-30 22:41:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:41:02,983 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 229 [2024-05-30 22:41:02,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-30 22:41:02,999 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 348 treesize of output 304 [2024-05-30 22:41:03,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 22:41:03,114 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 146 treesize of output 98 [2024-05-30 22:41:03,137 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-30 22:41:03,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26779 treesize of output 25739 [2024-05-30 22:41:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 555 [2024-05-30 22:41:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:41:03,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 207 [2024-05-30 22:41:03,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:41:03,227 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 171 [2024-05-30 22:41:03,244 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-30 22:41:03,244 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 293 treesize of output 201 [2024-05-30 22:41:03,560 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 22:41:03,560 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 29 treesize of output 1 [2024-05-30 22:41:03,569 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 22:41:03,570 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 146 treesize of output 1 [2024-05-30 22:41:03,579 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 22:41:03,579 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 85 treesize of output 1 [2024-05-30 22:41:11,812 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-30 22:41:11,813 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 22 treesize of output 18 [2024-05-30 22:41:11,823 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-30 22:41:11,823 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 22 treesize of output 18 [2024-05-30 22:41:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 22:41:12,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011974181] [2024-05-30 22:41:12,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:41:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731173509] [2024-05-30 22:41:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731173509] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:41:12,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:41:12,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 53] total 107 [2024-05-30 22:41:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936686623] [2024-05-30 22:41:12,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:41:12,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-05-30 22:41:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-05-30 22:41:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=10463, Unknown=91, NotChecked=208, Total=11342 [2024-05-30 22:41:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:12,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:12,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 4.373831775700935) internal successors, (468), 107 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:41:12,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:15,407 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse79 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse40 (select .cse79 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse77 (select |c_#memory_int| c_~A~0.base)) (.cse162 (+ c_~A~0.offset .cse13)) (.cse24 (select .cse79 c_~B~0.offset))) (let ((.cse103 (= c_~B~0.base .cse24)) (.cse163 (select |c_#memory_int| c_~F~0.base)) (.cse164 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse95 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse18 (store |c_#memory_int| c_~A~0.base (store .cse77 .cse162 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse55 (= .cse40 c_~B~0.base))) (let ((.cse48 (not .cse55)) (.cse19 (select (select .cse18 c_~F~0.base) c_~F~0.offset)) (.cse107 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse108 (+ .cse95 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse96 (select .cse163 (+ .cse95 .cse164 c_~F~0.offset))) (.cse41 (select |c_#memory_int| .cse40)) (.cse42 (select .cse163 (+ .cse164 c_~F~0.offset))) (.cse45 (not .cse103)) (.cse7 (+ c_~F~0.offset .cse13)) (.cse30 (< c_~N~0 1)) (.cse25 (select |c_#memory_int| .cse24)) (.cse26 (select .cse163 c_~F~0.offset)) (.cse74 (= .cse162 c_~F~0.offset)) (.cse0 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse73 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse2 (* 4 c_~M~0)) (.cse3 (+ 5 c_~F~0.offset)) (.cse5 (< c_~M~0 1))) (and (or .cse0 (let ((.cse4 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse10 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse1 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse1 4) .cse2) .cse3) (< (+ .cse1 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse6 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse6 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse6 1)))))) (or (forall ((~a~0 Int)) (let ((.cse8 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse7 (+ c_~A~0.offset (* .cse8 4) 1)) (< (+ .cse8 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse9 4) .cse2) .cse3) (< (+ (div (+ (- 1) .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse9) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse11 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse11 c_~M~0) (+ 2 (div (+ .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse11 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse12 4) .cse2) (+ 5 c_~F~0.offset .cse13)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse12 1))))) .cse5)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse14 (store .cse18 .cse17 (store (select .cse18 .cse17) v_arrayElimCell_22 .cse19))) (.cse15 (* ~b~0 4))) (= (select (select .cse14 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse15)) (select (select .cse14 (select (select (store .cse16 .cse17 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse15 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse17)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse23 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse21 (* ~b~0 4))) (let ((.cse22 (select (select .cse23 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse21))) (.cse20 (select .cse23 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse20 (+ .cse21 v_arrayElimCell_23)) .cse22) (= .cse22 (select .cse20 (+ .cse21 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse28 (select (select .cse29 c_~B~0.base) c_~B~0.offset))) (let ((.cse27 (select (select (store .cse29 .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse27 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse27 .cse28))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse30) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (let ((.cse31 (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse31) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse31 .cse32))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse34 (select (select .cse35 c_~B~0.base) c_~B~0.offset))) (= .cse34 (select (select (store .cse35 .cse34 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse39 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse37 (* ~b~0 4))) (let ((.cse38 (select (select .cse39 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse37))) (.cse36 (select .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse36 (+ .cse37 v_arrayElimCell_23)) .cse38) (= .cse38 (select .cse36 (+ .cse37 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse43 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse44 (* ~b~0 4))) (= (select (select .cse43 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse44 v_arrayElimCell_23)) (select (select .cse43 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse44)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse45) (or .cse30 (< c_~M~0 2)) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse46 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse47 (* ~b~0 4))) (= (select (select .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse47 v_arrayElimCell_23)) (select (select .cse46 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse47)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse48) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse49 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse50 (select (select .cse49 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse49 .cse50 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse50))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse52 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse51 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (= .cse51 (select (select (store .cse52 .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse53 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42))) (.cse54 (* ~b~0 4))) (= (select (select .cse53 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse54 v_arrayElimCell_22)) (select (select .cse53 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse54)))))) .cse55) (or .cse48 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse56 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42))) (.cse57 (* ~b~0 4))) (= (select (select .cse56 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse57 v_arrayElimCell_23)) (select (select .cse56 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse57)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse59 (select (select .cse60 c_~B~0.base) c_~B~0.offset))) (let ((.cse58 (select (select (store .cse60 .cse59 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse58) (< c_~N~0 (+ ~a~0 1)) (= .cse59 .cse58)))))) .cse5) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse65 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (let ((.cse64 (store .cse18 .cse66 (store (select .cse18 .cse66) v_arrayElimCell_21 .cse19))) (.cse63 (* ~b~0 4))) (let ((.cse61 (select (select .cse64 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse63))) (.cse62 (select .cse64 (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse61 (select .cse62 (+ .cse63 v_arrayElimCell_22))) (= .cse61 (select .cse62 (+ .cse63 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse30) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse71 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset))) (let ((.cse70 (store .cse18 .cse72 (store (select .cse18 .cse72) v_arrayElimCell_22 .cse19))) (.cse69 (* ~b~0 4))) (let ((.cse67 (select (select .cse70 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse69))) (.cse68 (select .cse70 (select (select (store .cse71 .cse72 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse67 (select .cse68 (+ .cse69 v_arrayElimCell_22))) (= .cse67 (select .cse68 (+ .cse69 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse5 .cse73 (and (or .cse30 (= c_~F~0.base c_~A~0.base)) (or .cse74 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse75 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse76 (* ~b~0 4))) (= (select (select .cse75 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse76)) (select (select .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse76 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse55) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse78 (* ~b~0 4))) (= (select .cse77 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse78)) (let ((.cse80 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse79 .cse80)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse80) .cse78))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse81)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse82 .cse81 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse84 (select (select .cse85 c_~B~0.base) c_~B~0.offset))) (let ((.cse83 (select (select (store .cse85 .cse84 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse83 .cse84)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse83 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse74 (forall ((~a~0 Int)) (let ((.cse86 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse86 .cse7) (= c_~F~0.offset .cse86) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse87 (select (select .cse88 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse87)) (= (select (select (store .cse88 .cse87 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse89 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse90 (select (select .cse89 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse89 .cse90 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse90)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5 .cse73) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse93 (* ~b~0 4)) (.cse94 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96)))) (let ((.cse92 (select .cse94 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse91 (select (select .cse94 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse93)))) (or (= .cse91 (select .cse92 (+ .cse93 v_arrayElimCell_23))) (= (select .cse92 (+ .cse93 v_arrayElimCell_22)) .cse91))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse97 (select (select .cse100 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse97) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse98 (store .cse18 .cse97 (store (select .cse18 .cse97) v_arrayElimCell_21 .cse19))) (.cse99 (* ~b~0 4))) (= (select (select .cse98 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse99)) (select (select .cse98 (select (select (store .cse100 .cse97 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse99 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse101 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse102 (* ~b~0 4))) (= (select (select .cse101 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (select (select .cse101 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse102 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse103) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse104 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse107 .cse108 .cse96))) (.cse106 (* ~b~0 4))) (= (let ((.cse105 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse104 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse105)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse105) .cse106))) (select (select .cse104 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse106)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse109 (select (select .cse112 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse109)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse110 (store .cse18 .cse109 (store (select .cse18 .cse109) v_arrayElimCell_21 .cse19))) (.cse111 (* ~b~0 4))) (= (select (select .cse110 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse111)) (select (select .cse110 (select (select (store .cse112 .cse109 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse111 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse115 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse114 (select (select .cse115 c_~B~0.base) c_~B~0.offset))) (let ((.cse113 (select (select (store .cse115 .cse114 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse113) (< c_~N~0 (+ ~a~0 1)) (= .cse114 .cse113)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse119 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse118 (* ~b~0 4))) (let ((.cse116 (select (select .cse119 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse118))) (.cse117 (select .cse119 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse116 (select .cse117 (+ .cse118 v_arrayElimCell_23))) (= .cse116 (select .cse117 (+ .cse118 v_arrayElimCell_22))))))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse120 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse121 (select (select .cse120 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse120 .cse121 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse121 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse122 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse123 (* ~b~0 4))) (= (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse123)) (select (select .cse122 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse123 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse48) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse124 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96))) (.cse125 (* ~b~0 4))) (= (select (select .cse124 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse125 v_arrayElimCell_22)) (select (select .cse124 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse125)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse55) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse126 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96))) (.cse127 (* ~b~0 4))) (= (select (select .cse126 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse127)) (select (select .cse126 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse127 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse48) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse131 (select (select .cse130 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse128 (store .cse18 .cse131 (store (select .cse18 .cse131) v_arrayElimCell_22 .cse19))) (.cse129 (* ~b~0 4))) (= (select (select .cse128 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse129)) (select (select .cse128 (select (select (store .cse130 .cse131 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse129 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse131))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse134 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse133 (select (select .cse134 c_~B~0.base) c_~B~0.offset))) (let ((.cse132 (select (select (store .cse134 .cse133 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse132) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse133 .cse132)))))) .cse5) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse135 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse107 .cse108 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse136 (* ~b~0 4))) (= (select (select .cse135 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse136)) (let ((.cse137 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse135 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse137)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse137) .cse136))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse138 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse139 (* ~b~0 4))) (= (select (select .cse138 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse139)) (select (select .cse138 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse139 v_arrayElimCell_22)))))) .cse55) (or .cse103 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse140 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse141 (* ~b~0 4))) (= (select (select .cse140 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse141)) (select (select .cse140 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse141 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((~a~0 Int)) (let ((.cse142 (* ~a~0 c_~M~0))) (let ((.cse143 (+ c_~A~0.offset (* .cse142 4)))) (or (= .cse142 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse143 .cse7) (= c_~F~0.offset .cse143) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse145 (* ~b~0 4)) (.cse147 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42)))) (let ((.cse144 (select .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse146 (select (select .cse147 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse145)))) (or (= (select .cse144 (+ .cse145 v_arrayElimCell_23)) .cse146) (= (select .cse144 (+ .cse145 v_arrayElimCell_22)) .cse146))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse148 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse149 (* ~b~0 4))) (= (select (select .cse148 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse149)) (select (select .cse148 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse149 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse45) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse152 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse151 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse150 (select (select .cse152 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse150)) (< ~a~0 0) (= .cse151 .cse7) (= c_~F~0.offset .cse151) (= (select (select (store .cse152 .cse150 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or .cse5 .cse30 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse155 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse154 (select (select .cse155 c_~B~0.base) c_~B~0.offset))) (let ((.cse153 (select (select (store .cse155 .cse154 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse153) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse154 .cse153))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse156 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse157 (select (select .cse156 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse156 .cse157 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse157)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse161 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse160 (* ~b~0 4))) (let ((.cse158 (select (select .cse161 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse160))) (.cse159 (select .cse161 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse158 (select .cse159 (+ .cse160 v_arrayElimCell_22))) (= .cse158 (select .cse159 (+ .cse160 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse74 .cse0 .cse73 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse2) .cse3) (< c_~N~0 (+ ~a~0 1)))) .cse5) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse5)))))))) is different from true [2024-05-30 22:41:18,141 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse101 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse51 (select .cse101 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse99 (select |c_#memory_int| c_~A~0.base)) (.cse204 (+ c_~A~0.offset .cse13)) (.cse29 (select .cse101 c_~B~0.offset)) (.cse39 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base))) (.cse41 (not (= c_~B~0.base c_~A~0.base))) (.cse40 (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse123 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))))) (let ((.cse46 (and (or .cse39 .cse123) (or .cse123 .cse41) (not (= (select |c_#valid| c_~B~0.base) 0)) (or .cse40 .cse123))) (.cse129 (= c_~B~0.base .cse29)) (.cse42 (< |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse59 (< c_~M~0 2)) (.cse205 (select |c_#memory_int| c_~F~0.base)) (.cse206 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse117 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse23 (store |c_#memory_int| c_~A~0.base (store .cse99 .cse204 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse71 (= .cse51 c_~B~0.base)) (.cse5 (< c_~M~0 1)) (.cse124 (< |c_ULTIMATE.start_main_~i~2#1| 1))) (let ((.cse45 (or .cse5 .cse124)) (.cse62 (not .cse71)) (.cse24 (select (select .cse23 c_~F~0.base) c_~F~0.offset)) (.cse133 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse134 (+ .cse117 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse159 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (.cse118 (select .cse205 (+ .cse117 .cse206 c_~F~0.offset))) (.cse74 (+ |c_#StackHeapBarrier| 1)) (.cse85 (< |c_ULTIMATE.start_main_#t~post12#1| 0)) (.cse84 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset))))) (.cse52 (select |c_#memory_int| .cse51)) (.cse53 (select .cse205 (+ .cse206 c_~F~0.offset))) (.cse126 (or .cse42 .cse59)) (.cse58 (not .cse129)) (.cse125 (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (.cse161 (and (or .cse123 .cse42 .cse59) (or .cse46 .cse5 .cse42) (or .cse123 .cse5 .cse124))) (.cse7 (+ c_~F~0.offset .cse13)) (.cse35 (< c_~N~0 1)) (.cse16 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) (.cse17 (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1)))) (.cse30 (select |c_#memory_int| .cse29)) (.cse31 (select .cse205 c_~F~0.offset)) (.cse96 (= .cse204 c_~F~0.offset)) (.cse0 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse95 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse2 (* 4 c_~M~0)) (.cse3 (+ 5 c_~F~0.offset)) (.cse158 (<= (+ c_~M~0 1) 0)) (.cse146 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse160 (<= 0 c_~M~0)) (.cse18 (not (= c_~M~0 1)))) (and (or .cse0 (let ((.cse4 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse10 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse1 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse1 4) .cse2) .cse3) (< (+ .cse1 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse6 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse6 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse6 1)))))) (or (forall ((~a~0 Int)) (let ((.cse8 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse7 (+ c_~A~0.offset (* .cse8 4) 1)) (< (+ .cse8 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse9 4) .cse2) .cse3) (< (+ (div (+ (- 1) .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse9) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse11 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse11 c_~M~0) (+ 2 (div (+ .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse11 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse12 4) .cse2) (+ 5 c_~F~0.offset .cse13)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse12 1))))) .cse5)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse14 (select (select .cse15 c_~B~0.base) c_~B~0.offset))) (= .cse14 (select (select (store .cse15 .cse14 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))))))) (or (and .cse16 .cse17 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| c_~A~0.base 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ c_~A~0.base 1)) (not (= (select |c_#valid| c_~A~0.base) 0)))) .cse18) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse22 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse19 (store .cse23 .cse22 (store (select .cse23 .cse22) v_arrayElimCell_22 .cse24))) (.cse20 (* ~b~0 4))) (= (select (select .cse19 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse20)) (select (select .cse19 (select (select (store .cse21 .cse22 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse20 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse22)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse28 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_21 .cse31))) (.cse26 (* ~b~0 4))) (let ((.cse27 (select (select .cse28 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse26))) (.cse25 (select .cse28 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse25 (+ .cse26 v_arrayElimCell_23)) .cse27) (= .cse27 (select .cse25 (+ .cse26 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse33 (select (select .cse34 c_~B~0.base) c_~B~0.offset))) (let ((.cse32 (select (select (store .cse34 .cse33 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse32 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse32 .cse33))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse35) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse37 (select (select .cse38 c_~B~0.base) c_~B~0.offset))) (let ((.cse36 (select (select (store .cse38 .cse37 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse36) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse36 .cse37))))))) (or (and .cse39 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| c_~B~0.base)) .cse40 .cse41) .cse5 .cse42) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse44 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse43 (select (select .cse44 c_~B~0.base) c_~B~0.offset))) (= .cse43 (select (select (store .cse44 .cse43 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (and .cse16 .cse17 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_#t~ret9#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base|))))) .cse18) .cse45 (or .cse46 .cse18) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse50 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_21 .cse53))) (.cse48 (* ~b~0 4))) (let ((.cse49 (select (select .cse50 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse48))) (.cse47 (select .cse50 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse47 (+ .cse48 v_arrayElimCell_23)) .cse49) (= .cse49 (select .cse47 (+ .cse48 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse55 (select (select .cse54 c_~B~0.base) c_~B~0.offset))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base (select (select (store .cse54 .cse55 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse55)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse56 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_21 .cse31))) (.cse57 (* ~b~0 4))) (= (select (select .cse56 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse57 v_arrayElimCell_23)) (select (select .cse56 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse57)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse58) (or .cse35 .cse59) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse60 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_21 .cse53))) (.cse61 (* ~b~0 4))) (= (select (select .cse60 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse61 v_arrayElimCell_23)) (select (select .cse60 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse61)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse62) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse63 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse64 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse63 .cse64 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse64))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse65 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse66)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse67 (select (select .cse68 c_~B~0.base) c_~B~0.offset))) (= .cse67 (select (select (store .cse68 .cse67 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse69 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_22 .cse53))) (.cse70 (* ~b~0 4))) (= (select (select .cse69 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse70 v_arrayElimCell_22)) (select (select .cse69 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse70)))))) .cse71) (or .cse62 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse72 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_22 .cse53))) (.cse73 (* ~b~0 4))) (= (select (select .cse72 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse73 v_arrayElimCell_23)) (select (select .cse72 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse73)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (<= .cse74 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse77 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse76 (select (select .cse77 c_~B~0.base) c_~B~0.offset))) (let ((.cse75 (select (select (store .cse77 .cse76 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse75) (< c_~N~0 (+ ~a~0 1)) (= .cse76 .cse75)))))) .cse5) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse82 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse83 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (let ((.cse81 (store .cse23 .cse83 (store (select .cse23 .cse83) v_arrayElimCell_21 .cse24))) (.cse80 (* ~b~0 4))) (let ((.cse78 (select (select .cse81 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse80))) (.cse79 (select .cse81 (select (select (store .cse82 .cse83 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse78 (select .cse79 (+ .cse80 v_arrayElimCell_22))) (= .cse78 (select .cse79 (+ .cse80 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse84 .cse5 .cse35) (or .cse85 .cse59) (or .cse5 (and .cse39 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse40 .cse41) .cse42) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse90 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse91 (select (select .cse90 c_~B~0.base) c_~B~0.offset))) (let ((.cse89 (store .cse23 .cse91 (store (select .cse23 .cse91) v_arrayElimCell_22 .cse24))) (.cse88 (* ~b~0 4))) (let ((.cse86 (select (select .cse89 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse88))) (.cse87 (select .cse89 (select (select (store .cse90 .cse91 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse86 (select .cse87 (+ .cse88 v_arrayElimCell_22))) (= .cse86 (select .cse87 (+ .cse88 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse94 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse93 (select (select .cse94 c_~B~0.base) c_~B~0.offset))) (let ((.cse92 (select (select (store .cse94 .cse93 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse92) (= .cse93 .cse92))))))) (or .cse5 .cse95 (and (or .cse35 (= c_~F~0.base c_~A~0.base)) (or .cse96 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse97 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_21 .cse53))) (.cse98 (* ~b~0 4))) (= (select (select .cse97 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse98)) (select (select .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse98 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse71) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse100 (* ~b~0 4))) (= (select .cse99 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse100)) (let ((.cse102 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse101 .cse102)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse102) .cse100))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse96 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse104 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse103 (select (select .cse104 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse103)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse104 .cse103 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse96 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse107 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse106 (select (select .cse107 c_~B~0.base) c_~B~0.offset))) (let ((.cse105 (select (select (store .cse107 .cse106 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse105 .cse106)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse105 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse96 (forall ((~a~0 Int)) (let ((.cse108 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse108 .cse7) (= c_~F~0.offset .cse108) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse110 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse109 (select (select .cse110 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse109)) (= (select (select (store .cse110 .cse109 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse96 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse111 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse112 (select (select .cse111 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse111 .cse112 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse112)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5 .cse95) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse115 (* ~b~0 4)) (.cse116 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_21) .cse118)))) (let ((.cse114 (select .cse116 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse113 (select (select .cse116 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse115)))) (or (= .cse113 (select .cse114 (+ .cse115 v_arrayElimCell_23))) (= (select .cse114 (+ .cse115 v_arrayElimCell_22)) .cse113))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse122 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse119 (select (select .cse122 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse119) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse120 (store .cse23 .cse119 (store (select .cse23 .cse119) v_arrayElimCell_21 .cse24))) (.cse121 (* ~b~0 4))) (= (select (select .cse120 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse121)) (select (select .cse120 (select (select (store .cse122 .cse119 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse121 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (and (or .cse123 .cse124) (or .cse46 .cse42)) .cse18) (or .cse125 (and .cse45 .cse126 (or .cse5 .cse42 (and .cse39 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|)) .cse40 .cse41)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse127 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_22 .cse31))) (.cse128 (* ~b~0 4))) (= (select (select .cse127 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse128)) (select (select .cse127 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse128 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse129) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse130 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse133 .cse134 .cse118))) (.cse132 (* ~b~0 4))) (= (let ((.cse131 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse130 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse131)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse131) .cse132))) (select (select .cse130 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse132)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse135 (select (select .cse138 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse135)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse136 (store .cse23 .cse135 (store (select .cse23 .cse135) v_arrayElimCell_21 .cse24))) (.cse137 (* ~b~0 4))) (= (select (select .cse136 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse137)) (select (select .cse136 (select (select (store .cse138 .cse135 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse137 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse141 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse140 (select (select .cse141 c_~B~0.base) c_~B~0.offset))) (let ((.cse139 (select (select (store .cse141 .cse140 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse139) (< c_~N~0 (+ ~a~0 1)) (= .cse140 .cse139)))))) .cse5) (or (< |c_ULTIMATE.start_main_#t~post12#1| 1) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse145 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_22) .cse118))) (.cse144 (* ~b~0 4))) (let ((.cse142 (select (select .cse145 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse144))) (.cse143 (select .cse145 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse142 (select .cse143 (+ .cse144 v_arrayElimCell_23))) (= .cse142 (select .cse143 (+ .cse144 v_arrayElimCell_22))))))))))) (or (and .cse16 .cse17 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse18) .cse146 (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse147 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse148 (select (select .cse147 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse147 .cse148 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse148 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse151 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse150 (select (select .cse151 c_~B~0.base) c_~B~0.offset))) (let ((.cse149 (select (select (store .cse151 .cse150 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse149) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse150 .cse149))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse152 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_22) .cse118))) (.cse153 (* ~b~0 4))) (= (select (select .cse152 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse153)) (select (select .cse152 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse153 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse62) (or (and .cse39 .cse40 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse41) .cse5 .cse42) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse154 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_21) .cse118))) (.cse155 (* ~b~0 4))) (= (select (select .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse155 v_arrayElimCell_22)) (select (select .cse154 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse155)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse71) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse156 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_21) .cse118))) (.cse157 (* ~b~0 4))) (= (select (select .cse156 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse157)) (select (select .cse156 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse157 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse62) (or (and .cse158 .cse159) (and (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse160)) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)) .cse161) (or .cse84 .cse5 .cse42) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse165 (select (select .cse164 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse162 (store .cse23 .cse165 (store (select .cse23 .cse165) v_arrayElimCell_22 .cse24))) (.cse163 (* ~b~0 4))) (= (select (select .cse162 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse163)) (select (select .cse162 (select (select (store .cse164 .cse165 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse163 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse165))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse168 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse167 (select (select .cse168 c_~B~0.base) c_~B~0.offset))) (let ((.cse166 (select (select (store .cse168 .cse167 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse166) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse167 .cse166)))))) .cse5) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse169 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse133 .cse134 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse170 (* ~b~0 4))) (= (select (select .cse169 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse170)) (let ((.cse171 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse169 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse171)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse171) .cse170))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse159 (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse172 (store |c_#memory_int| .cse51 (store .cse52 (+ .cse117 v_arrayElimCell_22) .cse118))) (.cse173 (* ~b~0 4))) (= (select (select .cse172 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse173)) (select (select .cse172 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse173 v_arrayElimCell_22)))))) .cse71) (<= .cse74 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and .cse16 .cse17 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0)))) .cse18) (or .cse129 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse174 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_21 .cse31))) (.cse175 (* ~b~0 4))) (= (select (select .cse174 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse175)) (select (select .cse174 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse175 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or .cse85 .cse84 .cse5) (or (forall ((~a~0 Int)) (let ((.cse176 (* ~a~0 c_~M~0))) (let ((.cse177 (+ c_~A~0.offset (* .cse176 4)))) (or (= .cse176 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse177 .cse7) (= c_~F~0.offset .cse177) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse179 (* ~b~0 4)) (.cse181 (store |c_#memory_int| .cse51 (store .cse52 v_arrayElimCell_22 .cse53)))) (let ((.cse178 (select .cse181 (select (select (store |c_#memory_$Pointer$.base| .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse180 (select (select .cse181 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse179)))) (or (= (select .cse178 (+ .cse179 v_arrayElimCell_23)) .cse180) (= (select .cse178 (+ .cse179 v_arrayElimCell_22)) .cse180))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) .cse126 (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (let ((.cse183 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse182 (select (select .cse183 c_~B~0.base) c_~B~0.offset))) (= .cse182 (select (select (store .cse183 .cse182 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse184 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_22 .cse31))) (.cse185 (* ~b~0 4))) (= (select (select .cse184 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse185)) (select (select .cse184 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse185 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse58) (or .cse125 .cse161) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse187 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse186 (select (select .cse188 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse186)) (< ~a~0 0) (= .cse187 .cse7) (= c_~F~0.offset .cse187) (= (select (select (store .cse188 .cse186 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse191 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse190 (select (select .cse191 c_~B~0.base) c_~B~0.offset))) (let ((.cse189 (select (select (store .cse191 .cse190 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~F~0.base .cse189) (= .cse190 .cse189)))))) .cse5) (or .cse5 .cse35 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse194 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse193 (select (select .cse194 c_~B~0.base) c_~B~0.offset))) (let ((.cse192 (select (select (store .cse194 .cse193 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse192) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse193 .cse192))))))) (or (and .cse16 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|) 0))) .cse17) .cse18 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse195 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse196 (select (select .cse195 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse195 .cse196 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse196)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse200 (store |c_#memory_int| .cse29 (store .cse30 v_arrayElimCell_22 .cse31))) (.cse199 (* ~b~0 4))) (let ((.cse197 (select (select .cse200 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse199))) (.cse198 (select .cse200 (select (select (store |c_#memory_$Pointer$.base| .cse29 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse197 (select .cse198 (+ .cse199 v_arrayElimCell_22))) (= .cse197 (select .cse198 (+ .cse199 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse203 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse202 (select (select .cse203 c_~B~0.base) c_~B~0.offset))) (let ((.cse201 (select (select (store .cse203 .cse202 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse201) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse202 .cse201))))))) (or .cse96 .cse0 .cse95 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse2) .cse3) (< c_~N~0 (+ ~a~0 1)))) .cse5) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse5))) (or (and .cse158 .cse146) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse160)) (or (and (or .cse123 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or .cse123 (not (= c_~A~0.base |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) .cse123) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc11#1.base|) 0))) .cse18)))))) is different from true [2024-05-30 22:41:32,821 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse82 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse42 (select .cse82 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse80 (select |c_#memory_int| c_~A~0.base)) (.cse165 (+ c_~A~0.offset .cse14)) (.cse26 (select .cse82 c_~B~0.offset))) (let ((.cse106 (= c_~B~0.base .cse26)) (.cse166 (select |c_#memory_int| c_~F~0.base)) (.cse167 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse98 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse20 (store |c_#memory_int| c_~A~0.base (store .cse80 .cse165 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse57 (= .cse42 c_~B~0.base))) (let ((.cse15 (+ 2 c_~B~0.base)) (.cse0 (= c_~F~0.base c_~A~0.base)) (.cse50 (not .cse57)) (.cse21 (select (select .cse20 c_~F~0.base) c_~F~0.offset)) (.cse110 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse111 (+ .cse98 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse99 (select .cse166 (+ .cse98 .cse167 c_~F~0.offset))) (.cse60 (+ |c_#StackHeapBarrier| 1)) (.cse43 (select |c_#memory_int| .cse42)) (.cse44 (select .cse166 (+ .cse167 c_~F~0.offset))) (.cse47 (not .cse106)) (.cse8 (+ c_~F~0.offset .cse14)) (.cse32 (< c_~N~0 1)) (.cse27 (select |c_#memory_int| .cse26)) (.cse28 (select .cse166 c_~F~0.offset)) (.cse77 (= .cse165 c_~F~0.offset)) (.cse1 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse76 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse3 (* 4 c_~M~0)) (.cse4 (+ 5 c_~F~0.offset)) (.cse6 (< c_~M~0 1))) (and (= c_~F~0.offset 0) (not .cse0) (or .cse1 (let ((.cse5 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse11 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse2 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse2 4) .cse3) .cse4) (< (+ .cse2 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse7 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse7 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse7 1)))))) (or (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse8 (+ c_~A~0.offset (* .cse9 4) 1)) (< (+ .cse9 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse10 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse10 4) .cse3) .cse4) (< (+ (div (+ (- 1) .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse10) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse12 c_~M~0) (+ 2 (div (+ .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse12 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or (forall ((~a~0 Int)) (let ((.cse13 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse13 4) .cse3) (+ 5 c_~F~0.offset .cse14)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse13 1))))) .cse6)))) (<= .cse15 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse19 (select (select .cse18 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse16 (store .cse20 .cse19 (store (select .cse20 .cse19) v_arrayElimCell_22 .cse21))) (.cse17 (* ~b~0 4))) (= (select (select .cse16 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse17)) (select (select .cse16 (select (select (store .cse18 .cse19 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse17 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse19)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse25 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_21 .cse28))) (.cse23 (* ~b~0 4))) (let ((.cse24 (select (select .cse25 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse23))) (.cse22 (select .cse25 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse22 (+ .cse23 v_arrayElimCell_23)) .cse24) (= .cse24 (select .cse22 (+ .cse23 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse6) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse30 (select (select .cse31 c_~B~0.base) c_~B~0.offset))) (let ((.cse29 (select (select (store .cse31 .cse30 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse29 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse29 .cse30))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse6 .cse32) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse34 (select (select .cse35 c_~B~0.base) c_~B~0.offset))) (let ((.cse33 (select (select (store .cse35 .cse34 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse33) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse33 .cse34))))))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse37 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse36 (select (select .cse37 c_~B~0.base) c_~B~0.offset))) (= .cse36 (select (select (store .cse37 .cse36 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse41 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_21 .cse44))) (.cse39 (* ~b~0 4))) (let ((.cse40 (select (select .cse41 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse39))) (.cse38 (select .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse38 (+ .cse39 v_arrayElimCell_23)) .cse40) (= .cse40 (select .cse38 (+ .cse39 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse45 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_21 .cse28))) (.cse46 (* ~b~0 4))) (= (select (select .cse45 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse46 v_arrayElimCell_23)) (select (select .cse45 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse46)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse47) (or .cse32 (< c_~M~0 2)) (<= .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse48 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_21 .cse44))) (.cse49 (* ~b~0 4))) (= (select (select .cse48 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse49 v_arrayElimCell_23)) (select (select .cse48 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse49)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse50) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse51 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse52 (select (select .cse51 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse51 .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse52))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse53 (select (select .cse54 c_~B~0.base) c_~B~0.offset))) (= .cse53 (select (select (store .cse54 .cse53 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse55 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_22 .cse44))) (.cse56 (* ~b~0 4))) (= (select (select .cse55 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse56 v_arrayElimCell_22)) (select (select .cse55 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse56)))))) .cse57) (not (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| c_~A~0.base)) (or .cse50 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse58 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_22 .cse44))) (.cse59 (* ~b~0 4))) (= (select (select .cse58 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse59 v_arrayElimCell_23)) (select (select .cse58 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse59)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (<= .cse60 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse63 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse62 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (let ((.cse61 (select (select (store .cse63 .cse62 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse61) (< c_~N~0 (+ ~a~0 1)) (= .cse62 .cse61)))))) .cse6) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse68 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse69 (select (select .cse68 c_~B~0.base) c_~B~0.offset))) (let ((.cse67 (store .cse20 .cse69 (store (select .cse20 .cse69) v_arrayElimCell_21 .cse21))) (.cse66 (* ~b~0 4))) (let ((.cse64 (select (select .cse67 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse66))) (.cse65 (select .cse67 (select (select (store .cse68 .cse69 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse64 (select .cse65 (+ .cse66 v_arrayElimCell_22))) (= .cse64 (select .cse65 (+ .cse66 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse6 .cse32) (= (select |c_#valid| c_~B~0.base) 1) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse75 (select (select .cse74 c_~B~0.base) c_~B~0.offset))) (let ((.cse73 (store .cse20 .cse75 (store (select .cse20 .cse75) v_arrayElimCell_22 .cse21))) (.cse72 (* ~b~0 4))) (let ((.cse70 (select (select .cse73 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse72))) (.cse71 (select .cse73 (select (select (store .cse74 .cse75 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse70 (select .cse71 (+ .cse72 v_arrayElimCell_22))) (= .cse70 (select .cse71 (+ .cse72 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse6 .cse76 (and (or .cse32 .cse0) (or .cse77 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse78 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_21 .cse44))) (.cse79 (* ~b~0 4))) (= (select (select .cse78 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse79)) (select (select .cse78 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse79 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse57) (<= 1 c_~L~0) (<= 0 c_~M~0) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse81 (* ~b~0 4))) (= (select .cse80 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse81)) (let ((.cse83 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse82 .cse83)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse83) .cse81))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse77 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse84 (select (select .cse85 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse84)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse85 .cse84 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse77 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse87 (select (select .cse88 c_~B~0.base) c_~B~0.offset))) (let ((.cse86 (select (select (store .cse88 .cse87 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse86 .cse87)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse86 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse77 (forall ((~a~0 Int)) (let ((.cse89 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse89 .cse8) (= c_~F~0.offset .cse89) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse91 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse90 (select (select .cse91 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse90)) (= (select (select (store .cse91 .cse90 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse77 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse92 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse93 (select (select .cse92 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse92 .cse93 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse93)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6 .cse76) (= c_~B~0.offset 0) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse96 (* ~b~0 4)) (.cse97 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_21) .cse99)))) (let ((.cse95 (select .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse94 (select (select .cse97 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse96)))) (or (= .cse94 (select .cse95 (+ .cse96 v_arrayElimCell_23))) (= (select .cse95 (+ .cse96 v_arrayElimCell_22)) .cse94))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse103 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse100 (select (select .cse103 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse100) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse101 (store .cse20 .cse100 (store (select .cse20 .cse100) v_arrayElimCell_21 .cse21))) (.cse102 (* ~b~0 4))) (= (select (select .cse101 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (select (select .cse101 (select (select (store .cse103 .cse100 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse102 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse104 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_22 .cse28))) (.cse105 (* ~b~0 4))) (= (select (select .cse104 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse105)) (select (select .cse104 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse105 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse106) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse107 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse110 .cse111 .cse99))) (.cse109 (* ~b~0 4))) (= (let ((.cse108 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse107 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse108)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse108) .cse109))) (select (select .cse107 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse109)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse112 (select (select .cse115 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse112)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse113 (store .cse20 .cse112 (store (select .cse20 .cse112) v_arrayElimCell_21 .cse21))) (.cse114 (* ~b~0 4))) (= (select (select .cse113 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse114)) (select (select .cse113 (select (select (store .cse115 .cse112 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse114 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse118 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse117 (select (select .cse118 c_~B~0.base) c_~B~0.offset))) (let ((.cse116 (select (select (store .cse118 .cse117 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse116) (< c_~N~0 (+ ~a~0 1)) (= .cse117 .cse116)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse122 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_22) .cse99))) (.cse121 (* ~b~0 4))) (let ((.cse119 (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse121))) (.cse120 (select .cse122 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse119 (select .cse120 (+ .cse121 v_arrayElimCell_23))) (= .cse119 (select .cse120 (+ .cse121 v_arrayElimCell_22))))))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse123 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse124 (select (select .cse123 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse123 .cse124 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse124 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse125 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_22) .cse99))) (.cse126 (* ~b~0 4))) (= (select (select .cse125 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse126)) (select (select .cse125 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse126 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse50) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse127 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_21) .cse99))) (.cse128 (* ~b~0 4))) (= (select (select .cse127 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse128 v_arrayElimCell_22)) (select (select .cse127 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse128)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse57) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse129 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_21) .cse99))) (.cse130 (* ~b~0 4))) (= (select (select .cse129 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse130)) (select (select .cse129 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse130 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse50) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse133 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse134 (select (select .cse133 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse131 (store .cse20 .cse134 (store (select .cse20 .cse134) v_arrayElimCell_22 .cse21))) (.cse132 (* ~b~0 4))) (= (select (select .cse131 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse132)) (select (select .cse131 (select (select (store .cse133 .cse134 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse132 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse134))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse137 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse136 (select (select .cse137 c_~B~0.base) c_~B~0.offset))) (let ((.cse135 (select (select (store .cse137 .cse136 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse135) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse136 .cse135)))))) .cse6) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse138 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse110 .cse111 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse139 (* ~b~0 4))) (= (select (select .cse138 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse139)) (let ((.cse140 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse138 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse140)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse140) .cse139))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse141 (store |c_#memory_int| .cse42 (store .cse43 (+ .cse98 v_arrayElimCell_22) .cse99))) (.cse142 (* ~b~0 4))) (= (select (select .cse141 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse142)) (select (select .cse141 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse142 v_arrayElimCell_22)))))) .cse57) (<= .cse60 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse106 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse143 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_21 .cse28))) (.cse144 (* ~b~0 4))) (= (select (select .cse143 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse144)) (select (select .cse143 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse144 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((~a~0 Int)) (let ((.cse145 (* ~a~0 c_~M~0))) (let ((.cse146 (+ c_~A~0.offset (* .cse145 4)))) (or (= .cse145 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse146 .cse8) (= c_~F~0.offset .cse146) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse148 (* ~b~0 4)) (.cse150 (store |c_#memory_int| .cse42 (store .cse43 v_arrayElimCell_22 .cse44)))) (let ((.cse147 (select .cse150 (select (select (store |c_#memory_$Pointer$.base| .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse149 (select (select .cse150 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse148)))) (or (= (select .cse147 (+ .cse148 v_arrayElimCell_23)) .cse149) (= (select .cse147 (+ .cse148 v_arrayElimCell_22)) .cse149))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse151 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_22 .cse28))) (.cse152 (* ~b~0 4))) (= (select (select .cse151 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse152)) (select (select .cse151 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse152 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse47) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse155 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse154 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse153 (select (select .cse155 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse153)) (< ~a~0 0) (= .cse154 .cse8) (= c_~F~0.offset .cse154) (= (select (select (store .cse155 .cse153 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (or .cse6 .cse32 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse158 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse157 (select (select .cse158 c_~B~0.base) c_~B~0.offset))) (let ((.cse156 (select (select (store .cse158 .cse157 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse156) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse157 .cse156))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse159 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse160 (select (select .cse159 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse159 .cse160 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse160)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse164 (store |c_#memory_int| .cse26 (store .cse27 v_arrayElimCell_22 .cse28))) (.cse163 (* ~b~0 4))) (let ((.cse161 (select (select .cse164 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse163))) (.cse162 (select .cse164 (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse161 (select .cse162 (+ .cse163 v_arrayElimCell_22))) (= .cse161 (select .cse162 (+ .cse163 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse77 .cse1 .cse76 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse3) .cse4) (< c_~N~0 (+ ~a~0 1)))) .cse6) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse6)))))))) is different from true [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:03,049 INFO L78 Accepts]: Start accepts. Automaton has currently 4592 states, but on-demand construction may add more states Word has length 255 [2024-05-30 22:42:03,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:03,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 22:42:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:03,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:03,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 969077090, now seen corresponding path program 2 times [2024-05-30 22:42:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109508054] [2024-05-30 22:42:03,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:03,286 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654986049] [2024-05-30 22:42:03,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 22:42:03,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:03,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:03,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-30 22:42:03,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 22:42:03,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:03,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 22:42:03,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-30 22:42:03,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-30 22:42:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109508054] [2024-05-30 22:42:04,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:42:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654986049] [2024-05-30 22:42:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654986049] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:04,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:42:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-05-30 22:42:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102587594] [2024-05-30 22:42:04,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 22:42:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 22:42:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-05-30 22:42:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:04,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:04,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.526315789473685) internal successors, (295), 19 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:04,927 INFO L78 Accepts]: Start accepts. Automaton has currently 8144 states, but on-demand construction may add more states Word has length 264 [2024-05-30 22:42:04,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:04,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-30 22:42:05,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-30 22:42:05,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:05,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash -974132272, now seen corresponding path program 3 times [2024-05-30 22:42:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:05,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962104551] [2024-05-30 22:42:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:05,154 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100247672] [2024-05-30 22:42:05,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 22:42:05,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:05,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:05,157 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:05,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-30 22:42:05,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-30 22:42:05,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:05,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 22:42:05,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-30 22:42:06,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-30 22:42:07,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962104551] [2024-05-30 22:42:07,715 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:42:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100247672] [2024-05-30 22:42:07,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100247672] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:07,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:42:07,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-05-30 22:42:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030145842] [2024-05-30 22:42:07,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:07,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-30 22:42:07,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-30 22:42:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-05-30 22:42:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:07,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:07,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 19.181818181818183) internal successors, (422), 22 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:07,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:10,255 INFO L78 Accepts]: Start accepts. Automaton has currently 18017 states, but on-demand construction may add more states Word has length 285 [2024-05-30 22:42:10,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:10,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 22:42:10,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:10,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:10,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:10,458 INFO L85 PathProgramCache]: Analyzing trace with hash -848205528, now seen corresponding path program 4 times [2024-05-30 22:42:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:10,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251451644] [2024-05-30 22:42:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:10,477 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613121338] [2024-05-30 22:42:10,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 22:42:10,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:10,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:10,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:10,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-30 22:42:10,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 22:42:10,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:10,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 22:42:10,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-30 22:42:10,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-30 22:42:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251451644] [2024-05-30 22:42:11,380 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:42:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613121338] [2024-05-30 22:42:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613121338] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:11,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:42:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-05-30 22:42:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851810307] [2024-05-30 22:42:11,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:11,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 22:42:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 22:42:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-05-30 22:42:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:11,382 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:11,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:11,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:12,183 INFO L78 Accepts]: Start accepts. Automaton has currently 18035 states, but on-demand construction may add more states Word has length 301 [2024-05-30 22:42:12,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:12,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-30 22:42:12,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-30 22:42:12,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:12,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1222648768, now seen corresponding path program 5 times [2024-05-30 22:42:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387164208] [2024-05-30 22:42:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:12,406 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123874241] [2024-05-30 22:42:12,406 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 22:42:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:12,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:12,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-30 22:42:31,754 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-30 22:42:31,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:31,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-30 22:42:31,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-30 22:42:32,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-30 22:42:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387164208] [2024-05-30 22:42:32,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:42:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123874241] [2024-05-30 22:42:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123874241] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:32,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:42:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-05-30 22:42:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197963097] [2024-05-30 22:42:32,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-30 22:42:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-30 22:42:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-05-30 22:42:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:32,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:32,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 14.09375) internal successors, (451), 32 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:42:32,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:32,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:32,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:32,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:32,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 22:42:33,968 INFO L78 Accepts]: Start accepts. Automaton has currently 18059 states, but on-demand construction may add more states Word has length 333 [2024-05-30 22:42:33,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:33,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-30 22:42:34,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-05-30 22:42:34,170 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:34,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1146638064, now seen corresponding path program 6 times [2024-05-30 22:42:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691515411] [2024-05-30 22:42:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:34,213 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942620240] [2024-05-30 22:42:34,213 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 22:42:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:34,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:34,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-30 22:42:35,292 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-05-30 22:42:35,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:35,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-30 22:42:35,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 40 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-30 22:42:36,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 45 proven. 41 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-30 22:42:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691515411] [2024-05-30 22:42:37,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:42:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942620240] [2024-05-30 22:42:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942620240] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:37,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:42:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2024-05-30 22:42:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748561189] [2024-05-30 22:42:37,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:37,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-30 22:42:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-30 22:42:37,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2024-05-30 22:42:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:37,775 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:37,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 11.666666666666666) internal successors, (455), 39 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 22:42:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 22:42:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 22:42:40,996 INFO L78 Accepts]: Start accepts. Automaton has currently 18136 states, but on-demand construction may add more states Word has length 381 [2024-05-30 22:42:40,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:41,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-30 22:42:41,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:41,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:41,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1682367302, now seen corresponding path program 7 times [2024-05-30 22:42:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822749345] [2024-05-30 22:42:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:41,225 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014711571] [2024-05-30 22:42:41,226 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 22:42:41,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:41,227 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-30 22:42:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:42:41,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 22:42:41,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 30 proven. 70 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-05-30 22:42:41,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-05-30 22:42:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822749345] [2024-05-30 22:42:42,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:42:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014711571] [2024-05-30 22:42:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014711571] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:42,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:42:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2024-05-30 22:42:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90593337] [2024-05-30 22:42:42,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:42,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-30 22:42:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-30 22:42:42,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-30 22:42:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:42,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:42,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 22:42:42,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 22:42:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 22:42:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 22:42:43,039 INFO L78 Accepts]: Start accepts. Automaton has currently 26072 states, but on-demand construction may add more states Word has length 406 [2024-05-30 22:42:43,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:43,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-05-30 22:42:43,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:43,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:43,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -270250118, now seen corresponding path program 8 times [2024-05-30 22:42:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561337511] [2024-05-30 22:42:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:43,269 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-30 22:42:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594528845] [2024-05-30 22:42:43,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 22:42:43,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:43,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:43,271 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 22:42:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-30 22:42:44,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 22:42:44,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:44,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 300 conjunts are in the unsatisfiable core [2024-05-30 22:42:44,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:45,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-30 22:42:46,746 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-30 22:42:46,746 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 [2024-05-30 22:42:49,025 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-05-30 22:42:49,026 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 [2024-05-30 22:42:50,643 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-05-30 22:42:50,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-05-30 22:42:54,397 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 11 treesize of output 7 [2024-05-30 22:42:54,406 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 [2024-05-30 22:42:56,589 INFO L349 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2024-05-30 22:42:56,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 36 [2024-05-30 22:42:57,694 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 41 treesize of output 30 [2024-05-30 22:42:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-30 22:42:58,813 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 16 treesize of output 11 [2024-05-30 22:42:58,861 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 15 treesize of output 1 [2024-05-30 22:42:58,895 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 41 treesize of output 30 [2024-05-30 22:43:00,233 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 19 treesize of output 18 [2024-05-30 22:43:00,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2024-05-30 22:43:00,302 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 [2024-05-30 22:43:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:43:01,908 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 87 treesize of output 64 [2024-05-30 22:43:01,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 22:43:01,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:43:01,950 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 23 treesize of output 16 [2024-05-30 22:43:02,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:43:02,561 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 23 treesize of output 16 [2024-05-30 22:43:02,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 22:43:02,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:43:02,575 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 78 treesize of output 57 [2024-05-30 22:43:03,676 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 23 treesize of output 16 [2024-05-30 22:43:03,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 69 treesize of output 50 [2024-05-30 22:43:03,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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 [2024-05-30 22:43:05,041 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 69 treesize of output 50 [2024-05-30 22:43:05,071 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 23 treesize of output 16 [2024-05-30 22:43:05,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2024-05-30 22:43:07,569 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 76 treesize of output 55 [2024-05-30 22:43:07,632 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 23 treesize of output 16 [2024-05-30 22:43:07,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2024-05-30 22:43:09,476 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-30 22:43:09,476 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 116 treesize of output 95 [2024-05-30 22:43:09,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2024-05-30 22:43:09,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-05-30 22:43:10,236 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 84 treesize of output 63 [2024-05-30 22:43:10,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 80 [2024-05-30 22:43:10,337 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 23 treesize of output 16 [2024-05-30 22:43:13,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-30 22:43:13,908 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 146 treesize of output 121 [2024-05-30 22:43:13,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-05-30 22:43:13,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 94 [2024-05-30 22:43:17,400 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-30 22:43:17,401 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 146 treesize of output 121 [2024-05-30 22:43:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 16 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 108 [2024-05-30 22:43:17,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-05-30 22:43:20,025 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-30 22:43:20,025 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 161 treesize of output 134 [2024-05-30 22:43:20,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-05-30 22:43:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 16 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 122 [2024-05-30 22:43:25,999 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-05-30 22:43:26,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 13 [2024-05-30 22:43:26,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 22:43:26,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 103 [2024-05-30 22:43:27,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:43:27,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 22:43:28,653 INFO L349 Elim1Store]: treesize reduction 756, result has 41.9 percent of original size [2024-05-30 22:43:28,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 8 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 283 treesize of output 673 [2024-05-30 22:46:13,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-05-30 22:46:13,688 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-30 22:46:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:46:13,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561337511] [2024-05-30 22:46:13,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 22:46:13,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594528845] [2024-05-30 22:46:13,689 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-30 22:46:13,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-05-30 22:46:13,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-30 22:46:13,901 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 65 more [2024-05-30 22:46:13,905 INFO L158 Benchmark]: Toolchain (without parser) took 413324.17ms. Allocated memory was 270.5MB in the beginning and 924.8MB in the end (delta: 654.3MB). Free memory was 192.2MB in the beginning and 322.5MB in the end (delta: -130.3MB). Peak memory consumption was 570.1MB. Max. memory is 8.0GB. [2024-05-30 22:46:13,905 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 270.5MB. Free memory was 235.9MB in the beginning and 235.9MB in the end (delta: 22.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 22:46:13,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.38ms. Allocated memory is still 270.5MB. Free memory was 191.8MB in the beginning and 179.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 22:46:13,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.31ms. Allocated memory is still 270.5MB. Free memory was 179.5MB in the beginning and 177.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 22:46:13,907 INFO L158 Benchmark]: Boogie Preprocessor took 35.16ms. Allocated memory is still 270.5MB. Free memory was 177.2MB in the beginning and 175.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 22:46:13,907 INFO L158 Benchmark]: RCFGBuilder took 598.88ms. Allocated memory is still 270.5MB. Free memory was 175.0MB in the beginning and 150.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-30 22:46:13,908 INFO L158 Benchmark]: TraceAbstraction took 412362.50ms. Allocated memory was 270.5MB in the beginning and 924.8MB in the end (delta: 654.3MB). Free memory was 148.8MB in the beginning and 322.5MB in the end (delta: -173.6MB). Peak memory consumption was 527.1MB. Max. memory is 8.0GB. [2024-05-30 22:46:13,910 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.12ms. Allocated memory is still 270.5MB. Free memory was 235.9MB in the beginning and 235.9MB in the end (delta: 22.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.38ms. Allocated memory is still 270.5MB. Free memory was 191.8MB in the beginning and 179.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.31ms. Allocated memory is still 270.5MB. Free memory was 179.5MB in the beginning and 177.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.16ms. Allocated memory is still 270.5MB. Free memory was 177.2MB in the beginning and 175.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 598.88ms. Allocated memory is still 270.5MB. Free memory was 175.0MB in the beginning and 150.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 412362.50ms. Allocated memory was 270.5MB in the beginning and 924.8MB in the end (delta: 654.3MB). Free memory was 148.8MB in the beginning and 322.5MB in the end (delta: -173.6MB). Peak memory consumption was 527.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-05-30 22:46:13,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...