/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --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.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 12:38:52,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 12:38:52,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 12:38:52,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 12:38:52,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 12:38:53,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 12:38:53,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 12:38:53,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 12:38:53,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 12:38:53,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 12:38:53,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 12:38:53,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 12:38:53,009 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 12:38:53,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 12:38:53,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 12:38:53,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 12:38:53,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 12:38:53,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 12:38:53,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 12:38:53,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 12:38:53,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 12:38:53,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 12:38:53,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 12:38:53,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 12:38:53,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 12:38:53,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 12:38:53,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 12:38:53,012 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 12:38:53,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 12:38:53,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 12:38:53,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 12:38:53,013 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 12:38:53,014 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 12:38:53,014 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: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2024-01-26 12:38:53,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 12:38:53,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 12:38:53,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 12:38:53,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 12:38:53,193 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 12:38:53,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2024-01-26 12:38:54,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 12:38:54,452 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 12:38:54,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2024-01-26 12:38:54,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d07a3c6aa/d244d58cc1ab4369b3ae36ed048bd474/FLAG28138dbe4 [2024-01-26 12:38:54,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d07a3c6aa/d244d58cc1ab4369b3ae36ed048bd474 [2024-01-26 12:38:54,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 12:38:54,479 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 12:38:54,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 12:38:54,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 12:38:54,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 12:38:54,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30211a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54, skipping insertion in model container [2024-01-26 12:38:54,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,528 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 12:38:54,647 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/popl20-more-min-array-hom.wvr.c[2625,2638] [2024-01-26 12:38:54,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 12:38:54,661 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 12:38:54,678 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/popl20-more-min-array-hom.wvr.c[2625,2638] [2024-01-26 12:38:54,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 12:38:54,690 INFO L206 MainTranslator]: Completed translation [2024-01-26 12:38:54,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54 WrapperNode [2024-01-26 12:38:54,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 12:38:54,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 12:38:54,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 12:38:54,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 12:38:54,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,719 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2024-01-26 12:38:54,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 12:38:54,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 12:38:54,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 12:38:54,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 12:38:54,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 12:38:54,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 12:38:54,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 12:38:54,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 12:38:54,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (1/1) ... [2024-01-26 12:38:54,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 12:38:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:54,782 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-01-26 12:38:54,817 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-01-26 12:38:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 12:38:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 12:38:54,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 12:38:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 12:38:54,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 12:38:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 12:38:54,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 12:38:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 12:38:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 12:38:54,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 12:38:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 12:38:54,827 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 12:38:54,903 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 12:38:54,905 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 12:38:55,170 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 12:38:55,214 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 12:38:55,214 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 12:38:55,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:38:55 BoogieIcfgContainer [2024-01-26 12:38:55,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 12:38:55,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 12:38:55,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 12:38:55,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 12:38:55,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:38:54" (1/3) ... [2024-01-26 12:38:55,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2c1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:38:55, skipping insertion in model container [2024-01-26 12:38:55,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:38:54" (2/3) ... [2024-01-26 12:38:55,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2c1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:38:55, skipping insertion in model container [2024-01-26 12:38:55,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:38:55" (3/3) ... [2024-01-26 12:38:55,221 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2024-01-26 12:38:55,227 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 12:38:55,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 12:38:55,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 12:38:55,234 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 12:38:55,323 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 12:38:55,361 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:38:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 12:38:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:55,364 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-01-26 12:38:55,369 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-01-26 12:38:55,393 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:38:55,399 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2024-01-26 12:38:55,399 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2024-01-26 12:38:55,399 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2024-01-26 12:38:55,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 12:38:55,409 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;@2e837678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:38:55,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 12:38:55,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:55,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1811752127, now seen corresponding path program 1 times [2024-01-26 12:38:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682879572] [2024-01-26 12:38:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:56,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682879572] [2024-01-26 12:38:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682879572] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:38:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:38:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 12:38:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195012963] [2024-01-26 12:38:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:56,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 12:38:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:56,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 12:38:56,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 12:38:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:56,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:56,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 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-01-26 12:38:56,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:56,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:56,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 12:38:56,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:56,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash -91942350, now seen corresponding path program 1 times [2024-01-26 12:38:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:56,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797592859] [2024-01-26 12:38:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:56,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797592859] [2024-01-26 12:38:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797592859] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:38:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:38:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 12:38:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092731588] [2024-01-26 12:38:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:56,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 12:38:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 12:38:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-26 12:38:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:56,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:56,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-01-26 12:38:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:57,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 12:38:57,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:57,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash 413118951, now seen corresponding path program 1 times [2024-01-26 12:38:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:57,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734532621] [2024-01-26 12:38:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734532621] [2024-01-26 12:38:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734532621] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:38:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:38:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-26 12:38:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780335836] [2024-01-26 12:38:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:57,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-26 12:38:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:57,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-26 12:38:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-01-26 12:38:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:57,444 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:57,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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-01-26 12:38:57,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:57,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:57,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:57,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 12:38:57,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:57,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -827457376, now seen corresponding path program 1 times [2024-01-26 12:38:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117796208] [2024-01-26 12:38:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:57,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117796208] [2024-01-26 12:38:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117796208] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:57,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313857892] [2024-01-26 12:38:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:57,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:57,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:57,898 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-01-26 12:38:57,902 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-01-26 12:38:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:58,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 12:38:58,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:58,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313857892] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:58,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 12:38:58,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-01-26 12:38:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743560908] [2024-01-26 12:38:58,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:58,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 12:38:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 12:38:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-01-26 12:38:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:58,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:58,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-01-26 12:38:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:58,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-26 12:38:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:58,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:58,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1980166771, now seen corresponding path program 1 times [2024-01-26 12:38:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209590608] [2024-01-26 12:38:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:59,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209590608] [2024-01-26 12:38:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209590608] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953594495] [2024-01-26 12:38:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:59,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:59,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:59,961 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-01-26 12:38:59,966 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-01-26 12:39:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:39:00,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-26 12:39:00,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:39:01,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:01,187 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 71 treesize of output 43 [2024-01-26 12:39:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:39:01,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:39:02,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:02,871 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 168 treesize of output 144 [2024-01-26 12:39:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:39:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953594495] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:39:06,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:39:06,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 22] total 59 [2024-01-26 12:39:06,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612958553] [2024-01-26 12:39:06,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:39:06,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-01-26 12:39:06,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:39:06,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-01-26 12:39:06,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=2855, Unknown=0, NotChecked=0, Total=3422 [2024-01-26 12:39:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:06,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:39:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 5.52542372881356) internal successors, (326), 59 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-01-26 12:39:06,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:06,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:06,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:39:06,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:06,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:39:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:39:09,235 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-01-26 12:39:09,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:39:09,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:39:09,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:39:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1713544953, now seen corresponding path program 2 times [2024-01-26 12:39:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:39:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698228938] [2024-01-26 12:39:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:39:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:39:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:39:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 12:39:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:39:09,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698228938] [2024-01-26 12:39:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698228938] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:39:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360898061] [2024-01-26 12:39:09,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 12:39:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:39:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:39:09,661 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-01-26 12:39:09,681 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-01-26 12:39:09,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 12:39:09,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:39:09,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 12:39:09,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:39:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:39:09,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:39:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:39:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360898061] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:39:09,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:39:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 22 [2024-01-26 12:39:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356472208] [2024-01-26 12:39:09,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:39:09,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-26 12:39:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:39:10,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-26 12:39:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-01-26 12:39:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:10,001 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:39:10,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 22 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-01-26 12:39:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:39:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:39:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:39:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:39:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:39:11,595 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-01-26 12:39:11,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:39:11,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:39:11,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:39:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1608063660, now seen corresponding path program 1 times [2024-01-26 12:39:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:39:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236684489] [2024-01-26 12:39:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:39:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:39:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:39:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:39:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:39:14,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236684489] [2024-01-26 12:39:14,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236684489] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:39:14,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879315029] [2024-01-26 12:39:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:39:14,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:39:14,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:39:14,341 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-01-26 12:39:14,346 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-01-26 12:39:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:39:14,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 69 conjunts are in the unsatisfiable core [2024-01-26 12:39:14,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:39:15,236 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 15 treesize of output 1 [2024-01-26 12:39:15,742 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-01-26 12:39:15,840 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-01-26 12:39:15,933 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-01-26 12:39:17,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:17,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 79 [2024-01-26 12:39:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:39:18,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:39:24,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~min2~0 c_~min1~0)) (.cse9 (+ c_~min3~0 1)) (.cse2 (+ c_~A~0.offset 4)) (.cse23 (= c_~min1~0 c_~min3~0))) (and (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (< .cse0 c_~min1~0) (< c_~min2~0 (+ .cse0 1)) (< c_~min3~0 .cse0) (< (select .cse1 .cse2) c_~min3~0) (= c_~min1~0 .cse0))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse5 (select .cse4 .cse2))) (let ((.cse3 (+ .cse5 1))) (or (< c_~min3~0 .cse3) (< (select .cse4 c_~A~0.offset) c_~min2~0) (< .cse5 c_~min1~0) (= c_~min1~0 .cse5) (< c_~min2~0 .cse3)))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse2))) (or (< (select .cse6 c_~A~0.offset) c_~min1~0) (< c_~min1~0 (+ .cse7 1)) (= c_~min3~0 .cse7) (< .cse7 c_~min3~0))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse8 (select .cse10 c_~A~0.offset))) (or (< .cse8 .cse9) (< c_~min1~0 (+ .cse8 1)) (< (select .cse10 .cse2) .cse8))))) (or .cse11 (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse12 (select .cse14 c_~A~0.offset)) (.cse13 (select .cse14 .cse2))) (or (< .cse12 c_~min1~0) (< c_~min3~0 (+ .cse13 1)) (< .cse12 c_~min2~0) (< .cse13 c_~min2~0) (< .cse13 c_~min1~0)))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (< .cse15 c_~min2~0) (< c_~min1~0 (+ .cse15 1)) (< (select .cse16 .cse2) .cse15) (= c_~min2~0 .cse15))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse17 (select .cse19 c_~A~0.offset)) (.cse18 (select .cse19 .cse2))) (or (< c_~min1~0 (+ .cse17 1)) (< .cse17 (+ .cse18 1)) (= c_~min3~0 .cse18) (< .cse18 c_~min3~0))))) (or (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse20 (select .cse22 c_~A~0.offset)) (.cse21 (select .cse22 .cse2))) (or (< .cse20 c_~min1~0) (< .cse20 c_~min2~0) (< .cse21 c_~min1~0) (< .cse21 c_~min3~0))))) (and (or .cse23 (< c_~min2~0 .cse9)) (or .cse11 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse25 (select .cse24 .cse2))) (or (< (select .cse24 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse25) (< .cse25 c_~min2~0) (< c_~min1~0 (+ .cse25 1)))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse2)) (.cse26 (select .cse28 c_~A~0.offset))) (or (< .cse26 c_~min1~0) (< c_~min3~0 (+ .cse27 1)) (< .cse27 .cse26) (< c_~min2~0 (+ .cse26 1)) (= c_~min1~0 .cse26))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse2))) (let ((.cse30 (select .cse32 c_~A~0.offset)) (.cse29 (+ .cse31 1))) (or (< c_~min3~0 .cse29) (< c_~min2~0 (+ .cse30 1)) (< .cse31 c_~min1~0) (< .cse30 .cse29) (= c_~min1~0 .cse31)))))) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse34 (select .cse35 c_~A~0.offset)) (.cse33 (select .cse35 .cse2))) (or (= c_~min2~0 .cse33) (< .cse33 c_~min2~0) (< c_~min1~0 (+ .cse34 1)) (< .cse34 (+ .cse33 1)))))) (or (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse36 (select .cse38 c_~A~0.offset)) (.cse37 (select .cse38 .cse2))) (or (< .cse36 c_~min1~0) (< .cse36 .cse9) (< c_~min2~0 (+ .cse36 1)) (< .cse37 c_~min1~0) (< .cse37 c_~min3~0))))) .cse23))) is different from false [2024-01-26 12:39:31,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~min1~0 c_~min3~0)) (.cse2 (+ c_~min3~0 1)) (.cse25 (= c_~min2~0 c_~min1~0)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse3 .cse4)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse0 c_~min1~0) (< .cse1 c_~min3~0) (< .cse1 c_~min1~0) (< .cse0 .cse2) (< c_~min2~0 (+ .cse0 1)))))) .cse5) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse6 (select .cse9 .cse4))) (let ((.cse8 (+ .cse6 1)) (.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min1~0 .cse6) (< .cse7 .cse8) (< c_~min3~0 .cse8) (< .cse6 c_~min1~0) (< c_~min2~0 (+ .cse7 1))))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse11 .cse4))) (or (= c_~min2~0 .cse10) (< (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse10 1)) (< .cse10 c_~min2~0))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse13 (select .cse14 .cse4))) (or (< c_~min1~0 (+ .cse12 1)) (< .cse12 (+ .cse13 1)) (< .cse13 c_~min3~0) (= .cse13 c_~min3~0))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse16 (select .cse17 .cse4)) (.cse15 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse15 c_~min1~0) (< c_~min3~0 (+ .cse16 1)) (= c_~min1~0 .cse15) (< .cse16 .cse15) (< c_~min2~0 (+ .cse15 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse18 1)) (< .cse18 .cse2) (< (select .cse19 .cse4) .cse18))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse20 1)) (< .cse20 c_~min2~0) (< (select .cse21 .cse4) .cse20) (= c_~min2~0 .cse20))))) (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse23 (select .cse24 .cse4)) (.cse22 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse22 c_~min1~0) (< .cse23 c_~min3~0) (< .cse23 c_~min1~0) (< .cse22 c_~min2~0))))) (and (or .cse5 (< c_~min2~0 .cse2)) (or .cse25 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse26 c_~min1~0) (< c_~min3~0 .cse26) (< (select .cse27 .cse4) c_~min3~0) (= c_~min1~0 .cse26) (< c_~min2~0 (+ .cse26 1)))))) (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse29 (select .cse30 .cse4)) (.cse28 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse28 c_~min1~0) (< c_~min3~0 (+ .cse29 1)) (< .cse29 c_~min1~0) (< .cse29 c_~min2~0) (< .cse28 c_~min2~0))))) .cse25) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse31 (select .cse33 .cse4))) (let ((.cse32 (+ .cse31 1))) (or (= c_~min1~0 .cse31) (< c_~min3~0 .cse32) (< .cse31 c_~min1~0) (< (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< c_~min2~0 .cse32)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse34 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse35 (select .cse34 .cse4))) (or (< (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse35 1)) (< .cse35 c_~min3~0) (= .cse35 c_~min3~0))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse36 (select .cse38 .cse4))) (or (= c_~min2~0 .cse36) (< c_~min1~0 (+ .cse37 1)) (< .cse37 (+ .cse36 1)) (< .cse36 c_~min2~0))))))) is different from false [2024-01-26 12:39:44,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:44,903 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 174 treesize of output 114 [2024-01-26 12:39:44,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:44,932 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 11018 treesize of output 10570 [2024-01-26 12:39:45,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,007 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 300 treesize of output 284 [2024-01-26 12:39:45,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,020 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 284 treesize of output 252 [2024-01-26 12:39:45,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,153 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 311 treesize of output 247 [2024-01-26 12:39:45,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,363 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 148 treesize of output 100 [2024-01-26 12:39:45,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,384 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 9333 treesize of output 8917 [2024-01-26 12:39:45,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,416 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 245 treesize of output 229 [2024-01-26 12:39:45,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,428 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 229 treesize of output 197 [2024-01-26 12:39:45,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,534 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 257 treesize of output 193 [2024-01-26 12:39:45,660 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:39:45,660 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 153 treesize of output 1 [2024-01-26 12:39:45,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,671 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 149 treesize of output 101 [2024-01-26 12:39:45,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,690 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 1294 treesize of output 1242 [2024-01-26 12:39:45,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,731 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 642 treesize of output 578 [2024-01-26 12:39:45,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 268 [2024-01-26 12:39:45,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:45,770 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 295 treesize of output 263 [2024-01-26 12:39:46,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,071 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 116 treesize of output 80 [2024-01-26 12:39:46,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,097 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 3424 treesize of output 3280 [2024-01-26 12:39:46,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,123 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 180 treesize of output 170 [2024-01-26 12:39:46,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,137 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 170 treesize of output 150 [2024-01-26 12:39:46,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,209 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 187 treesize of output 147 [2024-01-26 12:39:46,285 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:39:46,285 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 148 treesize of output 1 [2024-01-26 12:39:46,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,298 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 145 treesize of output 97 [2024-01-26 12:39:46,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,332 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 2514 treesize of output 2426 [2024-01-26 12:39:46,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,368 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 296 treesize of output 272 [2024-01-26 12:39:46,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,387 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 272 treesize of output 260 [2024-01-26 12:39:46,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,572 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 303 treesize of output 255 [2024-01-26 12:39:46,787 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:39:46,787 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 121 treesize of output 1 [2024-01-26 12:39:46,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,799 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 142 treesize of output 94 [2024-01-26 12:39:46,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,817 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 1033 treesize of output 989 [2024-01-26 12:39:46,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,841 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 489 treesize of output 441 [2024-01-26 12:39:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 205 [2024-01-26 12:39:46,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:46,877 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 225 treesize of output 201 [2024-01-26 12:39:47,167 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:39:47,168 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 180 treesize of output 1 [2024-01-26 12:39:47,195 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:39:47,195 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 121 treesize of output 1 [2024-01-26 12:39:47,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:47,208 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 117 treesize of output 81 [2024-01-26 12:39:47,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:47,230 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 4117 treesize of output 3957 [2024-01-26 12:39:47,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:47,264 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 257 treesize of output 245 [2024-01-26 12:39:47,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:47,277 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 245 treesize of output 221 [2024-01-26 12:39:47,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:47,331 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 265 treesize of output 217 [2024-01-26 12:39:47,398 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:39:47,399 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 149 treesize of output 1 [2024-01-26 12:39:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:39:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879315029] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:39:50,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:39:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37, 35] total 92 [2024-01-26 12:39:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584979802] [2024-01-26 12:39:50,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:39:50,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2024-01-26 12:39:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:39:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2024-01-26 12:39:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=7198, Unknown=85, NotChecked=354, Total=8372 [2024-01-26 12:39:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:50,621 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:39:50,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 4.304347826086956) internal successors, (396), 92 states have internal predecessors, (396), 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-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:39:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:58,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:00,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:03,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:05,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:07,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:11,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:13,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:15,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:17,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:19,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:42,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:44,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:47,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:49,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:57,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:40:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:40:58,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-26 12:40:59,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-26 12:40:59,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:40:59,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:40:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1861242052, now seen corresponding path program 2 times [2024-01-26 12:40:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:40:59,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933156407] [2024-01-26 12:40:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:40:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:40:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:40:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 12:40:59,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:40:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933156407] [2024-01-26 12:40:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933156407] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:40:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102443453] [2024-01-26 12:40:59,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 12:40:59,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:40:59,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:40:59,496 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-01-26 12:40:59,498 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-01-26 12:40:59,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 12:40:59,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:40:59,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-26 12:40:59,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:41:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 12:41:00,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:41:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 12:41:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102443453] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:41:01,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:41:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-01-26 12:41:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100255998] [2024-01-26 12:41:01,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:41:01,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-01-26 12:41:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:41:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-01-26 12:41:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-01-26 12:41:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:41:01,204 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:41:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.078947368421052) internal successors, (231), 38 states have internal predecessors, (231), 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-01-26 12:41:01,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:41:01,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:41:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:41:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:41:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:41:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:41:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:41:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:41:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:41:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:41:03,669 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-01-26 12:41:03,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:41:03,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:41:03,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:41:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1610044353, now seen corresponding path program 3 times [2024-01-26 12:41:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:41:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901668504] [2024-01-26 12:41:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:41:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:41:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:41:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:41:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:41:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901668504] [2024-01-26 12:41:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901668504] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:41:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190564415] [2024-01-26 12:41:13,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 12:41:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:41:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:41:13,801 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-01-26 12:41:13,802 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-01-26 12:41:13,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-26 12:41:13,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:41:13,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 79 conjunts are in the unsatisfiable core [2024-01-26 12:41:13,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:41:15,469 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 19 treesize of output 1 [2024-01-26 12:41:16,483 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-01-26 12:41:16,664 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-01-26 12:41:16,817 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-01-26 12:41:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:41:28,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:41:28,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 501 treesize of output 237 [2024-01-26 12:41:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:41:36,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:42:06,804 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse94 (* c_~N~0 4))) (let ((.cse9 (= c_~min2~0 c_~min1~0)) (.cse31 (= c_~min1~0 c_~min3~0)) (.cse30 (+ c_~min3~0 1)) (.cse5 (+ c_~A~0.offset .cse94 (- 8))) (.cse4 (+ c_~A~0.offset .cse94 (- 4)))) (and (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset)) (.cse2 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< c_~min1~0 (+ .cse0 1)) (= .cse1 c_~min3~0) (< .cse0 (+ .cse2 1)) (< .cse1 c_~min3~0) (< .cse2 (+ .cse1 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse5)) (.cse8 (select .cse7 .cse4))) (or (< c_~min2~0 (+ .cse6 1)) (< .cse6 c_~min1~0) (< (select .cse7 c_~A~0.offset) c_~min2~0) (= c_~min1~0 .cse6) (< .cse8 .cse6) (< c_~min3~0 (+ .cse8 1)))))) (or .cse9 (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse10 (select .cse13 c_~A~0.offset)) (.cse12 (select .cse13 .cse5)) (.cse11 (select .cse13 .cse4))) (or (< .cse10 c_~min1~0) (< .cse11 c_~min2~0) (< .cse12 c_~min1~0) (< .cse11 c_~min1~0) (< .cse10 c_~min2~0) (< .cse12 c_~min2~0) (< c_~min3~0 (+ .cse11 1))))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse16 (select .cse14 .cse5)) (.cse15 (select .cse14 .cse4))) (or (< (select .cse14 c_~A~0.offset) c_~min1~0) (< .cse15 c_~min2~0) (< c_~min1~0 (+ .cse16 1)) (= c_~min2~0 .cse15) (< .cse16 (+ .cse15 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse4))) (let ((.cse19 (+ .cse17 1))) (or (= .cse17 c_~min1~0) (< .cse17 c_~min1~0) (< (select .cse18 c_~A~0.offset) c_~min2~0) (< (select .cse18 .cse5) c_~min2~0) (< c_~min2~0 .cse19) (< c_~min3~0 .cse19)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse21 (select .cse23 c_~A~0.offset)) (.cse22 (select .cse23 .cse5)) (.cse20 (select .cse23 .cse4))) (or (< .cse20 c_~min2~0) (< c_~min1~0 (+ .cse21 1)) (= c_~min2~0 .cse20) (< .cse21 (+ .cse22 1)) (< .cse22 (+ .cse20 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse25 (select .cse24 c_~A~0.offset)) (.cse26 (select .cse24 .cse4))) (or (< (select .cse24 .cse5) .cse25) (< c_~min1~0 (+ .cse25 1)) (= .cse26 c_~min3~0) (< .cse25 (+ .cse26 1)) (< .cse26 c_~min3~0))))) (or (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse29 (select .cse28 .cse4)) (.cse27 (select .cse28 c_~A~0.offset))) (or (< .cse27 c_~min1~0) (< (select .cse28 .cse5) .cse27) (< .cse29 c_~min1~0) (< .cse27 .cse30) (< .cse29 c_~min3~0) (< c_~min2~0 (+ .cse27 1)))))) .cse31) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse34 (select .cse33 c_~A~0.offset)) (.cse32 (select .cse33 .cse4))) (or (< .cse32 c_~min2~0) (< (select .cse33 .cse5) .cse34) (< c_~min1~0 (+ .cse34 1)) (= c_~min2~0 .cse32) (< .cse34 (+ .cse32 1)))))) (or (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse35 (select .cse38 .cse5)) (.cse36 (select .cse38 .cse4)) (.cse37 (select .cse38 c_~A~0.offset))) (or (< .cse35 c_~min1~0) (< .cse35 .cse30) (< .cse36 c_~min1~0) (< .cse37 (+ .cse35 1)) (< .cse36 c_~min3~0) (< c_~min2~0 (+ .cse37 1)))))) .cse31) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse39 (select .cse41 c_~A~0.offset)) (.cse40 (select .cse41 .cse5))) (or (< c_~min1~0 (+ .cse39 1)) (= c_~min2~0 .cse40) (< .cse40 c_~min2~0) (< .cse39 (+ .cse40 1)) (< (select .cse41 .cse4) .cse40))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse43 (select .cse42 c_~A~0.offset))) (or (< (select .cse42 .cse5) .cse43) (= c_~min2~0 .cse43) (< c_~min1~0 (+ .cse43 1)) (< .cse43 c_~min2~0) (< (select .cse42 .cse4) .cse43))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse44 (select .cse47 .cse5)) (.cse46 (select .cse47 .cse4)) (.cse45 (select .cse47 c_~A~0.offset))) (or (< .cse44 c_~min1~0) (= c_~min1~0 .cse44) (< .cse45 (+ .cse44 1)) (< .cse46 .cse44) (< c_~min3~0 (+ .cse46 1)) (< c_~min2~0 (+ .cse45 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse49 (select .cse48 c_~A~0.offset))) (or (< (select .cse48 .cse5) .cse49) (< c_~min1~0 (+ .cse49 1)) (< .cse49 .cse30) (< (select .cse48 .cse4) .cse49))))) (or (and (or .cse31 (< c_~min2~0 .cse30)) (or .cse9 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse50 (select .cse53 c_~A~0.offset)) (.cse51 (select .cse53 .cse5)) (.cse52 (select .cse53 .cse4))) (or (< .cse50 c_~min1~0) (< .cse51 c_~min1~0) (< .cse52 c_~min1~0) (< .cse50 c_~min2~0) (< .cse51 c_~min2~0) (< .cse52 c_~min3~0)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse56 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse55 (select .cse56 c_~A~0.offset)) (.cse54 (select .cse56 .cse5))) (or (< .cse54 .cse30) (< c_~min1~0 (+ .cse55 1)) (< .cse55 (+ .cse54 1)) (< (select .cse56 .cse4) .cse54))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse58 (select .cse57 .cse5))) (or (< (select .cse57 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse58) (< c_~min1~0 (+ .cse58 1)) (< .cse58 c_~min2~0) (< (select .cse57 .cse4) .cse58))))) (or .cse31 (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse59 (select .cse61 .cse5)) (.cse60 (select .cse61 .cse4))) (or (< c_~min2~0 (+ .cse59 1)) (< .cse59 c_~min1~0) (< .cse59 .cse30) (< .cse60 c_~min1~0) (< (select .cse61 c_~A~0.offset) c_~min2~0) (< .cse60 c_~min3~0)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse62 (select .cse63 .cse4))) (let ((.cse65 (+ .cse62 1)) (.cse64 (select .cse63 c_~A~0.offset))) (or (= .cse62 c_~min1~0) (< (select .cse63 .cse5) .cse64) (< .cse62 c_~min1~0) (< .cse64 .cse65) (< c_~min3~0 .cse65) (< c_~min2~0 (+ .cse64 1))))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse66 (select .cse67 .cse5))) (or (< c_~min2~0 (+ .cse66 1)) (< .cse66 c_~min1~0) (< (select .cse67 c_~A~0.offset) c_~min2~0) (= c_~min1~0 .cse66) (< (select .cse67 .cse4) c_~min3~0) (< c_~min3~0 .cse66))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse68 (select .cse69 c_~A~0.offset))) (or (< .cse68 c_~min1~0) (< (select .cse69 .cse5) .cse68) (= c_~min1~0 .cse68) (< c_~min3~0 .cse68) (< (select .cse69 .cse4) c_~min3~0) (< c_~min2~0 (+ .cse68 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse70 (select .cse74 .cse4))) (let ((.cse72 (select .cse74 .cse5)) (.cse73 (+ .cse70 1)) (.cse71 (select .cse74 c_~A~0.offset))) (or (= .cse70 c_~min1~0) (< .cse70 c_~min1~0) (< .cse71 (+ .cse72 1)) (< .cse72 .cse73) (< c_~min3~0 .cse73) (< c_~min2~0 (+ .cse71 1))))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse77 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse76 (select .cse77 .cse4))) (let ((.cse75 (select .cse77 .cse5)) (.cse78 (+ .cse76 1))) (or (< c_~min2~0 (+ .cse75 1)) (= .cse76 c_~min1~0) (< .cse76 c_~min1~0) (< (select .cse77 c_~A~0.offset) c_~min2~0) (< .cse75 .cse78) (< c_~min3~0 .cse78)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse79 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse80 (select .cse79 .cse5)) (.cse81 (select .cse79 .cse4))) (or (< (select .cse79 c_~A~0.offset) c_~min1~0) (< c_~min1~0 (+ .cse80 1)) (= .cse81 c_~min3~0) (< .cse81 c_~min3~0) (< .cse80 (+ .cse81 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse84 (select .cse83 .cse4)) (.cse82 (select .cse83 c_~A~0.offset))) (or (< .cse82 c_~min1~0) (< (select .cse83 .cse5) .cse82) (= c_~min1~0 .cse82) (< .cse84 .cse82) (< c_~min3~0 (+ .cse84 1)) (< c_~min2~0 (+ .cse82 1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse85 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse86 (select .cse85 .cse5))) (or (< (select .cse85 c_~A~0.offset) c_~min1~0) (< .cse86 .cse30) (< c_~min1~0 (+ .cse86 1)) (< (select .cse85 .cse4) .cse86))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse87 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse88 (select .cse87 .cse4))) (or (< (select .cse87 c_~A~0.offset) c_~min1~0) (< .cse88 c_~min2~0) (< c_~min1~0 (+ .cse88 1)) (< (select .cse87 .cse5) c_~min1~0) (= c_~min2~0 .cse88))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse91 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse90 (select .cse91 c_~A~0.offset)) (.cse89 (select .cse91 .cse5))) (or (< .cse89 c_~min1~0) (= c_~min1~0 .cse89) (< .cse90 (+ .cse89 1)) (< (select .cse91 .cse4) c_~min3~0) (< c_~min2~0 (+ .cse90 1)) (< c_~min3~0 .cse89))))) (forall ((v_ArrVal_266 (Array Int Int))) (let ((.cse92 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse93 (select .cse92 .cse4))) (or (< (select .cse92 c_~A~0.offset) c_~min1~0) (< c_~min1~0 (+ .cse93 1)) (< (select .cse92 .cse5) c_~min1~0) (= .cse93 c_~min3~0) (< .cse93 c_~min3~0)))))))) is different from false [2024-01-26 12:42:10,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse94 (* c_~N~0 4))) (let ((.cse6 (= c_~min1~0 c_~min3~0)) (.cse54 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~min3~0 1)) (.cse4 (+ c_~A~0.offset .cse94 (- 8))) (.cse5 (+ c_~A~0.offset .cse94 (- 4)))) (and (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< .cse0 c_~min3~0) (< .cse1 .cse2) (< c_~min2~0 (+ .cse1 1)) (< (select .cse3 c_~A~0.offset) c_~min2~0) (< .cse0 c_~min1~0) (< .cse1 c_~min1~0))))) .cse6) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse4)) (.cse9 (select .cse8 .cse5))) (or (= c_~min1~0 .cse7) (< c_~min2~0 (+ .cse7 1)) (< (select .cse8 c_~A~0.offset) c_~min2~0) (< .cse7 c_~min1~0) (< .cse9 .cse7) (< c_~min3~0 (+ .cse9 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5))) (let ((.cse10 (select .cse14 c_~A~0.offset)) (.cse11 (select .cse14 .cse4)) (.cse13 (+ .cse12 1))) (or (< .cse10 (+ .cse11 1)) (< .cse12 c_~min1~0) (= c_~min1~0 .cse12) (< c_~min3~0 .cse13) (< c_~min2~0 (+ .cse10 1)) (< .cse11 .cse13)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse15 1)) (< .cse15 c_~min2~0) (< (select .cse16 .cse5) .cse15) (= c_~min2~0 .cse15) (< (select .cse16 .cse4) .cse15))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse4)) (.cse18 (select .cse19 .cse5))) (or (< c_~min1~0 (+ .cse17 1)) (< .cse18 c_~min3~0) (= .cse18 c_~min3~0) (< (select .cse19 c_~A~0.offset) c_~min1~0) (< .cse17 (+ .cse18 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4))) (or (< c_~min1~0 (+ .cse20 1)) (= c_~min2~0 .cse20) (< .cse20 c_~min2~0) (< (select .cse21 .cse5) .cse20) (< (select .cse21 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse22 (select .cse25 .cse5)) (.cse23 (select .cse25 .cse4)) (.cse24 (select .cse25 c_~A~0.offset))) (or (< .cse22 c_~min3~0) (< .cse23 .cse2) (< .cse24 (+ .cse23 1)) (< .cse22 c_~min1~0) (< .cse23 c_~min1~0) (< c_~min2~0 (+ .cse24 1)))))) .cse6) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse28 (select .cse27 .cse5))) (let ((.cse26 (select .cse27 .cse4)) (.cse29 (+ .cse28 1))) (or (< c_~min2~0 (+ .cse26 1)) (< (select .cse27 c_~A~0.offset) c_~min2~0) (< .cse28 c_~min1~0) (= c_~min1~0 .cse28) (< c_~min3~0 .cse29) (< .cse26 .cse29)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse31 (select .cse33 c_~A~0.offset)) (.cse32 (select .cse33 .cse4)) (.cse30 (select .cse33 .cse5))) (or (< .cse30 c_~min3~0) (< c_~min1~0 (+ .cse31 1)) (< .cse31 (+ .cse32 1)) (= .cse30 c_~min3~0) (< .cse32 (+ .cse30 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse34 (select .cse35 .cse5))) (or (< .cse34 c_~min2~0) (< c_~min1~0 (+ .cse34 1)) (< (select .cse35 .cse4) c_~min1~0) (< (select .cse35 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse34))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse38 (select .cse39 .cse5))) (let ((.cse37 (+ .cse38 1)) (.cse36 (select .cse39 c_~A~0.offset))) (or (< .cse36 .cse37) (< .cse38 c_~min1~0) (= c_~min1~0 .cse38) (< c_~min3~0 .cse37) (< c_~min2~0 (+ .cse36 1)) (< (select .cse39 .cse4) .cse36)))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse40 (select .cse42 .cse5)) (.cse41 (select .cse42 c_~A~0.offset))) (or (< .cse40 c_~min3~0) (< .cse41 .cse2) (< .cse40 c_~min1~0) (< c_~min2~0 (+ .cse41 1)) (< (select .cse42 .cse4) .cse41) (< .cse41 c_~min1~0))))) .cse6) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse43 (select .cse44 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse43 1)) (< (select .cse44 .cse5) .cse43) (< .cse43 .cse2) (< (select .cse44 .cse4) .cse43))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse45 (select .cse47 c_~A~0.offset)) (.cse46 (select .cse47 .cse5))) (or (< c_~min1~0 (+ .cse45 1)) (< .cse46 c_~min2~0) (< .cse45 (+ .cse46 1)) (< (select .cse47 .cse4) .cse45) (= c_~min2~0 .cse46))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse49 (select .cse50 c_~A~0.offset)) (.cse48 (select .cse50 .cse4))) (or (< .cse48 .cse2) (< c_~min1~0 (+ .cse49 1)) (< .cse49 (+ .cse48 1)) (< (select .cse50 .cse5) .cse48))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse51 (select .cse53 .cse5)) (.cse52 (select .cse53 c_~A~0.offset))) (or (< .cse51 c_~min3~0) (< c_~min1~0 (+ .cse52 1)) (< .cse52 (+ .cse51 1)) (= .cse51 c_~min3~0) (< (select .cse53 .cse4) .cse52))))) (or .cse54 (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse57 (select .cse58 .cse4)) (.cse55 (select .cse58 .cse5)) (.cse56 (select .cse58 c_~A~0.offset))) (or (< .cse55 c_~min2~0) (< .cse56 c_~min2~0) (< .cse57 c_~min2~0) (< .cse55 c_~min1~0) (< .cse57 c_~min1~0) (< c_~min3~0 (+ .cse55 1)) (< .cse56 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse59 (select .cse62 .cse4)) (.cse61 (select .cse62 .cse5)) (.cse60 (select .cse62 c_~A~0.offset))) (or (= c_~min1~0 .cse59) (< .cse60 (+ .cse59 1)) (< .cse59 c_~min1~0) (< .cse61 .cse59) (< c_~min3~0 (+ .cse61 1)) (< c_~min2~0 (+ .cse60 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse64 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse63 (select .cse64 .cse5))) (or (< .cse63 c_~min3~0) (< c_~min1~0 (+ .cse63 1)) (= .cse63 c_~min3~0) (< (select .cse64 .cse4) c_~min1~0) (< (select .cse64 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse66 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse65 (select .cse66 c_~A~0.offset))) (or (< c_~min3~0 .cse65) (< (select .cse66 .cse5) c_~min3~0) (= c_~min1~0 .cse65) (< c_~min2~0 (+ .cse65 1)) (< (select .cse66 .cse4) .cse65) (< .cse65 c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse68 (select .cse67 .cse4))) (or (< (select .cse67 .cse5) c_~min3~0) (= c_~min1~0 .cse68) (< c_~min2~0 (+ .cse68 1)) (< (select .cse67 c_~A~0.offset) c_~min2~0) (< .cse68 c_~min1~0) (< c_~min3~0 .cse68))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse72 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse69 (select .cse72 .cse5)) (.cse71 (select .cse72 .cse4)) (.cse70 (select .cse72 c_~A~0.offset))) (or (< .cse69 c_~min3~0) (< .cse70 c_~min2~0) (< .cse71 c_~min2~0) (< .cse69 c_~min1~0) (< .cse71 c_~min1~0) (< .cse70 c_~min1~0))))) (and (or .cse6 (< c_~min2~0 .cse2)) (or .cse54 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse75 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse73 (select .cse75 .cse4)) (.cse74 (select .cse75 .cse5))) (or (< c_~min1~0 (+ .cse73 1)) (< .cse74 c_~min2~0) (< (select .cse75 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse74) (< .cse73 (+ .cse74 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse77 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse78 (select .cse77 .cse5))) (let ((.cse76 (+ .cse78 1))) (or (< c_~min2~0 .cse76) (< (select .cse77 c_~A~0.offset) c_~min2~0) (< (select .cse77 .cse4) c_~min2~0) (< .cse78 c_~min1~0) (= c_~min1~0 .cse78) (< c_~min3~0 .cse76)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse80 (select .cse81 c_~A~0.offset)) (.cse79 (select .cse81 .cse4))) (or (= c_~min2~0 .cse79) (< c_~min1~0 (+ .cse80 1)) (< .cse80 (+ .cse79 1)) (< .cse79 c_~min2~0) (< (select .cse81 .cse5) .cse79))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse82 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse83 (select .cse82 .cse4)) (.cse84 (select .cse82 c_~A~0.offset))) (or (< (select .cse82 .cse5) c_~min3~0) (= c_~min1~0 .cse83) (< .cse84 (+ .cse83 1)) (< .cse83 c_~min1~0) (< c_~min3~0 .cse83) (< c_~min2~0 (+ .cse84 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse86 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse85 (select .cse86 .cse4))) (or (< c_~min1~0 (+ .cse85 1)) (< .cse85 .cse2) (< (select .cse86 .cse5) .cse85) (< (select .cse86 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse87 (select .cse90 c_~A~0.offset)) (.cse89 (select .cse90 .cse4)) (.cse88 (select .cse90 .cse5))) (or (< c_~min1~0 (+ .cse87 1)) (< .cse88 c_~min2~0) (< .cse87 (+ .cse89 1)) (= c_~min2~0 .cse88) (< .cse89 (+ .cse88 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse93 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse92 (select .cse93 .cse5)) (.cse91 (select .cse93 c_~A~0.offset))) (or (= c_~min1~0 .cse91) (< .cse92 .cse91) (< c_~min3~0 (+ .cse92 1)) (< c_~min2~0 (+ .cse91 1)) (< (select .cse93 .cse4) .cse91) (< .cse91 c_~min1~0)))))))) is different from false [2024-01-26 12:42:14,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse94 (* c_~N~0 4))) (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse14 (= c_~min1~0 c_~min3~0)) (.cse15 (+ c_~min3~0 1)) (.cse5 (+ c_~A~0.offset .cse94 (- 4))) (.cse6 (+ c_~A~0.offset .cse94 (- 8)))) (and (or .cse0 (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 c_~A~0.offset)) (.cse1 (select .cse4 .cse5))) (or (< .cse1 c_~min2~0) (< .cse2 c_~min2~0) (< .cse3 c_~min2~0) (< .cse3 c_~min1~0) (< .cse2 c_~min1~0) (< c_~min3~0 (+ .cse1 1)) (< .cse1 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse9 (select .cse7 .cse5)) (.cse8 (select .cse7 c_~A~0.offset))) (or (< (select .cse7 .cse6) .cse8) (= .cse8 c_~min1~0) (< .cse8 c_~min1~0) (< c_~min3~0 (+ .cse9 1)) (< .cse9 .cse8) (< c_~min2~0 (+ .cse8 1)))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse6)) (.cse10 (select .cse13 c_~A~0.offset)) (.cse12 (select .cse13 .cse5))) (or (< .cse10 c_~min2~0) (< .cse11 c_~min2~0) (< .cse11 c_~min1~0) (< .cse10 c_~min1~0) (< .cse12 c_~min3~0) (< .cse12 c_~min1~0))))) (and (or .cse14 (< c_~min2~0 .cse15)) (or .cse0 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse5))) (or (< .cse16 c_~min2~0) (= c_~min2~0 .cse16) (< c_~min1~0 (+ .cse16 1)) (< (select .cse17 .cse6) c_~min1~0) (< (select .cse17 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse18 (select .cse21 c_~A~0.offset)) (.cse20 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse6))) (or (< .cse18 (+ .cse19 1)) (< .cse19 c_~min1~0) (< c_~min3~0 (+ .cse20 1)) (< c_~min2~0 (+ .cse18 1)) (< .cse20 .cse19) (= .cse19 c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse22 (select .cse25 c_~A~0.offset)) (.cse23 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse5))) (or (< .cse22 (+ .cse23 1)) (= c_~min3~0 .cse24) (< .cse24 c_~min3~0) (< c_~min1~0 (+ .cse22 1)) (< .cse23 (+ .cse24 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse6)) (.cse26 (select .cse28 c_~A~0.offset))) (or (< .cse26 (+ .cse27 1)) (= .cse27 c_~min2~0) (< .cse27 c_~min2~0) (< (select .cse28 .cse5) .cse27) (< c_~min1~0 (+ .cse26 1)))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse30 (select .cse29 c_~A~0.offset)) (.cse31 (select .cse29 .cse5))) (or (< (select .cse29 .cse6) .cse30) (< .cse30 c_~min1~0) (< .cse30 .cse15) (< c_~min2~0 (+ .cse30 1)) (< .cse31 c_~min3~0) (< .cse31 c_~min1~0))))) .cse14) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse34 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse32 (select .cse34 c_~A~0.offset)) (.cse33 (select .cse34 .cse6))) (or (< .cse32 (+ .cse33 1)) (< c_~min3~0 .cse33) (< .cse33 c_~min1~0) (< c_~min2~0 (+ .cse32 1)) (< (select .cse34 .cse5) c_~min3~0) (= .cse33 c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse35 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse36 (select .cse35 .cse6))) (or (< (select .cse35 c_~A~0.offset) c_~min2~0) (< c_~min3~0 .cse36) (< .cse36 c_~min1~0) (< (select .cse35 .cse5) c_~min3~0) (< c_~min2~0 (+ .cse36 1)) (= .cse36 c_~min1~0))))) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse37 (select .cse40 c_~A~0.offset)) (.cse38 (select .cse40 .cse6)) (.cse39 (select .cse40 .cse5))) (or (< .cse37 (+ .cse38 1)) (< .cse38 c_~min1~0) (< c_~min2~0 (+ .cse37 1)) (< .cse39 c_~min3~0) (< .cse38 .cse15) (< .cse39 c_~min1~0))))) .cse14) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse41 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse42 (select .cse41 c_~A~0.offset))) (or (< (select .cse41 .cse6) .cse42) (< .cse42 c_~min2~0) (< (select .cse41 .cse5) .cse42) (< c_~min1~0 (+ .cse42 1)) (= .cse42 c_~min2~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse43 (select .cse44 .cse6))) (or (< c_~min1~0 (+ .cse43 1)) (< (select .cse44 c_~A~0.offset) c_~min1~0) (< .cse43 .cse15) (< (select .cse44 .cse5) .cse43))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse47 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse46 (select .cse47 .cse6)) (.cse45 (select .cse47 c_~A~0.offset))) (or (< .cse45 (+ .cse46 1)) (< .cse46 .cse15) (< (select .cse47 .cse5) .cse46) (< c_~min1~0 (+ .cse45 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse49 (select .cse51 c_~A~0.offset)) (.cse50 (select .cse51 .cse6)) (.cse48 (select .cse51 .cse5))) (or (< .cse48 c_~min2~0) (< .cse49 (+ .cse50 1)) (= c_~min2~0 .cse48) (< c_~min1~0 (+ .cse49 1)) (< .cse50 (+ .cse48 1)))))) (or .cse14 (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse53 (select .cse52 .cse6)) (.cse54 (select .cse52 .cse5))) (or (< (select .cse52 c_~A~0.offset) c_~min2~0) (< .cse53 c_~min1~0) (< .cse54 c_~min3~0) (< .cse53 .cse15) (< c_~min2~0 (+ .cse53 1)) (< .cse54 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse56 (select .cse57 .cse6)) (.cse55 (select .cse57 .cse5))) (or (< .cse55 c_~min2~0) (= c_~min2~0 .cse55) (< c_~min1~0 (+ .cse56 1)) (< (select .cse57 c_~A~0.offset) c_~min1~0) (< .cse56 (+ .cse55 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse59 (select .cse58 .cse5))) (let ((.cse60 (+ .cse59 1))) (or (< (select .cse58 c_~A~0.offset) c_~min2~0) (< (select .cse58 .cse6) c_~min2~0) (= c_~min1~0 .cse59) (< c_~min3~0 .cse60) (< c_~min2~0 .cse60) (< .cse59 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse61 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse62 (select .cse61 c_~A~0.offset))) (or (< (select .cse61 .cse6) .cse62) (< .cse62 .cse15) (< (select .cse61 .cse5) .cse62) (< c_~min1~0 (+ .cse62 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse64 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse63 (select .cse64 .cse5))) (or (= c_~min3~0 .cse63) (< c_~min1~0 (+ .cse63 1)) (< (select .cse64 .cse6) c_~min1~0) (< (select .cse64 c_~A~0.offset) c_~min1~0) (< .cse63 c_~min3~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse67 (select .cse69 .cse5))) (let ((.cse65 (select .cse69 c_~A~0.offset)) (.cse66 (select .cse69 .cse6)) (.cse68 (+ .cse67 1))) (or (< .cse65 (+ .cse66 1)) (= c_~min1~0 .cse67) (< c_~min3~0 .cse68) (< c_~min2~0 (+ .cse65 1)) (< .cse66 .cse68) (< .cse67 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse70 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse71 (select .cse70 c_~A~0.offset))) (or (< (select .cse70 .cse6) .cse71) (= .cse71 c_~min1~0) (< .cse71 c_~min1~0) (< c_~min2~0 (+ .cse71 1)) (< (select .cse70 .cse5) c_~min3~0) (< c_~min3~0 .cse71))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse74 (select .cse72 .cse5)) (.cse73 (select .cse72 .cse6))) (or (< (select .cse72 c_~A~0.offset) c_~min2~0) (< .cse73 c_~min1~0) (< c_~min3~0 (+ .cse74 1)) (< .cse74 .cse73) (< c_~min2~0 (+ .cse73 1)) (= .cse73 c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse77 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse75 (select .cse77 .cse6)) (.cse76 (select .cse77 .cse5))) (or (< c_~min1~0 (+ .cse75 1)) (= c_~min3~0 .cse76) (< (select .cse77 c_~A~0.offset) c_~min1~0) (< .cse76 c_~min3~0) (< .cse75 (+ .cse76 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse78 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse80 (select .cse78 .cse5))) (let ((.cse81 (+ .cse80 1)) (.cse79 (select .cse78 c_~A~0.offset))) (or (< (select .cse78 .cse6) .cse79) (= c_~min1~0 .cse80) (< c_~min3~0 .cse81) (< .cse79 .cse81) (< c_~min2~0 (+ .cse79 1)) (< .cse80 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse83 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse82 (select .cse83 .cse5)) (.cse84 (select .cse83 c_~A~0.offset))) (or (< .cse82 c_~min2~0) (< (select .cse83 .cse6) .cse84) (= c_~min2~0 .cse82) (< .cse84 (+ .cse82 1)) (< c_~min1~0 (+ .cse84 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse85 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse86 (select .cse85 .cse5))) (let ((.cse88 (select .cse85 .cse6)) (.cse87 (+ .cse86 1))) (or (< (select .cse85 c_~A~0.offset) c_~min2~0) (= c_~min1~0 .cse86) (< c_~min3~0 .cse87) (< c_~min2~0 (+ .cse88 1)) (< .cse88 .cse87) (< .cse86 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse89 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse91 (select .cse89 .cse5)) (.cse90 (select .cse89 c_~A~0.offset))) (or (< (select .cse89 .cse6) .cse90) (= c_~min3~0 .cse91) (< .cse90 (+ .cse91 1)) (< .cse91 c_~min3~0) (< c_~min1~0 (+ .cse90 1)))))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse93 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (let ((.cse92 (select .cse93 .cse6))) (or (< c_~min1~0 (+ .cse92 1)) (= .cse92 c_~min2~0) (< .cse92 c_~min2~0) (< (select .cse93 c_~A~0.offset) c_~min1~0) (< (select .cse93 .cse5) .cse92)))))))) is different from false [2024-01-26 12:42:50,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:50,022 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 230 treesize of output 158 [2024-01-26 12:42:50,113 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2024-01-26 12:42:50,114 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 973 treesize of output 921 [2024-01-26 12:42:50,187 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-01-26 12:42:50,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 899 treesize of output 811 [2024-01-26 12:42:50,218 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-01-26 12:42:50,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 811 treesize of output 635 [2024-01-26 12:42:50,255 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-01-26 12:42:50,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 337 treesize of output 293 [2024-01-26 12:42:52,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:52,421 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 238 treesize of output 154 [2024-01-26 12:42:52,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:52,524 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 7295 treesize of output 6935 [2024-01-26 12:42:52,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:52,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 425 treesize of output 317 [2024-01-26 12:42:52,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:52,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 385 [2024-01-26 12:42:53,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:53,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 369 treesize of output 323 [2024-01-26 12:42:54,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:54,124 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 189 treesize of output 129 [2024-01-26 12:42:54,262 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-01-26 12:42:54,263 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 5813 treesize of output 5472 [2024-01-26 12:42:54,351 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:54,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 201 [2024-01-26 12:42:54,593 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:54,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 293 treesize of output 269 [2024-01-26 12:42:54,667 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:54,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 205 [2024-01-26 12:42:55,002 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:42:55,003 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 228 treesize of output 1 [2024-01-26 12:42:55,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:55,026 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 215 treesize of output 143 [2024-01-26 12:42:55,154 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-01-26 12:42:55,155 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 784 treesize of output 747 [2024-01-26 12:42:55,264 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:55,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 736 treesize of output 608 [2024-01-26 12:42:55,350 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:55,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 600 treesize of output 540 [2024-01-26 12:42:55,438 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:55,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 281 treesize of output 255 [2024-01-26 12:42:57,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:57,246 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 163 treesize of output 115 [2024-01-26 12:42:57,380 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-01-26 12:42:57,380 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 3090 treesize of output 2941 [2024-01-26 12:42:57,481 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:57,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 298 [2024-01-26 12:42:57,556 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:57,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 268 [2024-01-26 12:42:58,171 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:58,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 375 treesize of output 263 [2024-01-26 12:42:58,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:58,386 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 162 treesize of output 114 [2024-01-26 12:42:58,462 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:42:58,462 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 1353 treesize of output 1277 [2024-01-26 12:42:58,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:58,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 251 [2024-01-26 12:42:58,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:58,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 221 [2024-01-26 12:42:59,008 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:42:59,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 205 [2024-01-26 12:42:59,149 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:42:59,149 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 257 treesize of output 1 [2024-01-26 12:42:59,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:42:59,172 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 193 treesize of output 133 [2024-01-26 12:42:59,307 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-01-26 12:42:59,307 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 790 treesize of output 752 [2024-01-26 12:42:59,415 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:59,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 773 treesize of output 707 [2024-01-26 12:42:59,498 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 699 treesize of output 559 [2024-01-26 12:42:59,584 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:42:59,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 263 [2024-01-26 12:43:01,364 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:01,364 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 220 treesize of output 1 [2024-01-26 12:43:01,381 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:01,382 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 195 treesize of output 1 [2024-01-26 12:43:01,398 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:01,399 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 177 treesize of output 1 [2024-01-26 12:43:01,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:01,423 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 163 treesize of output 115 [2024-01-26 12:43:01,502 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:01,503 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 1518 treesize of output 1442 [2024-01-26 12:43:01,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:01,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 375 treesize of output 271 [2024-01-26 12:43:01,843 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:01,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 294 [2024-01-26 12:43:01,902 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:01,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 264 [2024-01-26 12:43:02,092 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:02,093 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 222 treesize of output 1 [2024-01-26 12:43:02,109 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:02,110 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 255 treesize of output 1 [2024-01-26 12:43:02,126 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:02,126 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 198 treesize of output 1 [2024-01-26 12:43:02,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:02,159 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 224 treesize of output 152 [2024-01-26 12:43:02,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:02,269 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 8484 treesize of output 8076 [2024-01-26 12:43:02,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:02,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 495 treesize of output 472 [2024-01-26 12:43:02,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:02,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 982 treesize of output 842 [2024-01-26 12:43:02,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:02,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 449 treesize of output 387 [2024-01-26 12:43:04,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:04,272 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 196 treesize of output 136 [2024-01-26 12:43:04,432 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-01-26 12:43:04,432 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 1831 treesize of output 1744 [2024-01-26 12:43:04,535 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:43:04,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 457 treesize of output 317 [2024-01-26 12:43:04,992 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:43:04,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 426 treesize of output 397 [2024-01-26 12:43:05,072 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:43:05,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 389 treesize of output 323 [2024-01-26 12:43:06,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:06,192 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 198 treesize of output 138 [2024-01-26 12:43:06,337 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-01-26 12:43:06,338 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 1863 treesize of output 1776 [2024-01-26 12:43:06,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 12:43:06,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:06,438 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 1 case distinctions, treesize of input 457 treesize of output 428 [2024-01-26 12:43:06,530 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:43:06,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 845 treesize of output 779 [2024-01-26 12:43:06,622 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-01-26 12:43:06,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 771 treesize of output 631 [2024-01-26 12:43:08,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:08,698 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 206 treesize of output 134 [2024-01-26 12:43:08,784 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:08,784 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 1627 treesize of output 1555 [2024-01-26 12:43:08,880 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:08,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 779 treesize of output 687 [2024-01-26 12:43:08,985 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:08,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 301 treesize of output 281 [2024-01-26 12:43:09,063 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:09,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 291 [2024-01-26 12:43:09,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:09,844 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 213 treesize of output 141 [2024-01-26 12:43:09,933 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:09,933 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 1739 treesize of output 1657 [2024-01-26 12:43:10,032 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:10,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 814 treesize of output 702 [2024-01-26 12:43:10,135 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:10,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 306 treesize of output 281 [2024-01-26 12:43:10,215 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 12:43:10,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 345 treesize of output 291 [2024-01-26 12:43:10,803 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:10,803 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 222 treesize of output 1 [2024-01-26 12:43:10,822 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:10,822 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 250 treesize of output 1 [2024-01-26 12:43:10,841 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:10,841 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 195 treesize of output 1 [2024-01-26 12:43:10,860 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:10,860 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 215 treesize of output 1 [2024-01-26 12:43:10,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:10,934 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 189 treesize of output 129 [2024-01-26 12:43:11,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:11,051 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 827 treesize of output 799 [2024-01-26 12:43:11,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:11,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 879 treesize of output 831 [2024-01-26 12:43:11,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:11,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 815 treesize of output 703 [2024-01-26 12:43:11,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:43:11,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 357 treesize of output 341 [2024-01-26 12:43:14,182 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:14,182 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 225 treesize of output 1 [2024-01-26 12:43:14,202 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:14,202 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 203 treesize of output 1 [2024-01-26 12:43:14,221 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:43:14,221 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 223 treesize of output 1 [2024-01-26 12:43:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-26 12:43:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190564415] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:43:19,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:43:19,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 42] total 122 [2024-01-26 12:43:19,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537749482] [2024-01-26 12:43:19,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:43:19,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2024-01-26 12:43:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:43:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2024-01-26 12:43:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1041, Invalid=12955, Unknown=58, NotChecked=708, Total=14762 [2024-01-26 12:43:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:43:19,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:43:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 3.6557377049180326) internal successors, (446), 122 states have internal predecessors, (446), 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-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:43:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:45:09,856 WARN L293 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 372 DAG size of output: 292 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:45:35,459 WARN L293 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 392 DAG size of output: 335 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:46:39,137 WARN L293 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 284 DAG size of output: 224 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:46:46,675 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 298 DAG size of output: 222 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:46:55,101 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 282 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:47:03,238 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 251 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:47:11,666 WARN L293 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 267 DAG size of output: 201 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:47:19,696 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 250 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:47:50,937 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 270 DAG size of output: 204 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:47:59,451 WARN L293 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 281 DAG size of output: 215 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:48:29,165 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 270 DAG size of output: 231 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:48:37,733 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 271 DAG size of output: 232 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:48:45,917 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 264 DAG size of output: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:48:54,294 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 254 DAG size of output: 216 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:02,039 WARN L293 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 265 DAG size of output: 227 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:11,203 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 285 DAG size of output: 245 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:19,940 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 296 DAG size of output: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:29,080 WARN L293 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 301 DAG size of output: 225 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:37,607 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 312 DAG size of output: 236 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:46,356 WARN L293 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 287 DAG size of output: 227 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:49:54,896 WARN L293 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 298 DAG size of output: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:50:49,303 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 281 DAG size of output: 221 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:50:56,369 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 295 DAG size of output: 219 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:51:03,592 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 279 DAG size of output: 239 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:51:10,277 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 248 DAG size of output: 210 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:51:17,241 WARN L293 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 264 DAG size of output: 198 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:51:24,008 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 247 DAG size of output: 209 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:51:30,934 WARN L293 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 267 DAG size of output: 201 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:51:38,183 WARN L293 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 278 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:01,023 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 267 DAG size of output: 228 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:08,084 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 268 DAG size of output: 229 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:14,994 WARN L293 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 261 DAG size of output: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:21,848 WARN L293 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 251 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:28,843 WARN L293 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 262 DAG size of output: 224 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:36,340 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 282 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:43,753 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 293 DAG size of output: 253 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:50,757 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 298 DAG size of output: 222 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 12:52:57,993 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 309 DAG size of output: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-01-26 12:53:03,309 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 12:53:03,324 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 12:53:03,325 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 12:53:03,359 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-01-26 12:53:03,543 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,SelfDestructingSolverStorable8 [2024-01-26 12:53:03,544 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-3-2-4-5-2-4-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-4-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-16-4-2-4-4-2-2-2-2-3-2-2-1 context. [2024-01-26 12:53:03,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 12:53:03,551 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-01-26 12:53:03,552 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-01-26 12:53:03,553 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 12:53:03,553 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 12:53:03,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 12:53:03 BasicIcfg [2024-01-26 12:53:03,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 12:53:03,555 INFO L158 Benchmark]: Toolchain (without parser) took 849076.49ms. Allocated memory was 401.6MB in the beginning and 1.0GB in the end (delta: 645.9MB). Free memory was 349.5MB in the beginning and 926.5MB in the end (delta: -577.0MB). Peak memory consumption was 661.4MB. Max. memory is 8.0GB. [2024-01-26 12:53:03,556 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 12:53:03,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.91ms. Allocated memory is still 401.6MB. Free memory was 349.2MB in the beginning and 337.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 12:53:03,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.66ms. Allocated memory is still 401.6MB. Free memory was 337.0MB in the beginning and 335.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 12:53:03,556 INFO L158 Benchmark]: Boogie Preprocessor took 22.40ms. Allocated memory is still 401.6MB. Free memory was 335.2MB in the beginning and 333.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 12:53:03,556 INFO L158 Benchmark]: RCFGBuilder took 471.60ms. Allocated memory is still 401.6MB. Free memory was 333.5MB in the beginning and 311.1MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-01-26 12:53:03,556 INFO L158 Benchmark]: TraceAbstraction took 848338.91ms. Allocated memory was 401.6MB in the beginning and 1.0GB in the end (delta: 645.9MB). Free memory was 310.4MB in the beginning and 926.5MB in the end (delta: -616.1MB). Peak memory consumption was 621.5MB. Max. memory is 8.0GB. [2024-01-26 12:53:03,557 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.08ms. Allocated memory is still 205.5MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.91ms. Allocated memory is still 401.6MB. Free memory was 349.2MB in the beginning and 337.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.66ms. Allocated memory is still 401.6MB. Free memory was 337.0MB in the beginning and 335.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.40ms. Allocated memory is still 401.6MB. Free memory was 335.2MB in the beginning and 333.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 471.60ms. Allocated memory is still 401.6MB. Free memory was 333.5MB in the beginning and 311.1MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 848338.91ms. Allocated memory was 401.6MB in the beginning and 1.0GB in the end (delta: 645.9MB). Free memory was 310.4MB in the beginning and 926.5MB in the end (delta: -616.1MB). Peak memory consumption was 621.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11280, independent: 9536, independent conditional: 9536, independent unconditional: 0, dependent: 1744, dependent conditional: 1744, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 0, Positive unconditional cache size: 554, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1744, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9375, independent: 8783, independent conditional: 8783, independent unconditional: 0, dependent: 592, dependent conditional: 592, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 0, Positive unconditional cache size: 554, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2336, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 10272, independent: 9615, independent conditional: 9615, independent unconditional: 0, dependent: 657, dependent conditional: 657, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 819, Positive conditional cache size: 0, Positive unconditional cache size: 819, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2993, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 10273, independent: 9615, independent conditional: 9615, independent unconditional: 0, dependent: 658, dependent conditional: 658, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 819, Positive conditional cache size: 0, Positive unconditional cache size: 819, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 3651, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 596, independent: 545, independent conditional: 545, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 862, Positive cache size: 862, Positive conditional cache size: 0, Positive unconditional cache size: 862, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 3702, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6633, independent: 6164, independent conditional: 6164, independent unconditional: 0, dependent: 469, dependent conditional: 469, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 1209, Positive cache size: 1209, Positive conditional cache size: 0, Positive unconditional cache size: 1209, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 4171, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12349, independent: 11493, independent conditional: 11493, independent unconditional: 0, dependent: 856, dependent conditional: 856, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 1275, Positive cache size: 1275, Positive conditional cache size: 0, Positive unconditional cache size: 1275, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 5027, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12660, independent: 11794, independent conditional: 11794, independent unconditional: 0, dependent: 866, dependent conditional: 866, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 1391, Positive cache size: 1391, Positive conditional cache size: 0, Positive unconditional cache size: 1391, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 5893, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19720, independent: 18406, independent conditional: 18406, independent unconditional: 0, dependent: 1314, dependent conditional: 1314, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 1391, Positive cache size: 1391, Positive conditional cache size: 0, Positive unconditional cache size: 1391, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 7207, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2945, independent: 2822, independent conditional: 2822, independent unconditional: 0, dependent: 123, dependent conditional: 123, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 96103, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 7330, dependent conditional: 7330, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 88773, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88773, independent: 88773, independent conditional: 0, independent unconditional: 88773, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1391, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 88773, independent: 87382, independent conditional: 0, independent unconditional: 87382, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1391, unknown conditional: 0, unknown unconditional: 1391] , Statistics on independence cache: Total cache size (in pairs): 1391, Positive cache size: 1391, Positive conditional cache size: 0, Positive unconditional cache size: 1391, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 7330, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8658, independent: 8146, independent conditional: 8146, independent unconditional: 0, dependent: 512, dependent conditional: 512, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8146, independent: 8146, independent conditional: 8146, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8146, independent: 8146, independent conditional: 8146, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8146, independent: 8146, independent conditional: 0, independent unconditional: 8146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8146, independent: 8146, independent conditional: 0, independent unconditional: 8146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8146, independent: 8146, independent conditional: 0, independent unconditional: 8146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 292, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 292, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8146, independent: 7854, independent conditional: 0, independent unconditional: 7854, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 292, unknown conditional: 0, unknown unconditional: 292] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 292, Positive conditional cache size: 0, Positive unconditional cache size: 292, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 512 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-3-2-4-5-2-4-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-4-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-16-4-2-4-4-2-2-2-2-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 185 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 848.2s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 659.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 438, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 185.7s InterpolantComputationTime, 2076 NumberOfCodeBlocks, 2076 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2922 ConstructedInterpolants, 85 QuantifiedInterpolants, 247274 SizeOfPredicates, 157 NumberOfNonLiveVariables, 2007 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 160/427 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown