/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-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 12:23:50,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 12:23:51,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 12:23:51,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 12:23:51,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 12:23:51,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 12:23:51,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 12:23:51,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 12:23:51,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 12:23:51,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 12:23:51,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 12:23:51,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 12:23:51,073 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 12:23:51,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 12:23:51,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 12:23:51,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 12:23:51,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 12:23:51,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 12:23:51,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 12:23:51,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 12:23:51,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 12:23:51,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 12:23:51,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 12:23:51,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 12:23:51,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 12:23:51,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 12:23:51,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 12:23:51,078 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 12:23:51,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 12:23:51,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 12:23:51,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 12:23:51,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 12:23:51,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 12:23:51,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 12:23:51,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 12:23:51,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 12:23:51,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 12:23:51,081 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 12:23:51,081 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 12:23:51,082 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:23:51,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 12:23:51,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 12:23:51,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 12:23:51,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 12:23:51,387 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 12:23:51,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2024-01-26 12:23:52,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 12:23:52,812 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 12:23:52,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2024-01-26 12:23:52,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe29fe7bc/c6226f8024c64a6bb0eca1ac17b6077a/FLAG6adc7f85c [2024-01-26 12:23:52,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe29fe7bc/c6226f8024c64a6bb0eca1ac17b6077a [2024-01-26 12:23:52,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 12:23:52,833 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 12:23:52,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 12:23:52,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 12:23:52,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 12:23:52,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:23:52" (1/1) ... [2024-01-26 12:23:52,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416f007d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:52, skipping insertion in model container [2024-01-26 12:23:52,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:23:52" (1/1) ... [2024-01-26 12:23:52,858 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 12:23:53,026 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-channel-sum.wvr.c[2973,2986] [2024-01-26 12:23:53,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 12:23:53,052 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 12:23:53,084 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-channel-sum.wvr.c[2973,2986] [2024-01-26 12:23:53,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 12:23:53,102 INFO L206 MainTranslator]: Completed translation [2024-01-26 12:23:53,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53 WrapperNode [2024-01-26 12:23:53,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 12:23:53,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 12:23:53,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 12:23:53,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 12:23:53,109 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:23:53" (1/1) ... [2024-01-26 12:23:53,122 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:23:53" (1/1) ... [2024-01-26 12:23:53,147 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 157 [2024-01-26 12:23:53,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 12:23:53,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 12:23:53,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 12:23:53,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 12:23:53,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 12:23:53,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 12:23:53,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 12:23:53,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 12:23:53,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (1/1) ... [2024-01-26 12:23:53,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 12:23:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:23:53,235 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:23:53,268 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:23:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 12:23:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 12:23:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 12:23:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 12:23:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 12:23:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 12:23:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 12:23:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 12:23:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 12:23:53,274 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:23:53,382 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 12:23:53,384 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 12:23:53,634 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 12:23:53,680 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 12:23:53,680 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 12:23:53,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:23:53 BoogieIcfgContainer [2024-01-26 12:23:53,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 12:23:53,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 12:23:53,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 12:23:53,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 12:23:53,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:23:52" (1/3) ... [2024-01-26 12:23:53,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c1bf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:23:53, skipping insertion in model container [2024-01-26 12:23:53,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:23:53" (2/3) ... [2024-01-26 12:23:53,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c1bf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:23:53, skipping insertion in model container [2024-01-26 12:23:53,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:23:53" (3/3) ... [2024-01-26 12:23:53,688 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2024-01-26 12:23:53,695 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 12:23:53,702 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 12:23:53,702 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 12:23:53,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 12:23:53,761 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 12:23:53,830 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:23:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 12:23:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:23:53,840 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:23:53,878 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:23:53,902 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:23:53,910 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2024-01-26 12:23:53,910 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2024-01-26 12:23:53,910 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2024-01-26 12:23:53,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 12:23:53,920 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;@62919cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:23:53,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 12:23:54,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:23:54,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:23:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -541385620, now seen corresponding path program 1 times [2024-01-26 12:23:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:23:54,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480132438] [2024-01-26 12:23:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:23:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:23:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:23:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-26 12:23:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:23:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480132438] [2024-01-26 12:23:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480132438] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:23:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:23:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 12:23:54,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640458715] [2024-01-26 12:23:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:23:54,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 12:23:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:23:54,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 12:23:54,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 12:23:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:54,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:23:54,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 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:23:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 12:23:54,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:23:54,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:23:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1391244755, now seen corresponding path program 1 times [2024-01-26 12:23:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:23:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089680007] [2024-01-26 12:23:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:23:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:23:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:23:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:23:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:23:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089680007] [2024-01-26 12:23:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089680007] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:23:55,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:23:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 12:23:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769355370] [2024-01-26 12:23:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:23:55,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 12:23:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:23:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 12:23:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-26 12:23:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:23:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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:23:55,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:23:55,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 12:23:55,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:23:55,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:23:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1471518481, now seen corresponding path program 1 times [2024-01-26 12:23:55,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:23:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119753203] [2024-01-26 12:23:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:23:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:23:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:23:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-26 12:23:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:23:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119753203] [2024-01-26 12:23:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119753203] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:23:55,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:23:55,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-26 12:23:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348638356] [2024-01-26 12:23:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:23:55,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 12:23:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:23:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 12:23:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-26 12:23:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,448 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:23:55,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:23:55,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:23:55,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:23:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:23:55,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 12:23:55,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:23:55,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:23:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -707617001, now seen corresponding path program 1 times [2024-01-26 12:23:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:23:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923528753] [2024-01-26 12:23:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:23:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:23:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:23:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:23:55,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:23:55,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923528753] [2024-01-26 12:23:55,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923528753] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:23:55,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:23:55,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-26 12:23:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515412412] [2024-01-26 12:23:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:23:55,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-26 12:23:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:23:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-26 12:23:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-26 12:23:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:23:55,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:23:55,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:23:55,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:23:55,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:23:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:23:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:23:55,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 12:23:55,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:23:55,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:23:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1655796533, now seen corresponding path program 2 times [2024-01-26 12:23:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:23:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794296671] [2024-01-26 12:23:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:23:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:23:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:23:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:23:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:23:56,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794296671] [2024-01-26 12:23:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794296671] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:23:56,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073932370] [2024-01-26 12:23:56,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 12:23:56,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:23:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:23:56,970 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:23:56,998 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:23:57,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 12:23:57,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:23:57,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 34 conjunts are in the unsatisfiable core [2024-01-26 12:23:57,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:23:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:23:58,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:23:58,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:23:58,263 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 40 treesize of output 24 [2024-01-26 12:23:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:23:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073932370] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:23:59,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:23:59,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 17] total 47 [2024-01-26 12:23:59,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969563414] [2024-01-26 12:23:59,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:23:59,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-01-26 12:23:59,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:23:59,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-01-26 12:23:59,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1767, Unknown=0, NotChecked=0, Total=2162 [2024-01-26 12:23:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:59,143 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:23:59,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.042553191489362) internal successors, (284), 47 states have internal predecessors, (284), 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:23:59,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:23:59,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:23:59,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:23:59,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:23:59,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-01-26 12:24:00,983 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:24:01,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:24:01,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:24:01,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:24:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1897215900, now seen corresponding path program 3 times [2024-01-26 12:24:01,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:24:01,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760693484] [2024-01-26 12:24:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:24:01,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:24:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:24:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:24:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:24:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760693484] [2024-01-26 12:24:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760693484] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:24:01,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:24:01,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 12:24:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831784277] [2024-01-26 12:24:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:24:01,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 12:24:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:24:01,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 12:24:01,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-26 12:24:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:24:01,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:24:01,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:01,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:01,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-01-26 12:24:01,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-01-26 12:24:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 12:24:01,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:24:01,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:24:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 824001069, now seen corresponding path program 4 times [2024-01-26 12:24:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:24:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457744531] [2024-01-26 12:24:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:24:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:24:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:24:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-01-26 12:24:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:24:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457744531] [2024-01-26 12:24:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457744531] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:24:01,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:24:01,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-26 12:24:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837538228] [2024-01-26 12:24:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:24:01,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 12:24:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:24:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 12:24:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-26 12:24:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:24:01,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-01-26 12:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-01-26 12:24:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:01,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 12:24:01,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:24:01,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:24:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1299265812, now seen corresponding path program 1 times [2024-01-26 12:24:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:24:01,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011517782] [2024-01-26 12:24:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:24:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:24:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:24:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:03,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:24:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011517782] [2024-01-26 12:24:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011517782] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:24:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846107044] [2024-01-26 12:24:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:24:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:24:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:24:03,572 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:24:03,591 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:24:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:24:03,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 54 conjunts are in the unsatisfiable core [2024-01-26 12:24:03,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:24:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:05,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:24:06,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:24:06,195 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 75 treesize of output 60 [2024-01-26 12:24:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:07,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846107044] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:24:07,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:24:07,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 26] total 80 [2024-01-26 12:24:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021992162] [2024-01-26 12:24:07,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:24:07,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-01-26 12:24:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:24:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-01-26 12:24:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=5504, Unknown=0, NotChecked=0, Total=6320 [2024-01-26 12:24:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:07,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:24:07,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.9125) internal successors, (393), 80 states have internal predecessors, (393), 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:24:07,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:07,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:07,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-01-26 12:24:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-01-26 12:24:13,251 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:24:13,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:24:13,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:24:13,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:24:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash -951766108, now seen corresponding path program 2 times [2024-01-26 12:24:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:24:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146723719] [2024-01-26 12:24:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:24:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:24:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:24:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:16,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:24:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146723719] [2024-01-26 12:24:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146723719] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:24:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132082339] [2024-01-26 12:24:16,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 12:24:16,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:24:16,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:24:16,135 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:24:16,138 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:24:16,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 12:24:16,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:24:16,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2024-01-26 12:24:16,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:24:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:18,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:24:19,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:24:19,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2024-01-26 12:24:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132082339] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:24:21,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:24:21,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 37, 36] total 102 [2024-01-26 12:24:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115885855] [2024-01-26 12:24:21,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:24:21,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-01-26 12:24:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:24:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-01-26 12:24:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1323, Invalid=8979, Unknown=0, NotChecked=0, Total=10302 [2024-01-26 12:24:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:21,074 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:24:21,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 4.715686274509804) internal successors, (481), 102 states have internal predecessors, (481), 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:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-01-26 12:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:21,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:21,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-01-26 12:24:21,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:24:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:24:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2024-01-26 12:24:37,613 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:24:37,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:24:37,809 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:24:37,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:24:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash 465396979, now seen corresponding path program 3 times [2024-01-26 12:24:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:24:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074658298] [2024-01-26 12:24:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:24:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:24:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:24:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 23 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:24:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074658298] [2024-01-26 12:24:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074658298] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:24:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911356740] [2024-01-26 12:24:41,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 12:24:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:24:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:24:41,969 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:24:41,969 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:24:42,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-01-26 12:24:42,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:24:42,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 93 conjunts are in the unsatisfiable core [2024-01-26 12:24:42,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:24:47,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:24:47,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:24:47,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:24:47,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:24:47,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:24:47,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:24:47,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:24:47,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 110 [2024-01-26 12:24:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:24:48,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:24:53,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:24:53,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 168 treesize of output 410 [2024-01-26 12:25:05,647 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:07,513 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:07,768 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:07,947 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:08,272 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:08,433 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:08,677 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:09,203 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:09,402 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:09,560 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:09,712 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:09,807 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:11,096 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:11,135 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:11,382 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:11,657 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:11,753 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:12,078 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:12,234 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:12,316 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:12,698 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:12,985 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:13,623 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:13,713 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 12:25:13,783 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:14,246 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:25:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:25:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911356740] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:25:27,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:25:27,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 57, 52] total 153 [2024-01-26 12:25:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956197567] [2024-01-26 12:25:27,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:25:27,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 153 states [2024-01-26 12:25:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:25:27,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2024-01-26 12:25:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2409, Invalid=20847, Unknown=0, NotChecked=0, Total=23256 [2024-01-26 12:25:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:25:27,235 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:25:27,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 153 states, 153 states have (on average 3.869281045751634) internal successors, (592), 153 states have internal predecessors, (592), 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:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 181 states. [2024-01-26 12:25:27,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:27:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:27:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2024-01-26 12:27:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 483 states. [2024-01-26 12:27:30,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-26 12:27:30,679 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,SelfDestructingSolverStorable9 [2024-01-26 12:27:30,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:27:30,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:27:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -228093097, now seen corresponding path program 4 times [2024-01-26 12:27:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:27:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671614179] [2024-01-26 12:27:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:27:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:27:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:27:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:27:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:27:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671614179] [2024-01-26 12:27:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671614179] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:27:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751560349] [2024-01-26 12:27:39,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 12:27:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:27:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:27:39,358 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:27:39,359 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:27:39,494 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 12:27:39,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:27:39,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 88 conjunts are in the unsatisfiable core [2024-01-26 12:27:39,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:27:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 4 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:27:43,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:27:47,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:27:47,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 143 treesize of output 190 [2024-01-26 12:27:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:27:50,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751560349] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:27:50,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:27:50,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 47, 46] total 133 [2024-01-26 12:27:50,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033651398] [2024-01-26 12:27:50,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:27:50,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2024-01-26 12:27:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:27:50,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2024-01-26 12:27:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1727, Invalid=15829, Unknown=0, NotChecked=0, Total=17556 [2024-01-26 12:27:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:27:50,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:27:50,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 133 states, 133 states have (on average 4.413533834586466) internal successors, (587), 133 states have internal predecessors, (587), 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:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 185 states. [2024-01-26 12:27:50,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 483 states. [2024-01-26 12:27:50,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:28:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2024-01-26 12:28:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 483 states. [2024-01-26 12:28:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 346 states. [2024-01-26 12:28:49,154 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:28:49,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:28:49,355 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:28:49,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:28:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash -611468839, now seen corresponding path program 5 times [2024-01-26 12:28:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:28:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729161525] [2024-01-26 12:28:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:28:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:28:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:28:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 0 proven. 359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:28:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:28:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729161525] [2024-01-26 12:28:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729161525] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:28:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114188474] [2024-01-26 12:28:59,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 12:28:59,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:28:59,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:28:59,302 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:28:59,303 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:28:59,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-01-26 12:28:59,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:28:59,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 133 conjunts are in the unsatisfiable core [2024-01-26 12:28:59,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:29:01,493 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:29:02,176 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:29:02,302 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:29:07,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:29:07,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 20 [2024-01-26 12:29:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 8 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:29:08,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:29:19,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:29:19,769 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 303 treesize of output 195 [2024-01-26 12:29:19,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:29:19,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 608 treesize of output 760 [2024-01-26 12:29:20,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:29:20,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 516 treesize of output 620 [2024-01-26 12:29:20,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:29:20,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 347 treesize of output 519 [2024-01-26 12:30:06,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:30:06,719 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 302 treesize of output 194 [2024-01-26 12:30:06,795 INFO L349 Elim1Store]: treesize reduction 220, result has 8.7 percent of original size [2024-01-26 12:30:06,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 604 treesize of output 536 [2024-01-26 12:30:06,893 INFO L349 Elim1Store]: treesize reduction 220, result has 8.7 percent of original size [2024-01-26 12:30:06,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 516 treesize of output 400 [2024-01-26 12:30:06,993 INFO L349 Elim1Store]: treesize reduction 220, result has 8.7 percent of original size [2024-01-26 12:30:06,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 347 treesize of output 299 [2024-01-26 12:30:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 0 proven. 359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:30:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114188474] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:30:10,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:30:10,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 70, 65] total 185 [2024-01-26 12:30:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107083765] [2024-01-26 12:30:10,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:30:10,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 185 states [2024-01-26 12:30:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:30:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2024-01-26 12:30:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3576, Invalid=30395, Unknown=69, NotChecked=0, Total=34040 [2024-01-26 12:30:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:30:10,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:30:10,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 185 states, 185 states have (on average 3.675675675675676) internal successors, (680), 185 states have internal predecessors, (680), 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:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 185 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 483 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 346 states. [2024-01-26 12:30:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:31:02,945 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_~back~0 4)) (.cse36 (* c_~front~0 4))) (let ((.cse57 (+ c_~queue~0.offset .cse36 16)) (.cse55 (+ c_~queue~0.offset .cse36 12)) (.cse56 (+ c_~queue~0.offset .cse36 4)) (.cse53 (+ c_~queue~0.offset .cse36)) (.cse54 (+ c_~queue~0.offset .cse36 8)) (.cse59 (+ c_~queue~0.offset .cse49 8)) (.cse58 (+ c_~queue~0.offset .cse49 4)) (.cse30 (select |c_#memory_int| c_~queue~0.base)) (.cse52 (+ c_~queue~0.offset .cse49 12))) (let ((.cse51 (+ c_~queue~0.offset .cse49)) (.cse26 (+ c_~back~0 4)) (.cse23 (+ c_~back~0 3)) (.cse27 (select .cse30 .cse52)) (.cse28 (select .cse30 .cse58)) (.cse29 (select .cse30 .cse59)) (.cse24 (= c_~back~0 c_~front~0)) (.cse91 (+ c_~front~0 1)) (.cse9 (select .cse30 .cse54)) (.cse10 (select .cse30 .cse53)) (.cse11 (select .cse30 .cse56)) (.cse12 (select .cse30 .cse55)) (.cse19 (select .cse30 .cse57)) (.cse21 (not (= (select .cse30 (+ .cse36 12)) 1)))) (let ((.cse20 (or .cse21 (< 0 c_~sum~0))) (.cse2 (let ((.cse92 (+ c_~sum~0 .cse9 .cse10 .cse11 .cse12 .cse19))) (and (<= .cse92 1) (<= 0 .cse92)))) (.cse22 (= .cse91 c_~back~0)) (.cse14 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse24)) (.cse32 (+ c_~back~0 1)) (.cse7 (+ c_~sum~0 c_~element~0)) (.cse31 (+ c_~queue~0.offset 16 .cse49)) (.cse0 (not (= (+ .cse29 1) 0))) (.cse1 (not (= .cse28 1))) (.cse3 (not (= .cse27 1))) (.cse4 (< .cse23 0)) (.cse5 (< c_~n~0 .cse26)) (.cse6 (not (= (+ (select .cse30 .cse51) 1) 0))) (.cse13 (< c_~n~0 .cse91)) (.cse15 (< c_~n~0 (+ c_~back~0 5))) (.cse16 (< c_~back~0 0)) (.cse17 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= .cse7 1) (= c_~sum~0 1) (or .cse0 .cse1 .cse3 .cse4 .cse5 (let ((.cse8 (+ c_~sum~0 .cse9 .cse10 .cse11 .cse12))) (and (<= 0 .cse8) (<= .cse8 1)))) (or .cse13 (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 (let ((.cse18 (+ c_~sum~0 .cse9 c_~element~0 .cse11 .cse12 .cse19))) (and (<= 0 .cse18) (<= .cse18 1))) .cse6) (or (and .cse20 (or .cse21 (and (= (+ c_~element~0 1) 0) (<= c_~sum~0 1))) .cse22) (< c_~n~0 .cse23)) (or (and .cse20 (or .cse21 (< c_~sum~0 2)) .cse24) .cse5) (or (let ((.cse25 (+ c_~sum~0 .cse9 .cse11 .cse12 |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse19))) (and (<= 0 .cse25) (<= .cse25 1))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (or (< .cse26 0) .cse13 (not (= (+ .cse27 1) 0)) .cse2 (not (= (+ .cse28 1) 0)) .cse15 (not (= .cse29 1)) (not (= (select .cse30 .cse31) 1)) .cse17) (or .cse13 .cse14 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 6) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16 .cse17) (or (< c_~n~0 .cse32) (let ((.cse35 (select .cse30 (+ .cse36 4)))) (let ((.cse33 (+ .cse35 c_~sum~0 c_~element~0)) (.cse34 (and (not (= .cse35 1)) .cse22))) (and (or (< 0 .cse33) .cse34) (or (< .cse33 2) .cse34))))) (or (< 1 c_~back~0) (< 5 c_~front~0) .cse14 .cse16 .cse17) (= c_~queue~0.offset 0) (or .cse13 .cse14 .cse15 .cse16 .cse17 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse13 (let ((.cse38 (+ 16 |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse49)) (.cse39 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse49 8)) (.cse40 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse49 12)) (.cse41 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse49 4)) (.cse43 (+ .cse36 16 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse44 (+ .cse36 |c_ULTIMATE.start_main_#t~ret10#1.offset| 8)) (.cse45 (+ .cse36 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse46 (+ .cse36 |c_ULTIMATE.start_main_#t~ret10#1.offset| 12)) (.cse47 (+ .cse36 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse42 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse49))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse37 .cse38) 1)) (not (= (select .cse37 .cse39) 1)) (not (= (+ (select .cse37 .cse40) 1) 0)) (not (= (+ (select .cse37 .cse41) 1) 0)) (not (= (select .cse37 .cse42) 1)) (< (+ c_~sum~0 (select .cse37 .cse43) (select .cse37 .cse44) (select .cse37 .cse45) (select .cse37 .cse46) (select .cse37 .cse47)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse48 .cse38) 1)) (not (= (select .cse48 .cse39) 1)) (not (= (+ (select .cse48 .cse40) 1) 0)) (not (= (+ (select .cse48 .cse41) 1) 0)) (< 0 (+ c_~sum~0 (select .cse48 .cse43) (select .cse48 .cse44) (select .cse48 .cse45) (select .cse48 .cse46) (select .cse48 .cse47) 1)) (not (= (select .cse48 .cse42) 1))))))) .cse15 .cse16 .cse17) (or .cse13 (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse50 .cse51) 1)) (not (= (select .cse50 .cse31) 1)) (not (= (+ (select .cse50 .cse52) 1) 0)) (< (+ c_~sum~0 (select .cse50 .cse53) (select .cse50 .cse54) (select .cse50 .cse55) (select .cse50 .cse56) (select .cse50 .cse57)) 2) (not (= (+ (select .cse50 .cse58) 1) 0)) (not (= (select .cse50 .cse59) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse60 .cse51) 1)) (not (= (select .cse60 .cse31) 1)) (not (= (+ (select .cse60 .cse52) 1) 0)) (< 0 (+ c_~sum~0 (select .cse60 .cse53) (select .cse60 .cse54) (select .cse60 .cse55) (select .cse60 .cse56) (select .cse60 .cse57) 1)) (not (= (+ (select .cse60 .cse58) 1) 0)) (not (= (select .cse60 .cse59) 1)))))) .cse15 .cse16 .cse17) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse13 .cse14 .cse15 .cse16 .cse17) (or (< .cse32 0) .cse1 (let ((.cse61 (+ c_~sum~0 .cse9 c_~element~0 .cse11))) (and (<= 0 .cse61) (<= .cse61 1))) (< c_~n~0 (+ c_~back~0 2)) .cse6) (or .cse0 (let ((.cse62 (let ((.cse63 (* 4 |c_thread1Thread1of1ForFork0_#t~post2#1|))) (+ c_~sum~0 (select .cse30 (+ c_~queue~0.offset 4 .cse63)) c_~element~0 (select .cse30 (+ c_~queue~0.offset 16 .cse63)) (select .cse30 (+ c_~queue~0.offset 8 .cse63)) (select .cse30 (+ c_~queue~0.offset 12 .cse63)))))) (and (<= .cse62 1) (<= 0 .cse62))) .cse1 .cse3 .cse4 .cse5 .cse6) (or .cse13 (let ((.cse65 (+ .cse49 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse66 (+ .cse36 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse67 (+ .cse36 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse68 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse69 (+ .cse36 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse70 (+ .cse36 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse71 (+ .cse49 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse72 (+ .cse49 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse73 (+ 16 .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse74 (+ .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse64 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse64 .cse65) 1)) (< 0 (+ c_~sum~0 (select .cse64 .cse66) (select .cse64 .cse67) (select .cse64 .cse68) (select .cse64 .cse69) (select .cse64 .cse70) 1)) (not (= (+ (select .cse64 .cse71) 1) 0)) (not (= (+ (select .cse64 .cse72) 1) 0)) (not (= (select .cse64 .cse73) 1)) (not (= (select .cse64 .cse74) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse75 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse75 .cse65) 1)) (< (+ c_~sum~0 (select .cse75 .cse66) (select .cse75 .cse67) (select .cse75 .cse68) (select .cse75 .cse69) (select .cse75 .cse70)) 2) (not (= (+ (select .cse75 .cse71) 1) 0)) (not (= (+ (select .cse75 .cse72) 1) 0)) (not (= (select .cse75 .cse73) 1)) (not (= (select .cse75 .cse74) 1))))))) .cse15 .cse16 .cse17) (<= 0 .cse7) (or .cse13 .cse15 (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse76 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= 0 (+ (select .cse76 .cse58) 1))) (not (= (+ (select .cse76 .cse52) 1) 0)) (not (= (select .cse76 .cse59) 1)) (not (= (select .cse76 .cse31) 1)) (not (= 1 (select .cse76 .cse51))) (< 0 (+ (select .cse76 .cse54) c_~sum~0 (select .cse76 .cse53) (select .cse76 .cse57) (select .cse76 .cse55) (select .cse76 .cse56) 1))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse77 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (< (+ (select .cse77 .cse54) c_~sum~0 (select .cse77 .cse53) (select .cse77 .cse57) (select .cse77 .cse55) (select .cse77 .cse56)) 2) (not (= 0 (+ (select .cse77 .cse58) 1))) (not (= (+ (select .cse77 .cse52) 1) 0)) (not (= (select .cse77 .cse59) 1)) (not (= (select .cse77 .cse31) 1)) (not (= 1 (select .cse77 .cse51))))))) .cse16 .cse17) (or .cse0 .cse1 (let ((.cse78 (+ c_~sum~0 .cse9 .cse10 c_~element~0 .cse11 .cse12))) (and (<= .cse78 1) (<= 0 .cse78))) .cse3 .cse4 .cse5 .cse6) (or .cse13 .cse15 (let ((.cse80 (+ .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse81 (+ .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse82 (+ .cse49 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse83 (+ 16 .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse85 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse86 (+ .cse36 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse87 (+ .cse36 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse88 (+ .cse36 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse89 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse84 (+ .cse49 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse79 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse79 .cse80) 1)) (not (= (+ (select .cse79 .cse81) 1) 0)) (not (= (+ 1 (select .cse79 .cse82)) 0)) (not (= (select .cse79 .cse83) 1)) (not (= (select .cse79 .cse84) 1)) (< (+ c_~sum~0 (select .cse79 .cse85) (select .cse79 .cse86) (select .cse79 .cse87) (select .cse79 .cse88) (select .cse79 .cse89)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse90 .cse80) 1)) (not (= (+ (select .cse90 .cse81) 1) 0)) (not (= (+ 1 (select .cse90 .cse82)) 0)) (not (= (select .cse90 .cse83) 1)) (< 0 (+ c_~sum~0 (select .cse90 .cse85) (select .cse90 .cse86) (select .cse90 .cse87) (select .cse90 .cse88) (select .cse90 .cse89) 1)) (not (= (select .cse90 .cse84) 1))))))) .cse16 .cse17)))))) is different from false [2024-01-26 12:31:23,138 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse47 (* c_~back~0 4)) (.cse27 (* c_~front~0 4))) (let ((.cse53 (+ c_~queue~0.offset .cse27 12)) (.cse54 (+ c_~queue~0.offset .cse27 4)) (.cse51 (+ c_~queue~0.offset .cse27)) (.cse52 (+ c_~queue~0.offset .cse27 8)) (.cse55 (+ c_~queue~0.offset .cse27 16)) (.cse56 (+ c_~queue~0.offset .cse47 4)) (.cse57 (+ c_~queue~0.offset .cse47 8)) (.cse49 (+ c_~queue~0.offset .cse47)) (.cse26 (select |c_#memory_int| c_~queue~0.base)) (.cse50 (+ c_~queue~0.offset .cse47 12))) (let ((.cse29 (+ c_~back~0 4)) (.cse3 (+ c_~back~0 3)) (.cse30 (select .cse26 .cse50)) (.cse89 (select .cse26 .cse49)) (.cse25 (= c_~back~0 c_~front~0)) (.cse91 (select .cse26 .cse57)) (.cse90 (select .cse26 .cse56)) (.cse23 (select .cse26 .cse55)) (.cse20 (select .cse26 .cse52)) (.cse34 (select .cse26 .cse51)) (.cse21 (select .cse26 .cse54)) (.cse22 (select .cse26 .cse53))) (let ((.cse1 (let ((.cse93 (+ c_~sum~0 .cse20 .cse34 .cse21 .cse22))) (and (<= 0 .cse93) (<= .cse93 1)))) (.cse8 (let ((.cse92 (+ c_~sum~0 .cse20 .cse34 .cse21 .cse22 .cse23))) (and (<= .cse92 1) (<= 0 .cse92)))) (.cse0 (not (= (+ .cse90 1) 0))) (.cse2 (not (= .cse91 1))) (.cse4 (+ c_~back~0 2)) (.cse18 (+ c_~sum~0 .cse34)) (.cse14 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse25)) (.cse32 (+ c_~back~0 1)) (.cse5 (not (= .cse89 1))) (.cse31 (+ c_~queue~0.offset 16 .cse47)) (.cse6 (not (= (+ .cse91 1) 0))) (.cse7 (not (= .cse90 1))) (.cse9 (not (= .cse30 1))) (.cse10 (< .cse3 0)) (.cse11 (< c_~n~0 .cse29)) (.cse12 (not (= (+ .cse89 1) 0))) (.cse13 (< c_~n~0 (+ c_~front~0 1))) (.cse15 (< c_~n~0 (+ c_~back~0 5))) (.cse16 (< c_~back~0 0)) (.cse17 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 (< c_~n~0 .cse3) (< .cse4 0) .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= c_~sum~0 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 .cse1) (or .cse13 (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15 .cse16 .cse17) (<= .cse18 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 (let ((.cse19 (+ c_~sum~0 .cse20 c_~element~0 .cse21 .cse22 .cse23))) (and (<= 0 .cse19) (<= .cse19 1))) .cse12) (or (let ((.cse24 (not (= (select .cse26 (+ .cse27 12)) 1)))) (and (or .cse24 (< 0 c_~sum~0)) (or .cse24 (< c_~sum~0 2)) .cse25)) .cse11) (or (let ((.cse28 (+ c_~sum~0 .cse20 .cse21 .cse22 |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse23))) (and (<= 0 .cse28) (<= .cse28 1))) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or (< .cse29 0) .cse13 (not (= (+ .cse30 1) 0)) .cse8 .cse0 .cse15 .cse2 (not (= (select .cse26 .cse31) 1)) .cse17) (or .cse13 .cse14 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 6) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16 .cse17) (or (< .cse32 0) .cse7 (< c_~n~0 .cse4) (let ((.cse33 (+ c_~sum~0 .cse20 .cse34 .cse21))) (and (<= 0 .cse33) (<= .cse33 1))) .cse12) (or (< 1 c_~back~0) (< 5 c_~front~0) .cse14 .cse16 .cse17) (= c_~queue~0.offset 0) (or .cse13 .cse14 .cse15 .cse16 .cse17 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= 0 .cse18) (or .cse13 (let ((.cse36 (+ 16 |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse47)) (.cse37 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse47 8)) (.cse38 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse47 12)) (.cse39 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse47 4)) (.cse41 (+ .cse27 16 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse42 (+ .cse27 |c_ULTIMATE.start_main_#t~ret10#1.offset| 8)) (.cse43 (+ .cse27 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse44 (+ .cse27 |c_ULTIMATE.start_main_#t~ret10#1.offset| 12)) (.cse45 (+ .cse27 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse40 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse47))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse35 .cse36) 1)) (not (= (select .cse35 .cse37) 1)) (not (= (+ (select .cse35 .cse38) 1) 0)) (not (= (+ (select .cse35 .cse39) 1) 0)) (not (= (select .cse35 .cse40) 1)) (< (+ c_~sum~0 (select .cse35 .cse41) (select .cse35 .cse42) (select .cse35 .cse43) (select .cse35 .cse44) (select .cse35 .cse45)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse46 .cse36) 1)) (not (= (select .cse46 .cse37) 1)) (not (= (+ (select .cse46 .cse38) 1) 0)) (not (= (+ (select .cse46 .cse39) 1) 0)) (< 0 (+ c_~sum~0 (select .cse46 .cse41) (select .cse46 .cse42) (select .cse46 .cse43) (select .cse46 .cse44) (select .cse46 .cse45) 1)) (not (= (select .cse46 .cse40) 1))))))) .cse15 .cse16 .cse17) (or .cse13 (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse48 .cse49) 1)) (not (= (select .cse48 .cse31) 1)) (not (= (+ (select .cse48 .cse50) 1) 0)) (< (+ c_~sum~0 (select .cse48 .cse51) (select .cse48 .cse52) (select .cse48 .cse53) (select .cse48 .cse54) (select .cse48 .cse55)) 2) (not (= (+ (select .cse48 .cse56) 1) 0)) (not (= (select .cse48 .cse57) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse58 .cse49) 1)) (not (= (select .cse58 .cse31) 1)) (not (= (+ (select .cse58 .cse50) 1) 0)) (< 0 (+ c_~sum~0 (select .cse58 .cse51) (select .cse58 .cse52) (select .cse58 .cse53) (select .cse58 .cse54) (select .cse58 .cse55) 1)) (not (= (+ (select .cse58 .cse56) 1) 0)) (not (= (select .cse58 .cse57) 1)))))) .cse15 .cse16 .cse17) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse13 .cse14 .cse15 .cse16 .cse17) (or (let ((.cse59 (+ c_~sum~0 .cse34 .cse21))) (and (<= .cse59 1) (<= 0 .cse59))) (< c_~n~0 .cse32) .cse16 .cse5) (or .cse6 (let ((.cse60 (let ((.cse61 (* 4 |c_thread1Thread1of1ForFork0_#t~post2#1|))) (+ c_~sum~0 (select .cse26 (+ c_~queue~0.offset 4 .cse61)) c_~element~0 (select .cse26 (+ c_~queue~0.offset 16 .cse61)) (select .cse26 (+ c_~queue~0.offset 8 .cse61)) (select .cse26 (+ c_~queue~0.offset 12 .cse61)))))) (and (<= .cse60 1) (<= 0 .cse60))) .cse7 .cse9 .cse10 .cse11 .cse12) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or .cse13 (let ((.cse63 (+ .cse47 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse64 (+ .cse27 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse65 (+ .cse27 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse66 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse67 (+ .cse27 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse68 (+ .cse27 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse69 (+ .cse47 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse70 (+ .cse47 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse71 (+ 16 .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse72 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse62 .cse63) 1)) (< 0 (+ c_~sum~0 (select .cse62 .cse64) (select .cse62 .cse65) (select .cse62 .cse66) (select .cse62 .cse67) (select .cse62 .cse68) 1)) (not (= (+ (select .cse62 .cse69) 1) 0)) (not (= (+ (select .cse62 .cse70) 1) 0)) (not (= (select .cse62 .cse71) 1)) (not (= (select .cse62 .cse72) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse73 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse73 .cse63) 1)) (< (+ c_~sum~0 (select .cse73 .cse64) (select .cse73 .cse65) (select .cse73 .cse66) (select .cse73 .cse67) (select .cse73 .cse68)) 2) (not (= (+ (select .cse73 .cse69) 1) 0)) (not (= (+ (select .cse73 .cse70) 1) 0)) (not (= (select .cse73 .cse71) 1)) (not (= (select .cse73 .cse72) 1))))))) .cse15 .cse16 .cse17) (or .cse13 .cse15 (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= 0 (+ (select .cse74 .cse56) 1))) (not (= (+ (select .cse74 .cse50) 1) 0)) (not (= (select .cse74 .cse57) 1)) (not (= (select .cse74 .cse31) 1)) (not (= 1 (select .cse74 .cse49))) (< 0 (+ (select .cse74 .cse52) c_~sum~0 (select .cse74 .cse51) (select .cse74 .cse55) (select .cse74 .cse53) (select .cse74 .cse54) 1))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (< (+ (select .cse75 .cse52) c_~sum~0 (select .cse75 .cse51) (select .cse75 .cse55) (select .cse75 .cse53) (select .cse75 .cse54)) 2) (not (= 0 (+ (select .cse75 .cse56) 1))) (not (= (+ (select .cse75 .cse50) 1) 0)) (not (= (select .cse75 .cse57) 1)) (not (= (select .cse75 .cse31) 1)) (not (= 1 (select .cse75 .cse49))))))) .cse16 .cse17) (or .cse6 .cse7 (let ((.cse76 (+ c_~sum~0 .cse20 .cse34 c_~element~0 .cse21 .cse22))) (and (<= .cse76 1) (<= 0 .cse76))) .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse15 (let ((.cse78 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse79 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse80 (+ .cse47 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse81 (+ 16 .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse83 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse84 (+ .cse27 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse85 (+ .cse27 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse86 (+ .cse27 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse87 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse82 (+ .cse47 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse77 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse77 .cse78) 1)) (not (= (+ (select .cse77 .cse79) 1) 0)) (not (= (+ 1 (select .cse77 .cse80)) 0)) (not (= (select .cse77 .cse81) 1)) (not (= (select .cse77 .cse82) 1)) (< (+ c_~sum~0 (select .cse77 .cse83) (select .cse77 .cse84) (select .cse77 .cse85) (select .cse77 .cse86) (select .cse77 .cse87)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse88 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse88 .cse78) 1)) (not (= (+ (select .cse88 .cse79) 1) 0)) (not (= (+ 1 (select .cse88 .cse80)) 0)) (not (= (select .cse88 .cse81) 1)) (< 0 (+ c_~sum~0 (select .cse88 .cse83) (select .cse88 .cse84) (select .cse88 .cse85) (select .cse88 .cse86) (select .cse88 .cse87) 1)) (not (= (select .cse88 .cse82) 1))))))) .cse16 .cse17)))))) is different from false [2024-01-26 12:31:23,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse57 (* c_~back~0 4)) (.cse34 (* c_~front~0 4))) (let ((.cse64 (+ c_~queue~0.offset .cse34 12)) (.cse65 (+ c_~queue~0.offset .cse34 4)) (.cse62 (+ c_~queue~0.offset .cse34)) (.cse63 (+ c_~queue~0.offset .cse34 8)) (.cse66 (+ c_~queue~0.offset .cse34 16)) (.cse67 (+ c_~queue~0.offset .cse57 4)) (.cse68 (+ c_~queue~0.offset .cse57 8)) (.cse60 (+ c_~queue~0.offset .cse57)) (.cse33 (select |c_#memory_int| c_~queue~0.base)) (.cse61 (+ c_~queue~0.offset .cse57 12))) (let ((.cse37 (+ c_~back~0 4)) (.cse38 (select .cse33 .cse61)) (.cse103 (select .cse33 .cse60)) (.cse108 (+ c_~back~0 1)) (.cse73 (* 4 |c_thread1Thread1of1ForFork0_#t~post2#1|)) (.cse32 (= c_~back~0 c_~front~0)) (.cse107 (+ c_~back~0 2)) (.cse104 (+ c_~back~0 3)) (.cse106 (select .cse33 .cse68)) (.cse105 (select .cse33 .cse67)) (.cse30 (select .cse33 .cse66)) (.cse28 (select .cse33 .cse63)) (.cse16 (select .cse33 .cse62)) (.cse17 (select .cse33 .cse65)) (.cse29 (select .cse33 .cse64))) (let ((.cse1 (let ((.cse110 (+ c_~sum~0 .cse28 .cse16 .cse17 .cse29))) (and (<= 0 .cse110) (<= .cse110 1)))) (.cse8 (let ((.cse109 (+ c_~sum~0 .cse28 .cse16 .cse17 .cse29 .cse30))) (and (<= .cse109 1) (<= 0 .cse109)))) (.cse26 (+ c_~sum~0 .cse16)) (.cse0 (not (= (+ .cse105 1) 0))) (.cse2 (not (= .cse106 1))) (.cse3 (< c_~n~0 .cse104)) (.cse4 (< .cse107 0)) (.cse20 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse32)) (.cse44 (select .cse33 (+ c_~queue~0.offset 12 .cse73))) (.cse24 (< c_~n~0 .cse108)) (.cse5 (not (= .cse103 1))) (.cse13 (< .cse108 0)) (.cse14 (< c_~n~0 .cse107)) (.cse42 (select .cse33 (+ c_~queue~0.offset 4 .cse73))) (.cse43 (select .cse33 (+ c_~queue~0.offset 8 .cse73))) (.cse18 (+ c_~sum~0 c_~element~0)) (.cse39 (+ c_~queue~0.offset 16 .cse57)) (.cse6 (not (= (+ .cse106 1) 0))) (.cse7 (not (= .cse105 1))) (.cse9 (not (= .cse38 1))) (.cse10 (< .cse104 0)) (.cse11 (< c_~n~0 .cse37)) (.cse12 (not (= (+ .cse103 1) 0))) (.cse19 (< c_~n~0 (+ c_~front~0 1))) (.cse21 (< c_~n~0 (+ c_~back~0 5))) (.cse22 (< c_~back~0 0)) (.cse23 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse7 .cse14 (let ((.cse15 (+ c_~sum~0 .cse16 c_~element~0 .cse17))) (and (<= 0 .cse15) (<= .cse15 1))) .cse12) (<= .cse18 1) (= c_~sum~0 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 .cse1) (or .cse19 (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse22 (let ((.cse25 (+ c_~sum~0 c_~element~0 .cse17))) (and (<= 0 .cse25) (<= .cse25 1))) .cse5) (<= .cse26 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 (let ((.cse27 (+ c_~sum~0 .cse28 c_~element~0 .cse17 .cse29 .cse30))) (and (<= 0 .cse27) (<= .cse27 1))) .cse12) (or (let ((.cse31 (not (= (select .cse33 (+ .cse34 12)) 1)))) (and (or .cse31 (< 0 c_~sum~0)) (or .cse31 (< c_~sum~0 2)) .cse32)) .cse11) (or (let ((.cse35 (+ c_~sum~0 .cse28 .cse17 .cse29 |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse30))) (and (<= 0 .cse35) (<= .cse35 1))) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 (let ((.cse36 (+ c_~sum~0 .cse28 .cse16 c_~element~0 .cse17))) (and (<= .cse36 1) (<= 0 .cse36))) .cse3 .cse4 .cse5) (or (< .cse37 0) .cse19 (not (= (+ .cse38 1) 0)) .cse8 .cse0 .cse21 .cse2 (not (= (select .cse33 .cse39) 1)) .cse23) (or .cse19 .cse20 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 6) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse21 .cse22 .cse23) (or .cse13 .cse7 .cse14 (let ((.cse40 (+ c_~sum~0 .cse28 .cse16 .cse17))) (and (<= 0 .cse40) (<= .cse40 1))) .cse12) (or (let ((.cse41 (+ c_~sum~0 .cse42 c_~element~0 .cse43 .cse44))) (and (<= 0 .cse41) (<= .cse41 1))) .cse0 .cse2 .cse3 .cse4 .cse5) (or (< 1 c_~back~0) (< 5 c_~front~0) .cse20 .cse22 .cse23) (= c_~queue~0.offset 0) (or .cse19 .cse20 .cse21 .cse22 .cse23 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= 0 .cse26) (or .cse19 (let ((.cse46 (+ 16 |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse57)) (.cse47 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse57 8)) (.cse48 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse57 12)) (.cse49 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse57 4)) (.cse51 (+ .cse34 16 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse52 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset| 8)) (.cse53 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse54 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset| 12)) (.cse55 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse50 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse57))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse45 .cse46) 1)) (not (= (select .cse45 .cse47) 1)) (not (= (+ (select .cse45 .cse48) 1) 0)) (not (= (+ (select .cse45 .cse49) 1) 0)) (not (= (select .cse45 .cse50) 1)) (< (+ c_~sum~0 (select .cse45 .cse51) (select .cse45 .cse52) (select .cse45 .cse53) (select .cse45 .cse54) (select .cse45 .cse55)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse56 .cse46) 1)) (not (= (select .cse56 .cse47) 1)) (not (= (+ (select .cse56 .cse48) 1) 0)) (not (= (+ (select .cse56 .cse49) 1) 0)) (< 0 (+ c_~sum~0 (select .cse56 .cse51) (select .cse56 .cse52) (select .cse56 .cse53) (select .cse56 .cse54) (select .cse56 .cse55) 1)) (not (= (select .cse56 .cse50) 1))))))) .cse21 .cse22 .cse23) (or .cse0 (let ((.cse58 (+ c_~sum~0 .cse28 c_~element~0 .cse17 .cse29))) (and (<= 0 .cse58) (<= .cse58 1))) .cse2 .cse3 .cse4 .cse5) (or .cse19 (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse59 .cse60) 1)) (not (= (select .cse59 .cse39) 1)) (not (= (+ (select .cse59 .cse61) 1) 0)) (< (+ c_~sum~0 (select .cse59 .cse62) (select .cse59 .cse63) (select .cse59 .cse64) (select .cse59 .cse65) (select .cse59 .cse66)) 2) (not (= (+ (select .cse59 .cse67) 1) 0)) (not (= (select .cse59 .cse68) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse69 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse69 .cse60) 1)) (not (= (select .cse69 .cse39) 1)) (not (= (+ (select .cse69 .cse61) 1) 0)) (< 0 (+ c_~sum~0 (select .cse69 .cse62) (select .cse69 .cse63) (select .cse69 .cse64) (select .cse69 .cse65) (select .cse69 .cse66) 1)) (not (= (+ (select .cse69 .cse67) 1) 0)) (not (= (select .cse69 .cse68) 1)))))) .cse21 .cse22 .cse23) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse13 .cse7 (let ((.cse70 (+ c_~sum~0 .cse28 c_~element~0 .cse17))) (and (<= 0 .cse70) (<= .cse70 1))) .cse14 .cse12) (or (let ((.cse71 (+ c_~sum~0 .cse16 .cse17))) (and (<= .cse71 1) (<= 0 .cse71))) .cse24 .cse22 .cse5) (or .cse6 (let ((.cse72 (+ c_~sum~0 .cse42 c_~element~0 (select .cse33 (+ c_~queue~0.offset 16 .cse73)) .cse43 .cse44))) (and (<= .cse72 1) (<= 0 .cse72))) .cse7 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse74 (+ c_~sum~0 .cse42 c_~element~0))) (and (<= .cse74 1) (<= 0 .cse74))) .cse24 .cse22 .cse5) (or .cse19 (let ((.cse76 (+ .cse57 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse77 (+ .cse34 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse78 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse79 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse80 (+ .cse34 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse81 (+ .cse34 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse82 (+ .cse57 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse83 (+ .cse57 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse84 (+ 16 .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse85 (+ .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse75 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse75 .cse76) 1)) (< 0 (+ c_~sum~0 (select .cse75 .cse77) (select .cse75 .cse78) (select .cse75 .cse79) (select .cse75 .cse80) (select .cse75 .cse81) 1)) (not (= (+ (select .cse75 .cse82) 1) 0)) (not (= (+ (select .cse75 .cse83) 1) 0)) (not (= (select .cse75 .cse84) 1)) (not (= (select .cse75 .cse85) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse86 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse86 .cse76) 1)) (< (+ c_~sum~0 (select .cse86 .cse77) (select .cse86 .cse78) (select .cse86 .cse79) (select .cse86 .cse80) (select .cse86 .cse81)) 2) (not (= (+ (select .cse86 .cse82) 1) 0)) (not (= (+ (select .cse86 .cse83) 1) 0)) (not (= (select .cse86 .cse84) 1)) (not (= (select .cse86 .cse85) 1))))))) .cse21 .cse22 .cse23) (or .cse13 .cse7 .cse14 .cse12 (let ((.cse87 (+ c_~sum~0 .cse42 c_~element~0 .cse43))) (and (<= 0 .cse87) (<= .cse87 1)))) (<= 0 .cse18) (or .cse19 .cse21 (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse88 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= 0 (+ (select .cse88 .cse67) 1))) (not (= (+ (select .cse88 .cse61) 1) 0)) (not (= (select .cse88 .cse68) 1)) (not (= (select .cse88 .cse39) 1)) (not (= 1 (select .cse88 .cse60))) (< 0 (+ (select .cse88 .cse63) c_~sum~0 (select .cse88 .cse62) (select .cse88 .cse66) (select .cse88 .cse64) (select .cse88 .cse65) 1))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse89 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (< (+ (select .cse89 .cse63) c_~sum~0 (select .cse89 .cse62) (select .cse89 .cse66) (select .cse89 .cse64) (select .cse89 .cse65)) 2) (not (= 0 (+ (select .cse89 .cse67) 1))) (not (= (+ (select .cse89 .cse61) 1) 0)) (not (= (select .cse89 .cse68) 1)) (not (= (select .cse89 .cse39) 1)) (not (= 1 (select .cse89 .cse60))))))) .cse22 .cse23) (or .cse6 .cse7 (let ((.cse90 (+ c_~sum~0 .cse28 .cse16 c_~element~0 .cse17 .cse29))) (and (<= .cse90 1) (<= 0 .cse90))) .cse9 .cse10 .cse11 .cse12) (or .cse19 .cse21 (let ((.cse92 (+ .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse93 (+ .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse94 (+ .cse57 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse95 (+ 16 .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse97 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse98 (+ .cse34 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse99 (+ .cse34 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse100 (+ .cse34 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse101 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse96 (+ .cse57 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse91 .cse92) 1)) (not (= (+ (select .cse91 .cse93) 1) 0)) (not (= (+ 1 (select .cse91 .cse94)) 0)) (not (= (select .cse91 .cse95) 1)) (not (= (select .cse91 .cse96) 1)) (< (+ c_~sum~0 (select .cse91 .cse97) (select .cse91 .cse98) (select .cse91 .cse99) (select .cse91 .cse100) (select .cse91 .cse101)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse102 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse102 .cse92) 1)) (not (= (+ (select .cse102 .cse93) 1) 0)) (not (= (+ 1 (select .cse102 .cse94)) 0)) (not (= (select .cse102 .cse95) 1)) (< 0 (+ c_~sum~0 (select .cse102 .cse97) (select .cse102 .cse98) (select .cse102 .cse99) (select .cse102 .cse100) (select .cse102 .cse101) 1)) (not (= (select .cse102 .cse96) 1))))))) .cse22 .cse23)))))) is different from false [2024-01-26 12:31:23,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse53 (* c_~back~0 4)) (.cse34 (* c_~front~0 4))) (let ((.cse60 (+ c_~queue~0.offset .cse34 12)) (.cse61 (+ c_~queue~0.offset .cse34 4)) (.cse58 (+ c_~queue~0.offset .cse34)) (.cse59 (+ c_~queue~0.offset .cse34 8)) (.cse62 (+ c_~queue~0.offset .cse34 16)) (.cse63 (+ c_~queue~0.offset .cse53 4)) (.cse64 (+ c_~queue~0.offset .cse53 8)) (.cse56 (+ c_~queue~0.offset .cse53)) (.cse33 (select |c_#memory_int| c_~queue~0.base)) (.cse57 (+ c_~queue~0.offset .cse53 12))) (let ((.cse37 (+ c_~back~0 4)) (.cse38 (select .cse33 .cse57)) (.cse97 (select .cse33 .cse56)) (.cse101 (+ c_~back~0 1)) (.cse32 (= c_~back~0 c_~front~0)) (.cse102 (+ c_~back~0 2)) (.cse98 (+ c_~back~0 3)) (.cse100 (select .cse33 .cse64)) (.cse99 (select .cse33 .cse63)) (.cse30 (select .cse33 .cse62)) (.cse28 (select .cse33 .cse59)) (.cse16 (select .cse33 .cse58)) (.cse17 (select .cse33 .cse61)) (.cse29 (select .cse33 .cse60))) (let ((.cse1 (let ((.cse104 (+ c_~sum~0 .cse28 .cse16 .cse17 .cse29))) (and (<= 0 .cse104) (<= .cse104 1)))) (.cse8 (let ((.cse103 (+ c_~sum~0 .cse28 .cse16 .cse17 .cse29 .cse30))) (and (<= .cse103 1) (<= 0 .cse103)))) (.cse26 (+ c_~sum~0 .cse16)) (.cse0 (not (= (+ .cse99 1) 0))) (.cse2 (not (= .cse100 1))) (.cse3 (< c_~n~0 .cse98)) (.cse4 (< .cse102 0)) (.cse20 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse32)) (.cse13 (< .cse101 0)) (.cse14 (< c_~n~0 .cse102)) (.cse24 (< c_~n~0 .cse101)) (.cse5 (not (= .cse97 1))) (.cse18 (+ c_~sum~0 c_~element~0)) (.cse39 (+ c_~queue~0.offset 16 .cse53)) (.cse6 (not (= (+ .cse100 1) 0))) (.cse7 (not (= .cse99 1))) (.cse9 (not (= .cse38 1))) (.cse10 (< .cse98 0)) (.cse11 (< c_~n~0 .cse37)) (.cse12 (not (= (+ .cse97 1) 0))) (.cse19 (< c_~n~0 (+ c_~front~0 1))) (.cse21 (< c_~n~0 (+ c_~back~0 5))) (.cse22 (< c_~back~0 0)) (.cse23 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse7 .cse14 (let ((.cse15 (+ c_~sum~0 .cse16 c_~element~0 .cse17))) (and (<= 0 .cse15) (<= .cse15 1))) .cse12) (<= .cse18 1) (= c_~sum~0 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 .cse1) (or .cse19 (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse22 (let ((.cse25 (+ c_~sum~0 c_~element~0 .cse17))) (and (<= 0 .cse25) (<= .cse25 1))) .cse5) (<= .cse26 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 (let ((.cse27 (+ c_~sum~0 .cse28 c_~element~0 .cse17 .cse29 .cse30))) (and (<= 0 .cse27) (<= .cse27 1))) .cse12) (or (let ((.cse31 (not (= (select .cse33 (+ .cse34 12)) 1)))) (and (or .cse31 (< 0 c_~sum~0)) (or .cse31 (< c_~sum~0 2)) .cse32)) .cse11) (or (let ((.cse35 (+ c_~sum~0 .cse28 .cse17 .cse29 |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse30))) (and (<= 0 .cse35) (<= .cse35 1))) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 (let ((.cse36 (+ c_~sum~0 .cse28 .cse16 c_~element~0 .cse17))) (and (<= .cse36 1) (<= 0 .cse36))) .cse3 .cse4 .cse5) (or (< .cse37 0) .cse19 (not (= (+ .cse38 1) 0)) .cse8 .cse0 .cse21 .cse2 (not (= (select .cse33 .cse39) 1)) .cse23) (or .cse19 .cse20 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 6) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse21 .cse22 .cse23) (or .cse13 .cse7 .cse14 (let ((.cse40 (+ c_~sum~0 .cse28 .cse16 .cse17))) (and (<= 0 .cse40) (<= .cse40 1))) .cse12) (or (< 1 c_~back~0) (< 5 c_~front~0) .cse20 .cse22 .cse23) (= c_~queue~0.offset 0) (or .cse19 .cse20 .cse21 .cse22 .cse23 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= 0 .cse26) (or .cse19 (let ((.cse42 (+ 16 |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse53)) (.cse43 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse53 8)) (.cse44 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse53 12)) (.cse45 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse53 4)) (.cse47 (+ .cse34 16 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse48 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset| 8)) (.cse49 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse50 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset| 12)) (.cse51 (+ .cse34 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse46 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse53))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse41 .cse42) 1)) (not (= (select .cse41 .cse43) 1)) (not (= (+ (select .cse41 .cse44) 1) 0)) (not (= (+ (select .cse41 .cse45) 1) 0)) (not (= (select .cse41 .cse46) 1)) (< (+ c_~sum~0 (select .cse41 .cse47) (select .cse41 .cse48) (select .cse41 .cse49) (select .cse41 .cse50) (select .cse41 .cse51)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse52 .cse42) 1)) (not (= (select .cse52 .cse43) 1)) (not (= (+ (select .cse52 .cse44) 1) 0)) (not (= (+ (select .cse52 .cse45) 1) 0)) (< 0 (+ c_~sum~0 (select .cse52 .cse47) (select .cse52 .cse48) (select .cse52 .cse49) (select .cse52 .cse50) (select .cse52 .cse51) 1)) (not (= (select .cse52 .cse46) 1))))))) .cse21 .cse22 .cse23) (or .cse0 (let ((.cse54 (+ c_~sum~0 .cse28 c_~element~0 .cse17 .cse29))) (and (<= 0 .cse54) (<= .cse54 1))) .cse2 .cse3 .cse4 .cse5) (or .cse19 (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse55 .cse56) 1)) (not (= (select .cse55 .cse39) 1)) (not (= (+ (select .cse55 .cse57) 1) 0)) (< (+ c_~sum~0 (select .cse55 .cse58) (select .cse55 .cse59) (select .cse55 .cse60) (select .cse55 .cse61) (select .cse55 .cse62)) 2) (not (= (+ (select .cse55 .cse63) 1) 0)) (not (= (select .cse55 .cse64) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse65 .cse56) 1)) (not (= (select .cse65 .cse39) 1)) (not (= (+ (select .cse65 .cse57) 1) 0)) (< 0 (+ c_~sum~0 (select .cse65 .cse58) (select .cse65 .cse59) (select .cse65 .cse60) (select .cse65 .cse61) (select .cse65 .cse62) 1)) (not (= (+ (select .cse65 .cse63) 1) 0)) (not (= (select .cse65 .cse64) 1)))))) .cse21 .cse22 .cse23) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse13 .cse7 (let ((.cse66 (+ c_~sum~0 .cse28 c_~element~0 .cse17))) (and (<= 0 .cse66) (<= .cse66 1))) .cse14 .cse12) (or (let ((.cse67 (+ c_~sum~0 .cse16 .cse17))) (and (<= .cse67 1) (<= 0 .cse67))) .cse24 .cse22 .cse5) (or .cse6 (let ((.cse68 (let ((.cse69 (* 4 |c_thread1Thread1of1ForFork0_#t~post2#1|))) (+ c_~sum~0 (select .cse33 (+ c_~queue~0.offset 4 .cse69)) c_~element~0 (select .cse33 (+ c_~queue~0.offset 16 .cse69)) (select .cse33 (+ c_~queue~0.offset 8 .cse69)) (select .cse33 (+ c_~queue~0.offset 12 .cse69)))))) (and (<= .cse68 1) (<= 0 .cse68))) .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse19 (let ((.cse71 (+ .cse53 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse72 (+ .cse34 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse73 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse74 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse75 (+ .cse34 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse76 (+ .cse34 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse77 (+ .cse53 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse78 (+ .cse53 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse79 (+ 16 .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse80 (+ .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse70 .cse71) 1)) (< 0 (+ c_~sum~0 (select .cse70 .cse72) (select .cse70 .cse73) (select .cse70 .cse74) (select .cse70 .cse75) (select .cse70 .cse76) 1)) (not (= (+ (select .cse70 .cse77) 1) 0)) (not (= (+ (select .cse70 .cse78) 1) 0)) (not (= (select .cse70 .cse79) 1)) (not (= (select .cse70 .cse80) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse81 .cse71) 1)) (< (+ c_~sum~0 (select .cse81 .cse72) (select .cse81 .cse73) (select .cse81 .cse74) (select .cse81 .cse75) (select .cse81 .cse76)) 2) (not (= (+ (select .cse81 .cse77) 1) 0)) (not (= (+ (select .cse81 .cse78) 1) 0)) (not (= (select .cse81 .cse79) 1)) (not (= (select .cse81 .cse80) 1))))))) .cse21 .cse22 .cse23) (<= 0 .cse18) (or .cse19 .cse21 (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse82 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= 0 (+ (select .cse82 .cse63) 1))) (not (= (+ (select .cse82 .cse57) 1) 0)) (not (= (select .cse82 .cse64) 1)) (not (= (select .cse82 .cse39) 1)) (not (= 1 (select .cse82 .cse56))) (< 0 (+ (select .cse82 .cse59) c_~sum~0 (select .cse82 .cse58) (select .cse82 .cse62) (select .cse82 .cse60) (select .cse82 .cse61) 1))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (< (+ (select .cse83 .cse59) c_~sum~0 (select .cse83 .cse58) (select .cse83 .cse62) (select .cse83 .cse60) (select .cse83 .cse61)) 2) (not (= 0 (+ (select .cse83 .cse63) 1))) (not (= (+ (select .cse83 .cse57) 1) 0)) (not (= (select .cse83 .cse64) 1)) (not (= (select .cse83 .cse39) 1)) (not (= 1 (select .cse83 .cse56))))))) .cse22 .cse23) (or .cse6 .cse7 (let ((.cse84 (+ c_~sum~0 .cse28 .cse16 c_~element~0 .cse17 .cse29))) (and (<= .cse84 1) (<= 0 .cse84))) .cse9 .cse10 .cse11 .cse12) (or .cse19 .cse21 (let ((.cse86 (+ .cse53 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse87 (+ .cse53 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse88 (+ .cse53 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse89 (+ 16 .cse53 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse91 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse92 (+ .cse34 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse93 (+ .cse34 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse94 (+ .cse34 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse95 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse90 (+ .cse53 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse85 .cse86) 1)) (not (= (+ (select .cse85 .cse87) 1) 0)) (not (= (+ 1 (select .cse85 .cse88)) 0)) (not (= (select .cse85 .cse89) 1)) (not (= (select .cse85 .cse90) 1)) (< (+ c_~sum~0 (select .cse85 .cse91) (select .cse85 .cse92) (select .cse85 .cse93) (select .cse85 .cse94) (select .cse85 .cse95)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse96 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse96 .cse86) 1)) (not (= (+ (select .cse96 .cse87) 1) 0)) (not (= (+ 1 (select .cse96 .cse88)) 0)) (not (= (select .cse96 .cse89) 1)) (< 0 (+ c_~sum~0 (select .cse96 .cse91) (select .cse96 .cse92) (select .cse96 .cse93) (select .cse96 .cse94) (select .cse96 .cse95) 1)) (not (= (select .cse96 .cse90) 1))))))) .cse22 .cse23)))))) is different from false [2024-01-26 12:31:30,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse50 (* c_~back~0 4)) (.cse30 (* c_~front~0 4))) (let ((.cse57 (+ c_~queue~0.offset .cse30 12)) (.cse58 (+ c_~queue~0.offset .cse30 4)) (.cse55 (+ c_~queue~0.offset .cse30)) (.cse56 (+ c_~queue~0.offset .cse30 8)) (.cse59 (+ c_~queue~0.offset .cse30 16)) (.cse60 (+ c_~queue~0.offset .cse50 4)) (.cse61 (+ c_~queue~0.offset .cse50 8)) (.cse53 (+ c_~queue~0.offset .cse50)) (.cse29 (select |c_#memory_int| c_~queue~0.base)) (.cse54 (+ c_~queue~0.offset .cse50 12))) (let ((.cse31 (+ c_~back~0 4)) (.cse32 (select .cse29 .cse54)) (.cse92 (select .cse29 .cse53)) (.cse96 (+ c_~back~0 1)) (.cse28 (= c_~back~0 c_~front~0)) (.cse97 (+ c_~back~0 2)) (.cse93 (+ c_~back~0 3)) (.cse95 (select .cse29 .cse61)) (.cse94 (select .cse29 .cse60)) (.cse26 (select .cse29 .cse59)) (.cse24 (select .cse29 .cse56)) (.cse37 (select .cse29 .cse55)) (.cse21 (select .cse29 .cse58)) (.cse25 (select .cse29 .cse57))) (let ((.cse1 (let ((.cse99 (+ c_~sum~0 .cse24 .cse37 .cse21 .cse25))) (and (<= 0 .cse99) (<= .cse99 1)))) (.cse8 (let ((.cse98 (+ c_~sum~0 .cse24 .cse37 .cse21 .cse25 .cse26))) (and (<= .cse98 1) (<= 0 .cse98)))) (.cse22 (+ c_~sum~0 .cse37)) (.cse0 (not (= (+ .cse94 1) 0))) (.cse2 (not (= .cse95 1))) (.cse3 (< c_~n~0 .cse93)) (.cse4 (< .cse97 0)) (.cse15 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse28)) (.cse34 (< .cse96 0)) (.cse35 (< c_~n~0 .cse97)) (.cse19 (< c_~n~0 .cse96)) (.cse5 (not (= .cse92 1))) (.cse13 (+ c_~sum~0 c_~element~0)) (.cse33 (+ c_~queue~0.offset 16 .cse50)) (.cse6 (not (= (+ .cse95 1) 0))) (.cse7 (not (= .cse94 1))) (.cse9 (not (= .cse32 1))) (.cse10 (< .cse93 0)) (.cse11 (< c_~n~0 .cse31)) (.cse12 (not (= (+ .cse92 1) 0))) (.cse14 (< c_~n~0 (+ c_~front~0 1))) (.cse16 (< c_~n~0 (+ c_~back~0 5))) (.cse17 (< c_~back~0 0)) (.cse18 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (<= .cse13 1) (= c_~sum~0 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 .cse1) (or .cse14 (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse17 (let ((.cse20 (+ c_~sum~0 c_~element~0 .cse21))) (and (<= 0 .cse20) (<= .cse20 1))) .cse5) (<= .cse22 1) (or .cse6 .cse7 .cse9 .cse10 .cse11 (let ((.cse23 (+ c_~sum~0 .cse24 c_~element~0 .cse21 .cse25 .cse26))) (and (<= 0 .cse23) (<= .cse23 1))) .cse12) (or (let ((.cse27 (not (= (select .cse29 (+ .cse30 12)) 1)))) (and (or .cse27 (< 0 c_~sum~0)) (or .cse27 (< c_~sum~0 2)) .cse28)) .cse11) (or (< .cse31 0) .cse14 (not (= (+ .cse32 1) 0)) .cse8 .cse0 .cse16 .cse2 (not (= (select .cse29 .cse33) 1)) .cse18) (or .cse14 .cse15 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 6) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16 .cse17 .cse18) (or .cse34 .cse7 .cse35 (let ((.cse36 (+ c_~sum~0 .cse24 .cse37 .cse21))) (and (<= 0 .cse36) (<= .cse36 1))) .cse12) (or (< 1 c_~back~0) (< 5 c_~front~0) .cse15 .cse17 .cse18) (= c_~queue~0.offset 0) (or .cse14 .cse15 .cse16 .cse17 .cse18 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= 0 .cse22) (or .cse14 (let ((.cse39 (+ 16 |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse50)) (.cse40 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse50 8)) (.cse41 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse50 12)) (.cse42 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse50 4)) (.cse44 (+ .cse30 16 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse45 (+ .cse30 |c_ULTIMATE.start_main_#t~ret10#1.offset| 8)) (.cse46 (+ .cse30 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse47 (+ .cse30 |c_ULTIMATE.start_main_#t~ret10#1.offset| 12)) (.cse48 (+ .cse30 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse43 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse50))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse38 .cse39) 1)) (not (= (select .cse38 .cse40) 1)) (not (= (+ (select .cse38 .cse41) 1) 0)) (not (= (+ (select .cse38 .cse42) 1) 0)) (not (= (select .cse38 .cse43) 1)) (< (+ c_~sum~0 (select .cse38 .cse44) (select .cse38 .cse45) (select .cse38 .cse46) (select .cse38 .cse47) (select .cse38 .cse48)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse49 .cse39) 1)) (not (= (select .cse49 .cse40) 1)) (not (= (+ (select .cse49 .cse41) 1) 0)) (not (= (+ (select .cse49 .cse42) 1) 0)) (< 0 (+ c_~sum~0 (select .cse49 .cse44) (select .cse49 .cse45) (select .cse49 .cse46) (select .cse49 .cse47) (select .cse49 .cse48) 1)) (not (= (select .cse49 .cse43) 1))))))) .cse16 .cse17 .cse18) (or .cse0 (let ((.cse51 (+ c_~sum~0 .cse24 c_~element~0 .cse21 .cse25))) (and (<= 0 .cse51) (<= .cse51 1))) .cse2 .cse3 .cse4 .cse5) (or .cse14 (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse52 .cse53) 1)) (not (= (select .cse52 .cse33) 1)) (not (= (+ (select .cse52 .cse54) 1) 0)) (< (+ c_~sum~0 (select .cse52 .cse55) (select .cse52 .cse56) (select .cse52 .cse57) (select .cse52 .cse58) (select .cse52 .cse59)) 2) (not (= (+ (select .cse52 .cse60) 1) 0)) (not (= (select .cse52 .cse61) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse62 .cse53) 1)) (not (= (select .cse62 .cse33) 1)) (not (= (+ (select .cse62 .cse54) 1) 0)) (< 0 (+ c_~sum~0 (select .cse62 .cse55) (select .cse62 .cse56) (select .cse62 .cse57) (select .cse62 .cse58) (select .cse62 .cse59) 1)) (not (= (+ (select .cse62 .cse60) 1) 0)) (not (= (select .cse62 .cse61) 1)))))) .cse16 .cse17 .cse18) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse34 .cse7 (let ((.cse63 (+ c_~sum~0 .cse24 c_~element~0 .cse21))) (and (<= 0 .cse63) (<= .cse63 1))) .cse35 .cse12) (or (let ((.cse64 (+ c_~sum~0 .cse37 .cse21))) (and (<= .cse64 1) (<= 0 .cse64))) .cse19 .cse17 .cse5) (or .cse14 (let ((.cse66 (+ .cse50 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse67 (+ .cse30 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse68 (+ .cse30 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse69 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse70 (+ .cse30 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse71 (+ .cse30 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse72 (+ .cse50 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse73 (+ .cse50 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse74 (+ 16 .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse75 (+ .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse65 .cse66) 1)) (< 0 (+ c_~sum~0 (select .cse65 .cse67) (select .cse65 .cse68) (select .cse65 .cse69) (select .cse65 .cse70) (select .cse65 .cse71) 1)) (not (= (+ (select .cse65 .cse72) 1) 0)) (not (= (+ (select .cse65 .cse73) 1) 0)) (not (= (select .cse65 .cse74) 1)) (not (= (select .cse65 .cse75) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse76 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse76 .cse66) 1)) (< (+ c_~sum~0 (select .cse76 .cse67) (select .cse76 .cse68) (select .cse76 .cse69) (select .cse76 .cse70) (select .cse76 .cse71)) 2) (not (= (+ (select .cse76 .cse72) 1) 0)) (not (= (+ (select .cse76 .cse73) 1) 0)) (not (= (select .cse76 .cse74) 1)) (not (= (select .cse76 .cse75) 1))))))) .cse16 .cse17 .cse18) (<= 0 .cse13) (or .cse14 .cse16 (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse77 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= 0 (+ (select .cse77 .cse60) 1))) (not (= (+ (select .cse77 .cse54) 1) 0)) (not (= (select .cse77 .cse61) 1)) (not (= (select .cse77 .cse33) 1)) (not (= 1 (select .cse77 .cse53))) (< 0 (+ (select .cse77 .cse56) c_~sum~0 (select .cse77 .cse55) (select .cse77 .cse59) (select .cse77 .cse57) (select .cse77 .cse58) 1))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse78 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (< (+ (select .cse78 .cse56) c_~sum~0 (select .cse78 .cse55) (select .cse78 .cse59) (select .cse78 .cse57) (select .cse78 .cse58)) 2) (not (= 0 (+ (select .cse78 .cse60) 1))) (not (= (+ (select .cse78 .cse54) 1) 0)) (not (= (select .cse78 .cse61) 1)) (not (= (select .cse78 .cse33) 1)) (not (= 1 (select .cse78 .cse53))))))) .cse17 .cse18) (or .cse6 .cse7 (let ((.cse79 (+ c_~sum~0 .cse24 .cse37 c_~element~0 .cse21 .cse25))) (and (<= .cse79 1) (<= 0 .cse79))) .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse16 (let ((.cse81 (+ .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse82 (+ .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse83 (+ .cse50 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse84 (+ 16 .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse86 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse87 (+ .cse30 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse88 (+ .cse30 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse89 (+ .cse30 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse90 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse85 (+ .cse50 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse80 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse80 .cse81) 1)) (not (= (+ (select .cse80 .cse82) 1) 0)) (not (= (+ 1 (select .cse80 .cse83)) 0)) (not (= (select .cse80 .cse84) 1)) (not (= (select .cse80 .cse85) 1)) (< (+ c_~sum~0 (select .cse80 .cse86) (select .cse80 .cse87) (select .cse80 .cse88) (select .cse80 .cse89) (select .cse80 .cse90)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse91 .cse81) 1)) (not (= (+ (select .cse91 .cse82) 1) 0)) (not (= (+ 1 (select .cse91 .cse83)) 0)) (not (= (select .cse91 .cse84) 1)) (< 0 (+ c_~sum~0 (select .cse91 .cse86) (select .cse91 .cse87) (select .cse91 .cse88) (select .cse91 .cse89) (select .cse91 .cse90) 1)) (not (= (select .cse91 .cse85) 1))))))) .cse17 .cse18)))))) is different from false [2024-01-26 12:31:36,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~back~0 4)) (.cse22 (* c_~front~0 4))) (let ((.cse50 (+ c_~queue~0.offset .cse22 16)) (.cse48 (+ c_~queue~0.offset .cse22 12)) (.cse49 (+ c_~queue~0.offset .cse22 4)) (.cse46 (+ c_~queue~0.offset .cse22)) (.cse47 (+ c_~queue~0.offset .cse22 8)) (.cse52 (+ c_~queue~0.offset .cse8 8)) (.cse51 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select |c_#memory_int| c_~queue~0.base)) (.cse45 (+ c_~queue~0.offset .cse8 12))) (let ((.cse44 (+ c_~queue~0.offset .cse8)) (.cse24 (+ c_~back~0 4)) (.cse25 (select .cse7 .cse45)) (.cse26 (select .cse7 .cse51)) (.cse27 (select .cse7 .cse52)) (.cse21 (= c_~back~0 c_~front~0)) (.cse16 (select .cse7 .cse47)) (.cse30 (select .cse7 .cse46)) (.cse17 (select .cse7 .cse49)) (.cse18 (select .cse7 .cse48)) (.cse19 (select .cse7 .cse50))) (let ((.cse2 (let ((.cse83 (+ c_~sum~0 .cse16 .cse30 .cse17 .cse18 .cse19))) (and (<= .cse83 1) (<= 0 .cse83)))) (.cse14 (+ c_~sum~0 .cse30)) (.cse10 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse21)) (.cse28 (+ c_~queue~0.offset 16 .cse8)) (.cse0 (not (= (+ .cse27 1) 0))) (.cse1 (not (= .cse26 1))) (.cse3 (not (= .cse25 1))) (.cse4 (< (+ c_~back~0 3) 0)) (.cse5 (< c_~n~0 .cse24)) (.cse6 (not (= (+ (select .cse7 .cse44) 1) 0))) (.cse9 (< c_~n~0 (+ c_~front~0 1))) (.cse11 (< c_~n~0 (+ c_~back~0 5))) (.cse12 (< c_~back~0 0)) (.cse13 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (= (+ (select .cse7 .cse8) 1) 0) (= c_~sum~0 1) (or .cse9 (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 .cse11 .cse12 .cse13) (<= .cse14 1) (or .cse0 .cse1 .cse3 .cse4 .cse5 (let ((.cse15 (+ c_~sum~0 .cse16 c_~element~0 .cse17 .cse18 .cse19))) (and (<= 0 .cse15) (<= .cse15 1))) .cse6) (or (let ((.cse20 (not (= (select .cse7 (+ .cse22 12)) 1)))) (and (or .cse20 (< 0 c_~sum~0)) (or .cse20 (< c_~sum~0 2)) .cse21)) .cse5) (or (let ((.cse23 (+ c_~sum~0 .cse16 .cse17 .cse18 |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse19))) (and (<= 0 .cse23) (<= .cse23 1))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (or (< .cse24 0) .cse9 (not (= (+ .cse25 1) 0)) .cse2 (not (= (+ .cse26 1) 0)) .cse11 (not (= .cse27 1)) (not (= (select .cse7 .cse28) 1)) .cse13) (or .cse9 .cse10 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 6) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11 .cse12 .cse13) (or (< (+ c_~back~0 1) 0) .cse1 (< c_~n~0 (+ c_~back~0 2)) (let ((.cse29 (+ c_~sum~0 .cse16 .cse30 .cse17))) (and (<= 0 .cse29) (<= .cse29 1))) .cse6) (or (< 1 c_~back~0) (< 5 c_~front~0) .cse10 .cse12 .cse13) (= c_~queue~0.offset 0) (or .cse9 .cse10 .cse11 .cse12 .cse13 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (<= 0 .cse14) (or .cse9 (let ((.cse32 (+ 16 |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse8)) (.cse33 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse8 8)) (.cse34 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse8 12)) (.cse35 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse8 4)) (.cse37 (+ .cse22 16 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse38 (+ .cse22 |c_ULTIMATE.start_main_#t~ret10#1.offset| 8)) (.cse39 (+ .cse22 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse40 (+ .cse22 |c_ULTIMATE.start_main_#t~ret10#1.offset| 12)) (.cse41 (+ .cse22 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse36 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse8))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse31 .cse32) 1)) (not (= (select .cse31 .cse33) 1)) (not (= (+ (select .cse31 .cse34) 1) 0)) (not (= (+ (select .cse31 .cse35) 1) 0)) (not (= (select .cse31 .cse36) 1)) (< (+ c_~sum~0 (select .cse31 .cse37) (select .cse31 .cse38) (select .cse31 .cse39) (select .cse31 .cse40) (select .cse31 .cse41)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse42 .cse32) 1)) (not (= (select .cse42 .cse33) 1)) (not (= (+ (select .cse42 .cse34) 1) 0)) (not (= (+ (select .cse42 .cse35) 1) 0)) (< 0 (+ c_~sum~0 (select .cse42 .cse37) (select .cse42 .cse38) (select .cse42 .cse39) (select .cse42 .cse40) (select .cse42 .cse41) 1)) (not (= (select .cse42 .cse36) 1))))))) .cse11 .cse12 .cse13) (or .cse9 (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse43 .cse44) 1)) (not (= (select .cse43 .cse28) 1)) (not (= (+ (select .cse43 .cse45) 1) 0)) (< (+ c_~sum~0 (select .cse43 .cse46) (select .cse43 .cse47) (select .cse43 .cse48) (select .cse43 .cse49) (select .cse43 .cse50)) 2) (not (= (+ (select .cse43 .cse51) 1) 0)) (not (= (select .cse43 .cse52) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= (select .cse53 .cse44) 1)) (not (= (select .cse53 .cse28) 1)) (not (= (+ (select .cse53 .cse45) 1) 0)) (< 0 (+ c_~sum~0 (select .cse53 .cse46) (select .cse53 .cse47) (select .cse53 .cse48) (select .cse53 .cse49) (select .cse53 .cse50) 1)) (not (= (+ (select .cse53 .cse51) 1) 0)) (not (= (select .cse53 .cse52) 1)))))) .cse11 .cse12 .cse13) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (let ((.cse54 (let ((.cse55 (* 4 |c_thread1Thread1of1ForFork0_#t~post2#1|))) (+ c_~sum~0 (select .cse7 (+ c_~queue~0.offset 4 .cse55)) c_~element~0 (select .cse7 (+ c_~queue~0.offset 16 .cse55)) (select .cse7 (+ c_~queue~0.offset 8 .cse55)) (select .cse7 (+ c_~queue~0.offset 12 .cse55)))))) (and (<= .cse54 1) (<= 0 .cse54))) .cse1 .cse3 .cse4 .cse5 .cse6) (or .cse9 (let ((.cse57 (+ .cse8 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse58 (+ .cse22 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse59 (+ .cse22 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse60 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse61 (+ .cse22 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse62 (+ .cse22 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse63 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse64 (+ .cse8 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse65 (+ 16 .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse66 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse56 .cse57) 1)) (< 0 (+ c_~sum~0 (select .cse56 .cse58) (select .cse56 .cse59) (select .cse56 .cse60) (select .cse56 .cse61) (select .cse56 .cse62) 1)) (not (= (+ (select .cse56 .cse63) 1) 0)) (not (= (+ (select .cse56 .cse64) 1) 0)) (not (= (select .cse56 .cse65) 1)) (not (= (select .cse56 .cse66) 1))))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse67 .cse57) 1)) (< (+ c_~sum~0 (select .cse67 .cse58) (select .cse67 .cse59) (select .cse67 .cse60) (select .cse67 .cse61) (select .cse67 .cse62)) 2) (not (= (+ (select .cse67 .cse63) 1) 0)) (not (= (+ (select .cse67 .cse64) 1) 0)) (not (= (select .cse67 .cse65) 1)) (not (= (select .cse67 .cse66) 1))))))) .cse11 .cse12 .cse13) (or .cse9 .cse11 (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse68 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (not (= 0 (+ (select .cse68 .cse51) 1))) (not (= (+ (select .cse68 .cse45) 1) 0)) (not (= (select .cse68 .cse52) 1)) (not (= (select .cse68 .cse28) 1)) (not (= 1 (select .cse68 .cse44))) (< 0 (+ (select .cse68 .cse47) c_~sum~0 (select .cse68 .cse46) (select .cse68 .cse50) (select .cse68 .cse48) (select .cse68 .cse49) 1))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) c_~queue~0.base))) (or (< (+ (select .cse69 .cse47) c_~sum~0 (select .cse69 .cse46) (select .cse69 .cse50) (select .cse69 .cse48) (select .cse69 .cse49)) 2) (not (= 0 (+ (select .cse69 .cse51) 1))) (not (= (+ (select .cse69 .cse45) 1) 0)) (not (= (select .cse69 .cse52) 1)) (not (= (select .cse69 .cse28) 1)) (not (= 1 (select .cse69 .cse44))))))) .cse12 .cse13) (or .cse0 .cse1 (let ((.cse70 (+ c_~sum~0 .cse16 .cse30 c_~element~0 .cse17 .cse18))) (and (<= .cse70 1) (<= 0 .cse70))) .cse3 .cse4 .cse5 .cse6) (or .cse9 .cse11 (let ((.cse72 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse73 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse74 (+ .cse8 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse75 (+ 16 .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse77 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse78 (+ .cse22 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse79 (+ .cse22 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse80 (+ .cse22 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse81 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse76 (+ .cse8 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse71 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse71 .cse72) 1)) (not (= (+ (select .cse71 .cse73) 1) 0)) (not (= (+ 1 (select .cse71 .cse74)) 0)) (not (= (select .cse71 .cse75) 1)) (not (= (select .cse71 .cse76) 1)) (< (+ c_~sum~0 (select .cse71 .cse77) (select .cse71 .cse78) (select .cse71 .cse79) (select .cse71 .cse80) (select .cse71 .cse81)) 2)))) (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse82 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse82 .cse72) 1)) (not (= (+ (select .cse82 .cse73) 1) 0)) (not (= (+ 1 (select .cse82 .cse74)) 0)) (not (= (select .cse82 .cse75) 1)) (< 0 (+ c_~sum~0 (select .cse82 .cse77) (select .cse82 .cse78) (select .cse82 .cse79) (select .cse82 .cse80) (select .cse82 .cse81) 1)) (not (= (select .cse82 .cse76) 1))))))) .cse12 .cse13)))))) is different from false [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2024-01-26 12:33:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 484 states. [2024-01-26 12:33:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2024-01-26 12:33:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 495 states. [2024-01-26 12:33:07,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-01-26 12:33:07,672 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,SelfDestructingSolverStorable11 [2024-01-26 12:33:07,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:33:07,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:33:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 565000222, now seen corresponding path program 6 times [2024-01-26 12:33:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:33:07,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138831404] [2024-01-26 12:33:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:33:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:33:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:33:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 31 proven. 489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:33:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:33:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138831404] [2024-01-26 12:33:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138831404] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:33:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183256707] [2024-01-26 12:33:24,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-26 12:33:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:33:24,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:33:24,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 12:33:24,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-26 12:33:24,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-01-26 12:33:24,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:33:24,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 136 conjunts are in the unsatisfiable core [2024-01-26 12:33:24,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:33:33,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:33:33,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:33:33,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:33:33,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:33:33,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 104 treesize of output 184 [2024-01-26 12:33:34,258 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:33:34,273 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:33:34,279 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:33:34,285 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:33:34,292 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 12:33:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:33:34,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:33:43,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:33:43,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 151 treesize of output 220 [2024-01-26 12:33:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 9 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:33:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183256707] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:33:49,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:33:49,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 77, 72] total 214 [2024-01-26 12:33:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107453231] [2024-01-26 12:33:49,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:33:49,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 214 states [2024-01-26 12:33:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:33:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2024-01-26 12:33:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4997, Invalid=40585, Unknown=0, NotChecked=0, Total=45582 [2024-01-26 12:33:49,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:33:49,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:33:49,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 214 states, 214 states have (on average 3.7476635514018692) internal successors, (802), 214 states have internal predecessors, (802), 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:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2024-01-26 12:33:49,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 185 states. [2024-01-26 12:33:49,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 484 states. [2024-01-26 12:33:49,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 352 states. [2024-01-26 12:33:49,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 495 states. [2024-01-26 12:33:49,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2024-01-26 12:37:53,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-26 12:37:53,021 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:37:53,021 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 12:37:53,022 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:37:53,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:37:53,204 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-32-6-5-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-32-4-5-2-3-1 context. [2024-01-26 12:37:53,206 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 12:37:53,217 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1, 1] [2024-01-26 12:37:53,219 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-01-26 12:37:53,220 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 12:37:53,220 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 12:37:53,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 12:37:53 BasicIcfg [2024-01-26 12:37:53,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 12:37:53,223 INFO L158 Benchmark]: Toolchain (without parser) took 840389.68ms. Allocated memory was 332.4MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 279.0MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 652.9MB. Max. memory is 8.0GB. [2024-01-26 12:37:53,223 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 204.5MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 12:37:53,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.36ms. Allocated memory is still 332.4MB. Free memory was 279.0MB in the beginning and 266.9MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 12:37:53,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.24ms. Allocated memory is still 332.4MB. Free memory was 266.9MB in the beginning and 265.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 12:37:53,223 INFO L158 Benchmark]: Boogie Preprocessor took 34.89ms. Allocated memory is still 332.4MB. Free memory was 265.0MB in the beginning and 263.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 12:37:53,224 INFO L158 Benchmark]: RCFGBuilder took 497.95ms. Allocated memory is still 332.4MB. Free memory was 263.3MB in the beginning and 241.9MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-01-26 12:37:53,224 INFO L158 Benchmark]: TraceAbstraction took 839539.38ms. Allocated memory was 332.4MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 240.9MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 615.1MB. Max. memory is 8.0GB. [2024-01-26 12:37:53,225 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.13ms. Allocated memory is still 204.5MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.36ms. Allocated memory is still 332.4MB. Free memory was 279.0MB in the beginning and 266.9MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.24ms. Allocated memory is still 332.4MB. Free memory was 266.9MB in the beginning and 265.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.89ms. Allocated memory is still 332.4MB. Free memory was 265.0MB in the beginning and 263.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 497.95ms. Allocated memory is still 332.4MB. Free memory was 263.3MB in the beginning and 241.9MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 839539.38ms. Allocated memory was 332.4MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 240.9MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 615.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1450, independent: 1183, independent conditional: 1183, independent unconditional: 0, dependent: 267, dependent conditional: 267, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 0, Positive unconditional cache size: 460, 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: 267, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1418, independent: 1195, independent conditional: 1195, independent unconditional: 0, dependent: 223, dependent conditional: 223, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 0, Positive unconditional cache size: 460, 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: 490, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1607, independent: 1364, independent conditional: 1364, independent unconditional: 0, dependent: 243, dependent conditional: 243, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 500, Positive conditional cache size: 0, Positive unconditional cache size: 500, 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: 733, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 104, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 515, Positive conditional cache size: 0, Positive unconditional cache size: 515, 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: 753, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2582, independent: 2241, independent conditional: 2241, independent unconditional: 0, dependent: 341, dependent conditional: 341, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 785, Positive cache size: 781, Positive conditional cache size: 0, Positive unconditional cache size: 781, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 4, Independence queries for same thread: 1088, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3861, independent: 3377, independent conditional: 3377, independent unconditional: 0, dependent: 484, dependent conditional: 484, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 921, Positive cache size: 917, Positive conditional cache size: 0, Positive unconditional cache size: 917, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 59, Maximal queried relation: 5, Independence queries for same thread: 1565, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4390, independent: 3919, independent conditional: 3919, independent unconditional: 0, dependent: 471, dependent conditional: 471, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 927, Positive cache size: 923, Positive conditional cache size: 0, Positive unconditional cache size: 923, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 119, Maximal queried relation: 6, Independence queries for same thread: 2026, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3468, independent: 3113, independent conditional: 3113, independent unconditional: 0, dependent: 355, dependent conditional: 355, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 986, Positive conditional cache size: 0, Positive unconditional cache size: 986, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 175, Maximal queried relation: 7, Independence queries for same thread: 2373, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5363, independent: 4803, independent conditional: 4803, independent unconditional: 0, dependent: 560, dependent conditional: 560, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 991, Positive cache size: 987, Positive conditional cache size: 0, Positive unconditional cache size: 987, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 287, Maximal queried relation: 8, Independence queries for same thread: 2919, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 15274, independent: 13919, independent conditional: 13919, independent unconditional: 0, dependent: 1355, dependent conditional: 1355, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 1131, Positive cache size: 1127, Positive conditional cache size: 0, Positive unconditional cache size: 1127, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 566, Maximal queried relation: 9, Independence queries for same thread: 4243, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 18794, independent: 17066, independent conditional: 17066, independent unconditional: 0, dependent: 1728, dependent conditional: 1728, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1187, Positive conditional cache size: 0, Positive unconditional cache size: 1187, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 946, Maximal queried relation: 10, Independence queries for same thread: 5933, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 25206, independent: 22795, independent conditional: 22795, independent unconditional: 0, dependent: 2411, dependent conditional: 2411, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1187, Positive conditional cache size: 0, Positive unconditional cache size: 1187, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1474, Maximal queried relation: 11, Independence queries for same thread: 8296, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 33181, independent: 29925, independent conditional: 29925, independent unconditional: 0, dependent: 3256, dependent conditional: 3256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 1317, Positive cache size: 1313, Positive conditional cache size: 0, Positive unconditional cache size: 1313, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2194, Maximal queried relation: 12, Independence queries for same thread: 11492, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19846, independent: 18023, independent conditional: 18023, independent unconditional: 0, dependent: 1823, dependent conditional: 1823, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 136544, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 13537, dependent conditional: 13537, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123263, independent: 123007, independent conditional: 123007, independent unconditional: 0, dependent: 256, dependent conditional: 256, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 2636, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125899, independent: 123007, independent conditional: 0, independent unconditional: 123007, dependent: 2892, dependent conditional: 0, dependent unconditional: 2892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 125899, independent: 121694, independent conditional: 0, independent unconditional: 121694, dependent: 2888, dependent conditional: 0, dependent unconditional: 2888, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 1317, Positive cache size: 1313, Positive conditional cache size: 0, Positive unconditional cache size: 1313, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2636, Maximal queried relation: 13, Independence queries for same thread: 13281, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2347, independent: 1969, independent conditional: 1969, independent unconditional: 0, dependent: 378, dependent conditional: 378, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2000, independent: 1969, independent conditional: 1969, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2000, independent: 1969, independent conditional: 1969, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2265, independent: 1969, independent conditional: 0, independent unconditional: 1969, dependent: 296, dependent conditional: 265, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2265, independent: 1969, independent conditional: 0, independent unconditional: 1969, dependent: 296, dependent conditional: 111, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2265, independent: 1969, independent conditional: 0, independent unconditional: 1969, dependent: 296, dependent conditional: 111, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 336, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 336, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 207, dependent conditional: 185, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2265, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 261, dependent conditional: 79, dependent unconditional: 182, unknown: 336, unknown conditional: 32, unknown unconditional: 304] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 301, Positive conditional cache size: 0, Positive unconditional cache size: 301, Negative cache size: 35, Negative conditional cache size: 32, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 154, Maximal queried relation: 12, Independence queries for same thread: 347 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-32-6-5-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-32-4-5-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 174 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 839.4s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 628.0s, 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: 2353, 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.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 207.3s InterpolantComputationTime, 3603 NumberOfCodeBlocks, 3572 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 5005 ConstructedInterpolants, 86 QuantifiedInterpolants, 149371 SizeOfPredicates, 296 NumberOfNonLiveVariables, 2698 ConjunctsInSsa, 602 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 158/4405 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