./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 21:58:10,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 21:58:10,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 21:58:10,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 21:58:10,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 21:58:10,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 21:58:10,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 21:58:10,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 21:58:10,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 21:58:10,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 21:58:10,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 21:58:10,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 21:58:10,356 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 21:58:10,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 21:58:10,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 21:58:10,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 21:58:10,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 21:58:10,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 21:58:10,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 21:58:10,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 21:58:10,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 21:58:10,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 21:58:10,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 21:58:10,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 21:58:10,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 21:58:10,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 21:58:10,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 21:58:10,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 21:58:10,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 21:58:10,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 21:58:10,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:58:10,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 21:58:10,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 21:58:10,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 21:58:10,364 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 21:58:10,365 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-18 21:58:10,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 21:58:10,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 21:58:10,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 21:58:10,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 21:58:10,587 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 21:58:10,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-10-18 21:58:11,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 21:58:12,095 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 21:58:12,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-10-18 21:58:12,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/18250a37e/a96a02d5cc82403ba5545ecaf521023a/FLAG5aed1d72b [2024-10-18 21:58:12,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/18250a37e/a96a02d5cc82403ba5545ecaf521023a [2024-10-18 21:58:12,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 21:58:12,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 21:58:12,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 21:58:12,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 21:58:12,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 21:58:12,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ce4118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12, skipping insertion in model container [2024-10-18 21:58:12,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 21:58:12,599 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-10-18 21:58:12,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:58:12,653 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 21:58:12,684 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-10-18 21:58:12,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 21:58:12,748 INFO L204 MainTranslator]: Completed translation [2024-10-18 21:58:12,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12 WrapperNode [2024-10-18 21:58:12,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 21:58:12,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 21:58:12,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 21:58:12,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 21:58:12,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,808 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 285 [2024-10-18 21:58:12,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 21:58:12,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 21:58:12,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 21:58:12,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 21:58:12,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 21:58:12,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 21:58:12,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 21:58:12,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 21:58:12,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (1/1) ... [2024-10-18 21:58:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 21:58:12,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:12,883 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-10-18 21:58:12,885 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-10-18 21:58:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 21:58:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 21:58:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-18 21:58:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 21:58:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 21:58:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-18 21:58:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 21:58:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-18 21:58:12,925 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-18 21:58:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 21:58:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 21:58:12,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 21:58:12,927 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 21:58:13,073 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 21:58:13,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 21:58:13,405 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 21:58:13,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 21:58:13,568 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 21:58:13,569 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-18 21:58:13,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:58:13 BoogieIcfgContainer [2024-10-18 21:58:13,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 21:58:13,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 21:58:13,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 21:58:13,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 21:58:13,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 09:58:12" (1/3) ... [2024-10-18 21:58:13,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce01873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:58:13, skipping insertion in model container [2024-10-18 21:58:13,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:58:12" (2/3) ... [2024-10-18 21:58:13,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce01873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:58:13, skipping insertion in model container [2024-10-18 21:58:13,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:58:13" (3/3) ... [2024-10-18 21:58:13,582 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-10-18 21:58:13,599 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 21:58:13,599 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-18 21:58:13,599 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 21:58:13,705 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-18 21:58:13,755 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 21:58:13,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 21:58:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:13,757 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-10-18 21:58:13,759 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-10-18 21:58:13,829 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 21:58:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:13,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-18 21:58:13,858 INFO L333 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, 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;@6755960, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 21:58:13,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 21:58:14,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:14,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1084761360, now seen corresponding path program 1 times [2024-10-18 21:58:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828048671] [2024-10-18 21:58:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828048671] [2024-10-18 21:58:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828048671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 21:58:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 21:58:14,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 21:58:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114720913] [2024-10-18 21:58:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 21:58:14,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 21:58:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:58:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 21:58:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 21:58:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:14,488 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:58:14,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-10-18 21:58:14,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:14,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 21:58:14,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:14,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash -747723976, now seen corresponding path program 1 times [2024-10-18 21:58:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9350695] [2024-10-18 21:58:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:14,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9350695] [2024-10-18 21:58:14,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9350695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:58:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428686154] [2024-10-18 21:58:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:14,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:14,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:14,735 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-10-18 21:58:14,738 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-10-18 21:58:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:14,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 21:58:14,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:58:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:14,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:58:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428686154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:58:14,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:58:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-18 21:58:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128731894] [2024-10-18 21:58:14,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:58:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 21:58:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:58:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 21:58:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 21:58:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:14,861 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:58:14,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:58:14,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:14,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:14,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 21:58:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-18 21:58:15,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:15,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1928047856, now seen corresponding path program 2 times [2024-10-18 21:58:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:15,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165722361] [2024-10-18 21:58:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165722361] [2024-10-18 21:58:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165722361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:58:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540391702] [2024-10-18 21:58:15,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 21:58:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:15,278 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-10-18 21:58:15,279 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-10-18 21:58:15,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 21:58:15,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:58:15,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 21:58:15,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:58:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:15,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:58:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 21:58:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540391702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:58:15,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:58:15,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-18 21:58:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710593174] [2024-10-18 21:58:15,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:58:15,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 21:58:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:58:15,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 21:58:15,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-18 21:58:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:15,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:58:15,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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-10-18 21:58:15,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:15,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:15,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:15,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 21:58:15,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:15,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1241085968, now seen corresponding path program 3 times [2024-10-18 21:58:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648677871] [2024-10-18 21:58:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648677871] [2024-10-18 21:58:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648677871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:58:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257145708] [2024-10-18 21:58:16,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 21:58:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:16,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:16,055 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-10-18 21:58:16,057 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-10-18 21:58:16,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-18 21:58:16,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:58:16,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-18 21:58:16,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:58:16,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-18 21:58:16,235 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:58:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:58:16,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:58:16,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:58:16,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-10-18 21:58:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:16,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:58:20,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:58:22,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:58:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-18 21:58:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257145708] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:58:22,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:58:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-18 21:58:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453694828] [2024-10-18 21:58:22,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:58:22,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-18 21:58:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:58:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-18 21:58:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=122, Unknown=4, NotChecked=46, Total=210 [2024-10-18 21:58:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:22,577 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:58:22,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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-10-18 21:58:22,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:22,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:22,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:22,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:22,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-18 21:58:22,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:22,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:22,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1875016076, now seen corresponding path program 1 times [2024-10-18 21:58:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:22,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250552761] [2024-10-18 21:58:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:24,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250552761] [2024-10-18 21:58:24,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250552761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:58:24,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362592148] [2024-10-18 21:58:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:24,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:24,382 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-10-18 21:58:24,383 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-10-18 21:58:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:24,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-18 21:58:24,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:58:24,480 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 7 treesize of output 6 [2024-10-18 21:58:24,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:58:24,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:58:24,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:58:24,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:58:24,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-10-18 21:58:24,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-10-18 21:58:24,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-18 21:58:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:24,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:58:34,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-18 21:58:39,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-18 21:58:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-18 21:58:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362592148] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:58:39,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:58:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 26 [2024-10-18 21:58:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157464726] [2024-10-18 21:58:39,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:58:39,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-18 21:58:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:58:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-18 21:58:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=514, Unknown=4, NotChecked=94, Total=702 [2024-10-18 21:58:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:39,148 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:58:39,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.111111111111111) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 21:58:39,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:39,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:39,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:39,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:39,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:58:41,209 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:58:41,210 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 1212 treesize of output 1072 [2024-10-18 21:58:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -647405696, now seen corresponding path program 1 times [2024-10-18 21:58:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:58:41,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:58:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:58:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:58:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:58:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:58:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:58:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 21:58:41,502 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-10-18 21:58:41,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-18 21:58:41,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:58:41,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:58:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 310715724, now seen corresponding path program 2 times [2024-10-18 21:58:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:58:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003574439] [2024-10-18 21:58:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:58:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:58:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:58:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:42,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:58:42,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003574439] [2024-10-18 21:58:42,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003574439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:58:42,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675956696] [2024-10-18 21:58:42,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 21:58:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:58:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:58:42,175 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-10-18 21:58:42,176 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-10-18 21:58:42,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 21:58:42,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:58:42,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-18 21:58:42,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:58:42,269 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 7 treesize of output 6 [2024-10-18 21:58:42,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:58:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:58:42,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:58:42,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-18 21:58:42,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-18 21:58:42,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-18 21:58:45,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-18 21:58:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:58:45,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 21:58:57,726 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0))) is different from false [2024-10-18 21:58:59,373 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (v_ArrVal_375 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0))) is different from false [2024-10-18 21:59:01,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (v_ArrVal_375 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0))) is different from false [2024-10-18 21:59:03,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (v_ArrVal_372 Int) (v_ArrVal_375 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_372 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0))) is different from false [2024-10-18 21:59:05,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (v_ArrVal_372 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_375 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_35| (+ v_ArrVal_372 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_35| 28)))) is different from false [2024-10-18 21:59:07,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_375 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_371) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_35| (+ v_ArrVal_372 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_35| 28)))) is different from false [2024-10-18 21:59:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-18 21:59:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675956696] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 21:59:07,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 21:59:07,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-18 21:59:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198350192] [2024-10-18 21:59:07,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 21:59:07,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-18 21:59:07,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 21:59:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-18 21:59:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=14, NotChecked=258, Total=702 [2024-10-18 21:59:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:59:07,410 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 21:59:07,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 26 states have internal predecessors, (103), 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-10-18 21:59:07,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:59:07,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:59:07,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:59:07,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:59:07,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 21:59:07,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 21:59:13,713 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 21:59:13,714 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 1216 treesize of output 1076 [2024-10-18 21:59:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -326132175, now seen corresponding path program 1 times [2024-10-18 21:59:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:59:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:59:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:59:15,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 21:59:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 21:59:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 21:59:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 21:59:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:59:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 21:59:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 21:59:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 21:59:15,093 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-10-18 21:59:15,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:59:15,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 21:59:15,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 21:59:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2141943016, now seen corresponding path program 3 times [2024-10-18 21:59:15,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 21:59:15,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051659673] [2024-10-18 21:59:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 21:59:15,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 21:59:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 21:59:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:59:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 21:59:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051659673] [2024-10-18 21:59:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051659673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 21:59:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938938533] [2024-10-18 21:59:19,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 21:59:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 21:59:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 21:59:19,465 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-10-18 21:59:19,466 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-10-18 21:59:19,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-18 21:59:19,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 21:59:19,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-18 21:59:19,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 21:59:19,587 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 7 treesize of output 6 [2024-10-18 21:59:19,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 21:59:19,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 21:59:19,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 21:59:19,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-18 21:59:19,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-18 21:59:22,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-18 21:59:26,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-18 21:59:33,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-10-18 21:59:50,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2024-10-18 21:59:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 21:59:50,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:00:21,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:00:23,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_561 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:00:25,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_561 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-18 22:00:27,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_559 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:00:29,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_559 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2024-10-18 22:00:29,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_559 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|)))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-18 22:00:31,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_559 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:00:33,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_555 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_559 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:00:35,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_555 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_559 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-18 22:00:37,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_554 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_554) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_555 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_559 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_561) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-18 22:00:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-18 22:00:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938938533] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:00:37,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:00:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2024-10-18 22:00:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997500917] [2024-10-18 22:00:37,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:00:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-18 22:00:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:00:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-18 22:00:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=40, NotChecked=710, Total=1806 [2024-10-18 22:00:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:00:37,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:00:37,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 42 states have internal predecessors, (165), 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-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:00:37,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:00:43,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:00:52,400 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-18 22:00:52,400 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 2562 treesize of output 2278 [2024-10-18 22:00:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 175644569, now seen corresponding path program 1 times [2024-10-18 22:00:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:00:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:00:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 22:00:54,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 22:00:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 22:00:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:00:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:00:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:00:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 22:00:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 22:00:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:00:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 22:00:54,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-18 22:00:54,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2024-10-18 22:00:54,863 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 22:00:54,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 22:00:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1862131292, now seen corresponding path program 4 times [2024-10-18 22:00:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 22:00:54,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119262753] [2024-10-18 22:00:54,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 22:00:54,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 22:00:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 22:01:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-18 22:01:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 22:01:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119262753] [2024-10-18 22:01:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119262753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 22:01:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073183738] [2024-10-18 22:01:15,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 22:01:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 22:01:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 22:01:15,072 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-10-18 22:01:15,073 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-10-18 22:01:15,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 22:01:15,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 22:01:15,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-18 22:01:15,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 22:01:15,455 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 7 treesize of output 6 [2024-10-18 22:01:15,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 22:01:15,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-18 22:01:15,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-18 22:01:15,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-18 22:01:15,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-18 22:01:21,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-18 22:01:25,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-18 22:01:46,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2024-10-18 22:01:54,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 189 [2024-10-18 22:02:33,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 228 [2024-10-18 22:02:59,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 986 treesize of output 841 [2024-10-18 22:03:26,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 995 treesize of output 848 [2024-10-18 22:03:29,912 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse7 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| 4))) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse1 (select .cse5 v_prenex_15)) (.cse6 (select .cse5 v_prenex_16))) (let ((.cse3 (store (store .cse7 v_prenex_15 .cse1) v_prenex_16 .cse6)) (.cse4 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse2 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse4 1)))) (and (<= (+ 84 v_prenex_15) .cse0) (= .cse1 (select .cse2 v_prenex_15)) (= (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4) .cse5) (not (= v_prenex_16 v_prenex_15)) (<= (+ 56 v_prenex_16) .cse0) (= (select .cse2 v_prenex_16) .cse6)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse9 (select .cse5 v_prenex_10)) (.cse10 (select .cse5 v_prenex_9))) (let ((.cse11 (store (store .cse7 v_prenex_10 .cse9) v_prenex_9 .cse10)) (.cse12 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse8 (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse12 1)))) (and (not (= v_prenex_10 v_prenex_9)) (<= (+ 56 v_prenex_10) .cse0) (= (select .cse8 v_prenex_10) .cse9) (= (select .cse8 v_prenex_9) .cse10) (= (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse12) .cse5) (<= (+ 28 v_prenex_9) .cse0)))))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_27 Int)) (and (<= (+ 84 v_subst_27) .cse0) (= (store (store .cse7 v_subst_27 (select .cse5 v_subst_27)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_11 Int)) (and (<= (+ 56 v_prenex_11) .cse0) (= (store (store .cse7 v_prenex_11 (select .cse5 v_prenex_11)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse15 (select .cse5 v_prenex_8))) (let ((.cse13 (store (store .cse7 v_prenex_7 (select .cse5 v_prenex_7)) v_prenex_8 .cse15)) (.cse14 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse14) .cse5) (not (= v_prenex_8 v_prenex_7)) (= (select (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse14 1)) v_prenex_8) .cse15) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_7)) (<= (+ 84 v_prenex_7) .cse0) (<= (+ 56 v_prenex_8) .cse0))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_3 Int)) (and (= (store (store .cse7 v_prenex_3 (select .cse5 v_prenex_3)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5) (<= (+ 84 v_prenex_3) .cse0))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (exists ((v_prenex_2 Int)) (and (<= (+ 84 v_prenex_2) .cse0) (= (store (store .cse7 v_prenex_2 (select .cse5 v_prenex_2)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_19 Int)) (and (= (store (store .cse7 v_prenex_19 (select .cse5 v_prenex_19)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5) (<= (+ 84 v_prenex_19) .cse0))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_4 Int) (v_subst_24 Int)) (let ((.cse18 (select .cse5 v_prenex_4))) (let ((.cse16 (store (store .cse7 v_prenex_4 .cse18) v_subst_24 (select .cse5 v_subst_24))) (.cse17 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_4) .cse0) (= (select (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse17 1)) v_prenex_4) .cse18) (<= (+ v_subst_24 28) .cse0) (not (= v_subst_24 v_prenex_4)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_24)) (= .cse5 (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse17)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_26 Int) (v_prenex_17 Int)) (let ((.cse21 (select .cse5 v_subst_26))) (let ((.cse19 (store (store .cse7 v_prenex_17 (select .cse5 v_prenex_17)) v_subst_26 .cse21)) (.cse20 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse20) .cse5) (<= (+ 56 v_prenex_17) .cse0) (not (= v_prenex_17 v_subst_26)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_17)) (<= (+ 84 v_subst_26) .cse0) (= .cse21 (select (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse20 1)) v_subst_26)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_18 Int)) (and (<= (+ 84 v_prenex_18) .cse0) (= (store (store .cse7 v_prenex_18 (select .cse5 v_prenex_18)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 84 v_subst_20) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_20)) (= (store (store .cse7 v_subst_20 (select .cse5 v_subst_20)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_12 Int)) (and (= (store (store .cse7 v_prenex_12 (select .cse5 v_prenex_12)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5) (<= (+ v_prenex_12 28) .cse0))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_6 Int)) (and (<= (+ 56 v_prenex_6) .cse0) (= (store (store .cse7 v_prenex_6 (select .cse5 v_prenex_6)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= v_prenex_14 v_prenex_13)) (<= (+ 84 v_prenex_13) .cse0) (= (store (store (store .cse7 v_prenex_13 (select .cse5 v_prenex_13)) v_prenex_14 (select .cse5 v_prenex_14)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_14)) (<= (+ v_prenex_14 28) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_13)))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse24 (select .cse5 v_prenex_20))) (let ((.cse22 (store (store .cse7 v_prenex_21 (select .cse5 v_prenex_21)) v_prenex_20 .cse24)) (.cse23 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse22 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse23) .cse5) (not (= v_prenex_21 v_prenex_20)) (= (select (store .cse22 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse23 1)) v_prenex_20) .cse24) (<= (+ 84 v_prenex_21) .cse0) (<= (+ v_prenex_20 28) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_21)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_22 Int)) (and (= (store (store .cse7 v_subst_22 (select .cse5 v_subst_22)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5) (<= (+ 84 v_subst_22) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_subst_25 Int) (v_subst_21 Int)) (let ((.cse25 (select .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|))) (let ((.cse26 (store (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| .cse25) v_subst_21 (select .cse5 v_subst_21)) v_subst_25 (select .cse5 v_subst_25))) (.cse27 (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 56 v_subst_21) .cse0) (<= (+ v_subst_25 28) .cse0) (= .cse25 (select (store .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse27 1)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 84) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_21)) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_25)) (not (= v_subst_25 v_subst_21)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_25)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_21)) (= (store .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse27) .cse5))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_subst_23 Int)) (and (<= (+ v_subst_23 28) .cse0) (= (store (store .cse7 v_subst_23 (select .cse5 v_subst_23)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_5 Int)) (and (<= (+ 84 v_prenex_5) .cse0) (= (store (store .cse7 v_prenex_5 (select .cse5 v_prenex_5)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse5))))))) (= |c_~#cache~0.base| 4)) is different from false [2024-10-18 22:05:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1153 treesize of output 933 [2024-10-18 22:05:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 55 trivial. 21 not checked. [2024-10-18 22:05:37,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 22:06:09,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:06:11,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-18 22:06:11,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2024-10-18 22:06:11,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2024-10-18 22:06:11,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)))) is different from false [2024-10-18 22:06:11,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (or (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-18 22:06:13,962 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< (+ .cse2 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:06:16,046 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_837 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-18 22:06:18,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0)))) is different from false [2024-10-18 22:06:20,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse1 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))))) is different from false [2024-10-18 22:06:22,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse3 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-18 22:06:24,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_835 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse2 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_835 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-18 22:06:26,680 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_835 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| (+ v_ArrVal_835 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse1 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-18 22:06:28,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_835 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| (+ v_ArrVal_835 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse1 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-18 22:06:30,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_835 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| (+ v_ArrVal_835 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse3 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-18 22:06:33,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_835 Int) (v_ArrVal_831 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse2 |c_~#cache~0.offset|))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| 28)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_831 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| (+ v_ArrVal_835 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-18 22:06:35,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_835 Int) (v_ArrVal_831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| 84)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ v_ArrVal_831 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| (+ v_ArrVal_835 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|)))) is different from false [2024-10-18 22:06:37,314 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_837 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_835 Int) (v_ArrVal_830 (Array Int Int)) (v_ArrVal_831 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_830) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ v_ArrVal_831 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| (+ v_ArrVal_835 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ v_ArrVal_837 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_841)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2024-10-18 22:06:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-18 22:06:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073183738] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 22:06:39,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 22:06:39,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 62 [2024-10-18 22:06:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314852740] [2024-10-18 22:06:39,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 22:06:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-18 22:06:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 22:06:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-18 22:06:39,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1493, Unknown=114, NotChecked=1938, Total=3906 [2024-10-18 22:06:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:06:39,696 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 22:06:39,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.492063492063492) internal successors, (283), 62 states have internal predecessors, (283), 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-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 22:06:39,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 22:06:42,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:44,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:46,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:48,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:06:50,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:03,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:05,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:07,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:09,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:11,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:13,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:31,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:33,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:35,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:37,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:39,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:41,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:49,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:51,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:52,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:55,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:57,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:07:59,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:15,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:17,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:35,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:37,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:39,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:41,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:43,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:45,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:08:47,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:16,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:18,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:20,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:22,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:44,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:46,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:48,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:50,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:52,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:54,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:56,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:09:58,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:00,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:02,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:04,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:06,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:08,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:10,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:12,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:14,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:16,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:18,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:20,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:22,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:24,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:26,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:46,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:48,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:50,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 22:10:52,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| 4))) (let ((.cse2 ((as const (Array Int Int)) 0)) (.cse4 (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4) .cse3)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (not (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (or (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) .cse1) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int)) (and (= (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (select .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4) .cse3) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28) .cse0)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) .cse1 (= .cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (= .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse5 (select .cse3 v_prenex_15)) (.cse9 (select .cse3 v_prenex_16))) (let ((.cse7 (store (store .cse2 v_prenex_15 .cse5) v_prenex_16 .cse9)) (.cse8 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse6 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse8 1)))) (and (<= (+ 84 v_prenex_15) .cse0) (= .cse5 (select .cse6 v_prenex_15)) (= (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) .cse3) (not (= v_prenex_16 v_prenex_15)) (<= (+ 56 v_prenex_16) .cse0) (= (select .cse6 v_prenex_16) .cse9)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse11 (select .cse3 v_prenex_10)) (.cse12 (select .cse3 v_prenex_9))) (let ((.cse13 (store (store .cse2 v_prenex_10 .cse11) v_prenex_9 .cse12)) (.cse14 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse10 (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse14 1)))) (and (not (= v_prenex_10 v_prenex_9)) (<= (+ 56 v_prenex_10) .cse0) (= (select .cse10 v_prenex_10) .cse11) (= (select .cse10 v_prenex_9) .cse12) (= (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse14) .cse3) (<= (+ 28 v_prenex_9) .cse0)))))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_27 Int)) (and (<= (+ 84 v_subst_27) .cse0) (= (store (store .cse2 v_subst_27 (select .cse3 v_subst_27)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_11 Int)) (and (<= (+ 56 v_prenex_11) .cse0) (= (store (store .cse2 v_prenex_11 (select .cse3 v_prenex_11)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse17 (select .cse3 v_prenex_8))) (let ((.cse15 (store (store .cse2 v_prenex_7 (select .cse3 v_prenex_7)) v_prenex_8 .cse17)) (.cse16 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse16) .cse3) (not (= v_prenex_8 v_prenex_7)) (= (select (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse16 1)) v_prenex_8) .cse17) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_7)) (<= (+ 84 v_prenex_7) .cse0) (<= (+ 56 v_prenex_8) .cse0))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_3 Int)) (and (= (store (store .cse2 v_prenex_3 (select .cse3 v_prenex_3)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (<= (+ 84 v_prenex_3) .cse0))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (exists ((v_prenex_2 Int)) (and (<= (+ 84 v_prenex_2) .cse0) (= (store (store .cse2 v_prenex_2 (select .cse3 v_prenex_2)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_19 Int)) (and (= (store (store .cse2 v_prenex_19 (select .cse3 v_prenex_19)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (<= (+ 84 v_prenex_19) .cse0))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_4 Int) (v_subst_24 Int)) (let ((.cse20 (select .cse3 v_prenex_4))) (let ((.cse18 (store (store .cse2 v_prenex_4 .cse20) v_subst_24 (select .cse3 v_subst_24))) (.cse19 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_4) .cse0) (= (select (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse19 1)) v_prenex_4) .cse20) (<= (+ v_subst_24 28) .cse0) (not (= v_subst_24 v_prenex_4)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_24)) (= .cse3 (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse19)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_26 Int) (v_prenex_17 Int)) (let ((.cse23 (select .cse3 v_subst_26))) (let ((.cse21 (store (store .cse2 v_prenex_17 (select .cse3 v_prenex_17)) v_subst_26 .cse23)) (.cse22 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse21 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse22) .cse3) (<= (+ 56 v_prenex_17) .cse0) (not (= v_prenex_17 v_subst_26)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_17)) (<= (+ 84 v_subst_26) .cse0) (= .cse23 (select (store .cse21 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse22 1)) v_subst_26)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_18 Int)) (and (<= (+ 84 v_prenex_18) .cse0) (= (store (store .cse2 v_prenex_18 (select .cse3 v_prenex_18)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 84 v_subst_20) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_20)) (= (store (store .cse2 v_subst_20 (select .cse3 v_subst_20)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_12 Int)) (and (= (store (store .cse2 v_prenex_12 (select .cse3 v_prenex_12)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (<= (+ v_prenex_12 28) .cse0))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_6 Int)) (and (<= (+ 56 v_prenex_6) .cse0) (= (store (store .cse2 v_prenex_6 (select .cse3 v_prenex_6)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= v_prenex_14 v_prenex_13)) (<= (+ 84 v_prenex_13) .cse0) (= (store (store (store .cse2 v_prenex_13 (select .cse3 v_prenex_13)) v_prenex_14 (select .cse3 v_prenex_14)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_14)) (<= (+ v_prenex_14 28) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_13)))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse26 (select .cse3 v_prenex_20))) (let ((.cse24 (store (store .cse2 v_prenex_21 (select .cse3 v_prenex_21)) v_prenex_20 .cse26)) (.cse25 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse25) .cse3) (not (= v_prenex_21 v_prenex_20)) (= (select (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse25 1)) v_prenex_20) .cse26) (<= (+ 84 v_prenex_21) .cse0) (<= (+ v_prenex_20 28) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_21)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_22 Int)) (and (= (store (store .cse2 v_subst_22 (select .cse3 v_subst_22)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (<= (+ 84 v_subst_22) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_subst_25 Int) (v_subst_21 Int)) (let ((.cse27 (select .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|))) (let ((.cse28 (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| .cse27) v_subst_21 (select .cse3 v_subst_21)) v_subst_25 (select .cse3 v_subst_25))) (.cse29 (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 56 v_subst_21) .cse0) (<= (+ v_subst_25 28) .cse0) (= .cse27 (select (store .cse28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse29 1)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 84) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_21)) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_25)) (not (= v_subst_25 v_subst_21)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_25)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_21)) (= (store .cse28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse29) .cse3))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_subst_23 Int)) (and (<= (+ v_subst_23 28) .cse0) (= (store (store .cse2 v_subst_23 (select .cse3 v_subst_23)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_5 Int)) (and (<= (+ 84 v_prenex_5) .cse0) (= (store (store .cse2 v_prenex_5 (select .cse3 v_prenex_5)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3)))))) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_subst_21 Int)) (and (= (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (select .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) v_subst_21 (select .cse3 v_subst_21)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_21)) (<= (+ v_subst_21 28) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_21)))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_4 Int)) (and (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_4)) (<= (+ 56 v_prenex_4) .cse0) (= (store (store .cse2 v_prenex_4 (select .cse3 v_prenex_4)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (= (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_2 Int)) (and (<= (+ 28 v_prenex_2) .cse0) (= (store (store .cse2 v_prenex_2 (select .cse3 v_prenex_2)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 56 v_subst_20) .cse0) (= (store (store .cse2 v_subst_20 (select .cse3 v_subst_20)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_3 Int)) (and (<= (+ 56 v_prenex_3) .cse0) (= (store (store .cse2 v_prenex_3 (select .cse3 v_prenex_3)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse3)))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_~#cache~0.base| 4))))) is different from false [2024-10-18 22:10:54,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| 4))) (and (not (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (= (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int)) (and (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0)))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (= .cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (= .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse3 (select .cse2 v_prenex_15)) (.cse7 (select .cse2 v_prenex_16))) (let ((.cse5 (store (store .cse1 v_prenex_15 .cse3) v_prenex_16 .cse7)) (.cse6 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse4 (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse6 1)))) (and (<= (+ 84 v_prenex_15) .cse0) (= .cse3 (select .cse4 v_prenex_15)) (= (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) .cse2) (not (= v_prenex_16 v_prenex_15)) (<= (+ 56 v_prenex_16) .cse0) (= (select .cse4 v_prenex_16) .cse7)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse9 (select .cse2 v_prenex_10)) (.cse10 (select .cse2 v_prenex_9))) (let ((.cse11 (store (store .cse1 v_prenex_10 .cse9) v_prenex_9 .cse10)) (.cse12 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse8 (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse12 1)))) (and (not (= v_prenex_10 v_prenex_9)) (<= (+ 56 v_prenex_10) .cse0) (= (select .cse8 v_prenex_10) .cse9) (= (select .cse8 v_prenex_9) .cse10) (= (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse12) .cse2) (<= (+ 28 v_prenex_9) .cse0)))))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_27 Int)) (and (<= (+ 84 v_subst_27) .cse0) (= (store (store .cse1 v_subst_27 (select .cse2 v_subst_27)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_11 Int)) (and (<= (+ 56 v_prenex_11) .cse0) (= (store (store .cse1 v_prenex_11 (select .cse2 v_prenex_11)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse15 (select .cse2 v_prenex_8))) (let ((.cse13 (store (store .cse1 v_prenex_7 (select .cse2 v_prenex_7)) v_prenex_8 .cse15)) (.cse14 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse14) .cse2) (not (= v_prenex_8 v_prenex_7)) (= (select (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse14 1)) v_prenex_8) .cse15) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_7)) (<= (+ 84 v_prenex_7) .cse0) (<= (+ 56 v_prenex_8) .cse0))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_3 Int)) (and (= (store (store .cse1 v_prenex_3 (select .cse2 v_prenex_3)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 v_prenex_3) .cse0))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (exists ((v_prenex_2 Int)) (and (<= (+ 84 v_prenex_2) .cse0) (= (store (store .cse1 v_prenex_2 (select .cse2 v_prenex_2)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_19 Int)) (and (= (store (store .cse1 v_prenex_19 (select .cse2 v_prenex_19)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 v_prenex_19) .cse0))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_4 Int) (v_subst_24 Int)) (let ((.cse18 (select .cse2 v_prenex_4))) (let ((.cse16 (store (store .cse1 v_prenex_4 .cse18) v_subst_24 (select .cse2 v_subst_24))) (.cse17 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_4) .cse0) (= (select (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse17 1)) v_prenex_4) .cse18) (<= (+ v_subst_24 28) .cse0) (not (= v_subst_24 v_prenex_4)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_24)) (= .cse2 (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse17)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_26 Int) (v_prenex_17 Int)) (let ((.cse21 (select .cse2 v_subst_26))) (let ((.cse19 (store (store .cse1 v_prenex_17 (select .cse2 v_prenex_17)) v_subst_26 .cse21)) (.cse20 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse20) .cse2) (<= (+ 56 v_prenex_17) .cse0) (not (= v_prenex_17 v_subst_26)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_17)) (<= (+ 84 v_subst_26) .cse0) (= .cse21 (select (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse20 1)) v_subst_26)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_18 Int)) (and (<= (+ 84 v_prenex_18) .cse0) (= (store (store .cse1 v_prenex_18 (select .cse2 v_prenex_18)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 84 v_subst_20) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_20)) (= (store (store .cse1 v_subst_20 (select .cse2 v_subst_20)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_12 Int)) (and (= (store (store .cse1 v_prenex_12 (select .cse2 v_prenex_12)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ v_prenex_12 28) .cse0))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_6 Int)) (and (<= (+ 56 v_prenex_6) .cse0) (= (store (store .cse1 v_prenex_6 (select .cse2 v_prenex_6)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= v_prenex_14 v_prenex_13)) (<= (+ 84 v_prenex_13) .cse0) (= (store (store (store .cse1 v_prenex_13 (select .cse2 v_prenex_13)) v_prenex_14 (select .cse2 v_prenex_14)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_14)) (<= (+ v_prenex_14 28) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_13)))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse24 (select .cse2 v_prenex_20))) (let ((.cse22 (store (store .cse1 v_prenex_21 (select .cse2 v_prenex_21)) v_prenex_20 .cse24)) (.cse23 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (= (store .cse22 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse23) .cse2) (not (= v_prenex_21 v_prenex_20)) (= (select (store .cse22 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse23 1)) v_prenex_20) .cse24) (<= (+ 84 v_prenex_21) .cse0) (<= (+ v_prenex_20 28) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_21)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_22 Int)) (and (= (store (store .cse1 v_subst_22 (select .cse2 v_subst_22)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 v_subst_22) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_subst_25 Int) (v_subst_21 Int)) (let ((.cse25 (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|))) (let ((.cse26 (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| .cse25) v_subst_21 (select .cse2 v_subst_21)) v_subst_25 (select .cse2 v_subst_25))) (.cse27 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 56 v_subst_21) .cse0) (<= (+ v_subst_25 28) .cse0) (= .cse25 (select (store .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse27 1)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 84) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_21)) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_25)) (not (= v_subst_25 v_subst_21)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_25)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_21)) (= (store .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse27) .cse2))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_subst_23 Int)) (and (<= (+ v_subst_23 28) .cse0) (= (store (store .cse1 v_subst_23 (select .cse2 v_subst_23)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_5 Int)) (and (<= (+ 84 v_prenex_5) .cse0) (= (store (store .cse1 v_prenex_5 (select .cse2 v_prenex_5)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2)))))) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_subst_21 Int)) (and (= (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|)) v_subst_21 (select .cse2 v_subst_21)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_subst_21)) (<= (+ v_subst_21 28) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) .cse0) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_21)))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_4 Int)) (and (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_4)) (<= (+ 56 v_prenex_4) .cse0) (= (store (store .cse1 v_prenex_4 (select .cse2 v_prenex_4)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (= (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_2 Int)) (and (<= (+ 28 v_prenex_2) .cse0) (= (store (store .cse1 v_prenex_2 (select .cse2 v_prenex_2)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 56 v_subst_20) .cse0) (= (store (store .cse1 v_subst_20 (select .cse2 v_subst_20)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) (exists ((v_prenex_3 Int)) (and (<= (+ 56 v_prenex_3) .cse0) (= (store (store .cse1 v_prenex_3 (select .cse2 v_prenex_3)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2)))))) (= |c_~#cache~0.base| 4))) is different from false Killed by 15