./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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity SYMBOLIC_RELATION -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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity SYMBOLIC_RELATION -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-17 08:18:28,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 08:18:28,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 08:18:28,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 08:18:28,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 08:18:28,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 08:18:28,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 08:18:28,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 08:18:28,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 08:18:28,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 08:18:28,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 08:18:28,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 08:18:28,579 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 08:18:28,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 08:18:28,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 08:18:28,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 08:18:28,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 08:18:28,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 08:18:28,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 08:18:28,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 08:18:28,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 08:18:28,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 08:18:28,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 08:18:28,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 08:18:28,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 08:18:28,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 08:18:28,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 08:18:28,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 08:18:28,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 08:18:28,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 08:18:28,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 08:18:28,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 08:18:28,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 08:18:28,587 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 08:18:28,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 08:18:28,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 08:18:28,588 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 08:18:28,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 08:18:28,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 08:18:28,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 08:18:28,589 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 08:18:28,590 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 -> COUNTEREXAMPLE 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: TraceCheck mode for conditional commutativity -> SYMBOLIC_RELATION [2024-10-17 08:18:28,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 08:18:28,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 08:18:28,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 08:18:28,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 08:18:28,908 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 08:18:28,909 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-17 08:18:30,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 08:18:30,579 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 08:18:30,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-10-17 08:18:30,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/00c0f511a/8ebd81e7d893416586baf7f73ff3233d/FLAGd8f0f0245 [2024-10-17 08:18:30,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/00c0f511a/8ebd81e7d893416586baf7f73ff3233d [2024-10-17 08:18:30,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 08:18:30,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 08:18:30,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 08:18:30,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 08:18:30,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 08:18:30,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:18:30" (1/1) ... [2024-10-17 08:18:30,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de862d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:30, skipping insertion in model container [2024-10-17 08:18:30,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 08:18:30" (1/1) ... [2024-10-17 08:18:30,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 08:18:31,121 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-17 08:18:31,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 08:18:31,182 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 08:18:31,227 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-17 08:18:31,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 08:18:31,309 INFO L204 MainTranslator]: Completed translation [2024-10-17 08:18:31,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31 WrapperNode [2024-10-17 08:18:31,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 08:18:31,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 08:18:31,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 08:18:31,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 08:18:31,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,377 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 285 [2024-10-17 08:18:31,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 08:18:31,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 08:18:31,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 08:18:31,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 08:18:31,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 08:18:31,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 08:18:31,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 08:18:31,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 08:18:31,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (1/1) ... [2024-10-17 08:18:31,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 08:18:31,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:18:31,472 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-17 08:18:31,474 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-17 08:18:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 08:18:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 08:18:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 08:18:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 08:18:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 08:18:31,535 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 08:18:31,687 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 08:18:31,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 08:18:32,022 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 08:18:32,023 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 08:18:32,197 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 08:18:32,198 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-17 08:18:32,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:18:32 BoogieIcfgContainer [2024-10-17 08:18:32,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 08:18:32,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 08:18:32,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 08:18:32,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 08:18:32,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 08:18:30" (1/3) ... [2024-10-17 08:18:32,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dcfaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:18:32, skipping insertion in model container [2024-10-17 08:18:32,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 08:18:31" (2/3) ... [2024-10-17 08:18:32,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dcfaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 08:18:32, skipping insertion in model container [2024-10-17 08:18:32,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 08:18:32" (3/3) ... [2024-10-17 08:18:32,208 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-10-17 08:18:32,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 08:18:32,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-17 08:18:32,225 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 08:18:32,272 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 08:18:32,320 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 08:18:32,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 08:18:32,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:18:32,324 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-17 08:18:32,326 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-17 08:18:32,428 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 08:18:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:18:32,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 08:18:32,455 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;@48e1514e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 08:18:32,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 08:18:33,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:18:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:18:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1084761360, now seen corresponding path program 1 times [2024-10-17 08:18:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:18:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351293189] [2024-10-17 08:18:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:18:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:33,307 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-17 08:18:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:18:33,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351293189] [2024-10-17 08:18:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351293189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 08:18:33,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 08:18:33,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 08:18:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112942112] [2024-10-17 08:18:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 08:18:33,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 08:18:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:18:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 08:18:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 08:18:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:33,340 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:18:33,341 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-17 08:18:33,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 08:18:33,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:18:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:18:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash -747723976, now seen corresponding path program 1 times [2024-10-17 08:18:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:18:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164014037] [2024-10-17 08:18:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:18:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:33,529 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-17 08:18:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:18:33,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164014037] [2024-10-17 08:18:33,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164014037] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:18:33,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776890447] [2024-10-17 08:18:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:33,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:18:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:18:33,553 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-17 08:18:33,555 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-17 08:18:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:33,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 08:18:33,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:18:33,688 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-17 08:18:33,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:18:33,709 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-17 08:18:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776890447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:18:33,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:18:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 08:18:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887484415] [2024-10-17 08:18:33,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:18:33,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 08:18:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:18:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 08:18:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 08:18:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:33,714 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:18:33,714 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-17 08:18:33,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:33,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:18:33,816 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-17 08:18:33,998 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-17 08:18:33,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:18:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:18:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1928047856, now seen corresponding path program 2 times [2024-10-17 08:18:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:18:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461562690] [2024-10-17 08:18:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:18:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:34,169 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-17 08:18:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:18:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461562690] [2024-10-17 08:18:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461562690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:18:34,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990834350] [2024-10-17 08:18:34,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 08:18:34,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:18:34,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:18:34,173 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-17 08:18:34,174 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-17 08:18:34,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 08:18:34,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 08:18:34,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 08:18:34,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:18:34,282 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-17 08:18:34,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:18:34,351 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-17 08:18:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990834350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:18:34,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:18:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 08:18:34,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265416155] [2024-10-17 08:18:34,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:18:34,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 08:18:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:18:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 08:18:34,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 08:18:34,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:34,356 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:18:34,357 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-17 08:18:34,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:34,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:18:34,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:18:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:18:34,477 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-17 08:18:34,660 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-17 08:18:34,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:18:34,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:18:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1241085968, now seen corresponding path program 3 times [2024-10-17 08:18:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:18:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826459231] [2024-10-17 08:18:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:18:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:35,030 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-17 08:18:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:18:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826459231] [2024-10-17 08:18:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826459231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:18:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23507094] [2024-10-17 08:18:35,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 08:18:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:18:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:18:35,033 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-17 08:18:35,035 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-17 08:18:35,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 08:18:35,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 08:18:35,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 08:18:35,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:18:35,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 08:18:35,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 08:18:35,258 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-17 08:18:35,297 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-17 08:18:35,365 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-17 08:18:35,409 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-17 08:18:35,431 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-17 08:18:35,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:18:41,508 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-17 08:18:41,532 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-17 08:18:41,645 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-17 08:18:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23507094] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:18:41,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:18:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 08:18:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692963016] [2024-10-17 08:18:41,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:18:41,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 08:18:41,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:18:41,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 08:18:41,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=122, Unknown=4, NotChecked=46, Total=210 [2024-10-17 08:18:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:41,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:18:41,648 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-17 08:18:41,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:41,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:18:41,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:18:41,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:18:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:18:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:18:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:18:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:18:41,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-17 08:18:42,029 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-17 08:18:42,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:18:42,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:18:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1875016076, now seen corresponding path program 1 times [2024-10-17 08:18:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:18:42,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563413196] [2024-10-17 08:18:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:42,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:18:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:43,928 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-17 08:18:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:18:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563413196] [2024-10-17 08:18:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563413196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:18:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3368867] [2024-10-17 08:18:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:18:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:18:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:18:43,934 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-17 08:18:43,935 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-17 08:18:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:18:44,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 08:18:44,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:18:44,062 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-17 08:18:44,150 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 08:18:44,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 08:18:44,182 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-17 08:18:44,252 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-17 08:18:44,309 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-17 08:18:44,363 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-17 08:18:44,481 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-17 08:18:44,510 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-17 08:18:44,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:18:58,657 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-17 08:19:00,734 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-17 08:19:00,870 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-17 08:19:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3368867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:19:00,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:19:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 26 [2024-10-17 08:19:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135536921] [2024-10-17 08:19:00,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:19:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-17 08:19:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:19:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-17 08:19:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=5, NotChecked=94, Total=702 [2024-10-17 08:19:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:19:00,872 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:19:00,873 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-17 08:19:00,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:19:00,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:19:00,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:19:00,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:19:00,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:19:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:19:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:19:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:19:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:19:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 08:19:02,993 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-17 08:19:03,181 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 [2024-10-17 08:19:03,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:19:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash -647405690, now seen corresponding path program 1 times [2024-10-17 08:19:03,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:19:03,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:19:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:19:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 08:19:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:19:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:19:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:19:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 08:19:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 08:19:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 08:19:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-17 08:19:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:19:04,044 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:19:04,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 08:19:04,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:19:04,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:19:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:19:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:19:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 08:19:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:19:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:19:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:19:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:19:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:19:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 08:19:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:19:04,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-17 08:19:04,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:19:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash 880250292, now seen corresponding path program 1 times [2024-10-17 08:19:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:19:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:19:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:19:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 08:19:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:19:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:19:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:19:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 08:19:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:19:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1675506796, now seen corresponding path program 2 times [2024-10-17 08:19:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:19:06,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549784783] [2024-10-17 08:19:06,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:19:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:19:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:19:08,110 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-17 08:19:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:19:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549784783] [2024-10-17 08:19:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549784783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:19:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896670704] [2024-10-17 08:19:08,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 08:19:08,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:19:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:19:08,114 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-17 08:19:08,115 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-17 08:19:08,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 08:19:08,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 08:19:08,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-17 08:19:08,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:19:08,266 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-17 08:19:08,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 08:19:08,339 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-17 08:19:08,361 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-17 08:19:08,494 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-17 08:19:08,572 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-17 08:19:11,113 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-17 08:19:13,979 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 63 treesize of output 50 [2024-10-17 08:19:17,133 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-17 08:19:32,874 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-17 08:19:32,914 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-17 08:19:32,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:19:58,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |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_34|) 0))) is different from false [2024-10-17 08:20:00,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_34|) 0))) is different from false [2024-10-17 08:20:02,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |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_566))) (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_34|) 0))) is different from false [2024-10-17 08:20:02,902 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |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_564)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |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_34|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 08:20:02,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ .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_36| v_ArrVal_564)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)))) is different from false [2024-10-17 08:20:02,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (forall ((v_ArrVal_564 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ .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_36| v_ArrVal_564)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)))) (< |v_t_funThread1of1ForFork0_~i~0#1_25| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 08:20:05,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) (< |v_t_funThread1of1ForFork0_~i~0#1_25| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (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_36| v_ArrVal_564))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0)))) is different from false [2024-10-17 08:20:07,262 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 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_562 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| v_ArrVal_564))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ .cse1 28 |c_~#cache~0.offset|)) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) (< |v_t_funThread1of1ForFork0_~i~0#1_25| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 08:20:09,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|)) (= (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_38| (+ v_ArrVal_562 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| v_ArrVal_564)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| 28)))) is different from false [2024-10-17 08:20:11,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (v_ArrVal_560 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int) (v_ArrVal_566 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|)) (= (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_560) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_562 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| v_ArrVal_564)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_566) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| 28)))) is different from false [2024-10-17 08:20:11,726 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-17 08:20:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896670704] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:20:11,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:20:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2024-10-17 08:20:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109838025] [2024-10-17 08:20:11,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:20:11,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-17 08:20:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:20:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-17 08:20:11,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=647, Unknown=35, NotChecked=630, Total=1482 [2024-10-17 08:20:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:20:11,729 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:20:11,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.205128205128205) internal successors, (164), 38 states have internal predecessors, (164), 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-17 08:20:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:20:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:20:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:20:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:20:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 08:20:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:20:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:20:13,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:20:16,403 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-17 08:20:19,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:20:20,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:20:22,601 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-17 08:20:36,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:20:37,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:20:38,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:20:51,490 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-17 08:20:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:20:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:20:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:20:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:20:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 08:20:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:20:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 08:20:53,211 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-17 08:20:53,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-17 08:20:53,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 08:20:53,468 INFO L85 PathProgramCache]: Analyzing trace with hash 175644563, now seen corresponding path program 1 times [2024-10-17 08:20:53,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:20:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:20:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:20:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 08:20:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:20:57,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:20:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:21:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 08:21:00,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 08:21:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1862131292, now seen corresponding path program 3 times [2024-10-17 08:21:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 08:21:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678322053] [2024-10-17 08:21:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 08:21:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 08:21:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 08:21:17,757 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-17 08:21:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 08:21:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678322053] [2024-10-17 08:21:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678322053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 08:21:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753296066] [2024-10-17 08:21:17,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 08:21:17,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 08:21:17,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 08:21:17,759 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-17 08:21:17,761 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-17 08:21:18,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-17 08:21:18,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 08:21:18,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 08:21:18,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 08:21:18,385 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-17 08:21:18,552 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-17 08:21:18,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-17 08:21:18,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 08:21:18,823 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-17 08:21:18,962 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-17 08:21:22,709 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-17 08:21:26,719 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-17 08:21:46,272 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-17 08:21:55,392 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 238 treesize of output 197 [2024-10-17 08:22:38,613 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 296 treesize of output 249 [2024-10-17 08:23:06,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1300 treesize of output 1095 [2024-10-17 08:23:32,366 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 1309 treesize of output 1102 [2024-10-17 08:26:34,376 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 1507 treesize of output 1211 [2024-10-17 08:26:37,751 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-17 08:26:37,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 08:27:13,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |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_63|) 0))) is different from false [2024-10-17 08:27:15,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_63|) 0))) is different from false [2024-10-17 08:27:17,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |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_941))) (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_63|) 0))) is different from false [2024-10-17 08:27:17,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |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_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |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_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 08:27:17,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 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_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2024-10-17 08:27:17,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 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_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0))))))) is different from false [2024-10-17 08:27:20,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (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_65| v_ArrVal_940))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 08:27:22,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_936 Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (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_936 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 08:27:24,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_936 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (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_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 08:27:26,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_936 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (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_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse1)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 08:27:28,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_936 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse2 (+ |c_~#cache~0.offset| .cse3))) (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 (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse3)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 08:27:30,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_936 Int) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (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_934 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse2)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 08:27:32,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_936 Int) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (= (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_69| (+ v_ArrVal_934 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse1)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 08:27:35,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_936 Int) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_69| (+ v_ArrVal_934 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse1)))))) is different from false [2024-10-17 08:27:37,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_936 Int) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse3))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (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_69| (+ v_ArrVal_934 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse3)))))) is different from false [2024-10-17 08:27:39,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_936 Int) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int) (v_ArrVal_930 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse2))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_930 (- 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_69| (+ v_ArrVal_934 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse2)))))) is different from false [2024-10-17 08:27:41,904 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_936 Int) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_930 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (= (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_71| (+ v_ArrVal_930 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ v_ArrVal_934 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2024-10-17 08:27:44,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (v_ArrVal_941 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_936 Int) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_934 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_930 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (= (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_929) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_930 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ v_ArrVal_934 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_936 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_940)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_941) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0))) is different from false [2024-10-17 08:27:46,248 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-17 08:27:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753296066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 08:27:46,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 08:27:46,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 63 [2024-10-17 08:27:46,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113968428] [2024-10-17 08:27:46,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 08:27:46,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-17 08:27:46,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 08:27:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-17 08:27:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1644, Unknown=126, NotChecked=1890, Total=4032 [2024-10-17 08:27:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:27:46,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 08:27:46,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.453125) internal successors, (285), 63 states have internal predecessors, (285), 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-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 08:27:46,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 08:27:49,563 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-17 08:27:51,581 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-17 08:27:53,585 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-17 08:27:55,596 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-17 08:27:57,612 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-17 08:28:10,899 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-17 08:28:12,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-17 08:28:14,982 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-17 08:28:17,024 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-17 08:28:19,041 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-17 08:28:21,061 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-17 08:28:23,083 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-17 08:28:43,350 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-17 08:28:45,366 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-17 08:28:47,385 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-17 08:28:49,388 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-17 08:28:51,396 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-17 08:28:53,402 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-17 08:28:55,417 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-17 08:29:03,642 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-17 08:29:05,659 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-17 08:29:07,674 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-17 08:29:09,678 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-17 08:29:11,684 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-17 08:29:13,689 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-17 08:29:15,703 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-17 08:29:31,176 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-17 08:29:33,816 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-17 08:29:35,843 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-17 08:29:56,234 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-17 08:29:58,260 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-17 08:30:00,492 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-17 08:30:02,504 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-17 08:30:04,521 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-17 08:30:06,531 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-17 08:30:32,469 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-17 08:30:53,465 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-17 08:30:55,477 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-17 08:30:57,494 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-17 08:30:59,511 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-17 08:31:01,526 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-17 08:31:03,542 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-17 08:31:05,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:31:18,694 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-17 08:31:20,751 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-17 08:31:22,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 08:31:25,031 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-17 08:31:27,218 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-17 08:31:29,277 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-17 08:31:31,303 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-17 08:31:33,324 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-17 08:31:35,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| 4))) (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse44 (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse3 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse44) .cse2)) (.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|) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#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_41| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| 28) .cse0) (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) |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)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse3 (= .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 ((.cse4 (select .cse2 v_prenex_15)) (.cse8 (select .cse2 v_prenex_16))) (let ((.cse6 (store (store .cse1 v_prenex_15 .cse4) v_prenex_16 .cse8)) (.cse7 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse5 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse7 1)))) (and (<= (+ 56 v_prenex_15) .cse0) (= .cse4 (select .cse5 v_prenex_15)) (= (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse7) .cse2) (not (= v_prenex_16 v_prenex_15)) (= (select .cse5 v_prenex_16) .cse8) (<= (+ 84 v_prenex_16) .cse0)))))) (<= |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) (v_prenex_17 Int)) (let ((.cse11 (select .cse2 v_prenex_17)) (.cse9 (select .cse2 v_prenex_18))) (let ((.cse12 (store (store .cse1 v_prenex_17 .cse11) v_prenex_18 .cse9)) (.cse13 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse10 (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse13 1)))) (and (<= (+ 56 v_prenex_18) .cse0) (= .cse9 (select .cse10 v_prenex_18)) (= .cse11 (select .cse10 v_prenex_17)) (not (= v_prenex_18 v_prenex_17)) (<= (+ 84 v_prenex_17) .cse0) (= (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse13) .cse2)))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_16 Int)) (and (<= (+ 84 v_subst_16) .cse0) (= (store (store .cse1 v_subst_16 (select .cse2 v_subst_16)) |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_subst_14 Int)) (and (<= (+ 84 v_subst_14) .cse0) (= (store (store .cse1 v_subst_14 (select .cse2 v_subst_14)) |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_7 Int)) (and (= (store (store .cse1 v_prenex_7 (select .cse2 v_prenex_7)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 28 v_prenex_7) .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_17 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse14 (select .cse2 v_subst_17))) (let ((.cse15 (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) v_subst_17 .cse14)) (.cse16 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| v_subst_17)) (<= (+ v_subst_17 28) .cse0) (= .cse14 (select (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse16 1)) v_subst_17)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| 84) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse16) .cse2))))) (<= |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_prenex_2 Int)) (let ((.cse17 (select .cse2 v_prenex_2))) (let ((.cse18 (store (store .cse1 v_prenex_2 .cse17) v_prenex_4 (select .cse2 v_prenex_4))) (.cse19 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_2) .cse0) (<= (+ 28 v_prenex_4) .cse0) (not (= v_prenex_4 v_prenex_2)) (= .cse17 (select (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse19 1)) v_prenex_2)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_4)) (= (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse19) .cse2))))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_5 Int)) (and (<= (+ 56 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))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse24 (select .cse2 v_prenex_8)) (.cse21 (select .cse2 v_prenex_9))) (let ((.cse22 (store (store .cse1 v_prenex_8 .cse24) v_prenex_9 .cse21)) (.cse23 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse20 (store .cse22 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse23 1)))) (and (= (select .cse20 v_prenex_9) .cse21) (<= (+ 56 v_prenex_9) .cse0) (not (= v_prenex_9 v_prenex_8)) (= (store .cse22 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse23) .cse2) (= .cse24 (select .cse20 v_prenex_8)) (<= (+ 84 v_prenex_8) .cse0)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .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 (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_13 Int)) (and (= (store (store .cse1 v_prenex_13 (select .cse2 v_prenex_13)) |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_13)) (<= (+ v_prenex_13 28) .cse0))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_13 Int)) (and (<= (+ 56 v_subst_13) .cse0) (= (store (store .cse1 v_subst_13 (select .cse2 v_subst_13)) |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_20 Int) (v_prenex_19 Int)) (let ((.cse27 (select .cse2 v_prenex_20))) (let ((.cse25 (store (store .cse1 v_prenex_19 (select .cse2 v_prenex_19)) v_prenex_20 .cse27)) (.cse26 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_19) .cse0) (= (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse26) .cse2) (<= (+ v_prenex_20 28) .cse0) (= .cse27 (select (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse26 1)) v_prenex_20)) (not (= v_prenex_19 v_prenex_20)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_19)))))) (<= |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_6 Int)) (and (<= (+ 84 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))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse32 (select .cse2 v_prenex_11)) (.cse31 (select .cse2 v_prenex_10))) (let ((.cse28 (store (store (store .cse1 v_prenex_11 .cse32) v_prenex_12 (select .cse2 v_prenex_12)) v_prenex_10 .cse31)) (.cse29 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse30 (store .cse28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse29 1)))) (and (not (= v_prenex_12 v_prenex_11)) (<= (+ 84 v_prenex_11) .cse0) (= .cse2 (store .cse28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse29)) (not (= v_prenex_12 v_prenex_10)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_12)) (not (= v_prenex_11 v_prenex_10)) (= (select .cse30 v_prenex_10) .cse31) (= (select .cse30 v_prenex_11) .cse32) (<= (+ v_prenex_10 28) .cse0) (<= (+ 56 v_prenex_12) .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) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_18 Int)) (and (= (store (store .cse1 v_subst_18 (select .cse2 v_subst_18)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 v_subst_18) .cse0))) (<= |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_15 Int) (v_DerPreprocessor_34 Int) (v_prenex_1 Int)) (let ((.cse35 (select .cse2 v_prenex_1)) (.cse38 (select .cse2 v_subst_15))) (let ((.cse33 (store (store .cse1 v_prenex_1 .cse35) v_subst_15 .cse38)) (.cse34 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse41 (store .cse33 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse34 1)))) (let ((.cse36 (select .cse41 v_prenex_1)) (.cse37 (select .cse41 v_subst_15))) (and (= (store .cse33 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse34) .cse2) (= .cse35 .cse36) (<= (+ 56 v_prenex_1) .cse0) (<= (+ v_subst_15 28) .cse0) (= .cse37 .cse38) (let ((.cse40 (store (store (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_DerPreprocessor_34) v_prenex_1 .cse36) v_subst_15 .cse37))) (let ((.cse39 (select .cse40 v_prenex_1))) (= .cse39 (select (store (store (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse40 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) v_prenex_1 .cse39) v_subst_15 (+ .cse37 1)) v_prenex_1)))))))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_14 Int)) (and (= (store (store .cse1 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) (<= (+ 84 v_prenex_14) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 84 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))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_19 Int)) (and (<= (+ 84 v_subst_19) .cse0) (= (store (store .cse1 v_subst_19 (select .cse2 v_subst_19)) |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)))) (let ((.cse43 (<= (+ 56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0)) (.cse42 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) .cse0) (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse44) .cse2))))) (or (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse0) .cse42) (and .cse43 (exists ((v_subst_13 Int)) (and (<= (+ v_subst_13 28) .cse0) (= (store (store .cse1 v_subst_13 (select .cse2 v_subst_13)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse44) .cse2)))) (and .cse43 .cse3) (exists ((v_subst_14 Int)) (and (= (store (store .cse1 v_subst_14 (select .cse2 v_subst_14)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse44) .cse2) (<= (+ 56 v_subst_14) .cse0))) (exists ((v_subst_13 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (and (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_subst_13)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| v_subst_13)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) (= (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) v_subst_13 (select .cse2 v_subst_13)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse44) .cse2) (<= (+ v_subst_13 28) .cse0))) .cse42)) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_~#cache~0.base| 4))))) is different from false [2024-10-17 08:31:37,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| 4)) (.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|) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#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_41| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| 28) .cse0) (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) |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)))) (or (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 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (select .cse2 v_prenex_1))) (let ((.cse3 (store (store .cse1 v_prenex_2 (select .cse2 v_prenex_2)) v_prenex_1 .cse5)) (.cse4 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_2)) (<= (+ 56 v_prenex_2) .cse0) (= (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4) .cse2) (not (= v_prenex_2 v_prenex_1)) (<= (+ 28 v_prenex_1) .cse0) (= .cse5 (select (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse4 1)) v_prenex_1)))))) (<= |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_41| Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) .cse0) (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) |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_41| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (<= |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))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_14 Int)) (and (<= (+ 56 v_subst_14) .cse0) (= (store (store .cse1 v_subst_14 (select .cse2 v_subst_14)) |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) (exists ((v_subst_13 Int)) (and (<= (+ v_subst_13 28) .cse0) (= (store (store .cse1 v_subst_13 (select .cse2 v_subst_13)) |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 (= (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))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= .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 ((.cse6 (select .cse2 v_prenex_15)) (.cse10 (select .cse2 v_prenex_16))) (let ((.cse8 (store (store .cse1 v_prenex_15 .cse6) v_prenex_16 .cse10)) (.cse9 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse7 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse9 1)))) (and (<= (+ 56 v_prenex_15) .cse0) (= .cse6 (select .cse7 v_prenex_15)) (= (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) .cse2) (not (= v_prenex_16 v_prenex_15)) (= (select .cse7 v_prenex_16) .cse10) (<= (+ 84 v_prenex_16) .cse0)))))) (<= |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) (v_prenex_17 Int)) (let ((.cse13 (select .cse2 v_prenex_17)) (.cse11 (select .cse2 v_prenex_18))) (let ((.cse14 (store (store .cse1 v_prenex_17 .cse13) v_prenex_18 .cse11)) (.cse15 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse12 (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse15 1)))) (and (<= (+ 56 v_prenex_18) .cse0) (= .cse11 (select .cse12 v_prenex_18)) (= .cse13 (select .cse12 v_prenex_17)) (not (= v_prenex_18 v_prenex_17)) (<= (+ 84 v_prenex_17) .cse0) (= (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse15) .cse2)))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_16 Int)) (and (<= (+ 84 v_subst_16) .cse0) (= (store (store .cse1 v_subst_16 (select .cse2 v_subst_16)) |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_subst_14 Int)) (and (<= (+ 84 v_subst_14) .cse0) (= (store (store .cse1 v_subst_14 (select .cse2 v_subst_14)) |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_7 Int)) (and (= (store (store .cse1 v_prenex_7 (select .cse2 v_prenex_7)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 28 v_prenex_7) .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_17 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse16 (select .cse2 v_subst_17))) (let ((.cse17 (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) v_subst_17 .cse16)) (.cse18 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| v_subst_17)) (<= (+ v_subst_17 28) .cse0) (= .cse16 (select (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse18 1)) v_subst_17)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| 84) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse18) .cse2))))) (<= |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_prenex_2 Int)) (let ((.cse19 (select .cse2 v_prenex_2))) (let ((.cse20 (store (store .cse1 v_prenex_2 .cse19) v_prenex_4 (select .cse2 v_prenex_4))) (.cse21 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_2) .cse0) (<= (+ 28 v_prenex_4) .cse0) (not (= v_prenex_4 v_prenex_2)) (= .cse19 (select (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse21 1)) v_prenex_2)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_4)) (= (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse21) .cse2))))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_5 Int)) (and (<= (+ 56 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))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (select .cse2 v_prenex_8)) (.cse23 (select .cse2 v_prenex_9))) (let ((.cse24 (store (store .cse1 v_prenex_8 .cse26) v_prenex_9 .cse23)) (.cse25 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse22 (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse25 1)))) (and (= (select .cse22 v_prenex_9) .cse23) (<= (+ 56 v_prenex_9) .cse0) (not (= v_prenex_9 v_prenex_8)) (= (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse25) .cse2) (= .cse26 (select .cse22 v_prenex_8)) (<= (+ 84 v_prenex_8) .cse0)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .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 (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_13 Int)) (and (= (store (store .cse1 v_prenex_13 (select .cse2 v_prenex_13)) |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_13)) (<= (+ v_prenex_13 28) .cse0))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_13 Int)) (and (<= (+ 56 v_subst_13) .cse0) (= (store (store .cse1 v_subst_13 (select .cse2 v_subst_13)) |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_20 Int) (v_prenex_19 Int)) (let ((.cse29 (select .cse2 v_prenex_20))) (let ((.cse27 (store (store .cse1 v_prenex_19 (select .cse2 v_prenex_19)) v_prenex_20 .cse29)) (.cse28 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_19) .cse0) (= (store .cse27 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse28) .cse2) (<= (+ v_prenex_20 28) .cse0) (= .cse29 (select (store .cse27 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse28 1)) v_prenex_20)) (not (= v_prenex_19 v_prenex_20)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_19)))))) (<= |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_6 Int)) (and (<= (+ 84 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))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse34 (select .cse2 v_prenex_11)) (.cse33 (select .cse2 v_prenex_10))) (let ((.cse30 (store (store (store .cse1 v_prenex_11 .cse34) v_prenex_12 (select .cse2 v_prenex_12)) v_prenex_10 .cse33)) (.cse31 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse32 (store .cse30 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse31 1)))) (and (not (= v_prenex_12 v_prenex_11)) (<= (+ 84 v_prenex_11) .cse0) (= .cse2 (store .cse30 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse31)) (not (= v_prenex_12 v_prenex_10)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_12)) (not (= v_prenex_11 v_prenex_10)) (= (select .cse32 v_prenex_10) .cse33) (= (select .cse32 v_prenex_11) .cse34) (<= (+ v_prenex_10 28) .cse0) (<= (+ 56 v_prenex_12) .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) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_18 Int)) (and (= (store (store .cse1 v_subst_18 (select .cse2 v_subst_18)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 v_subst_18) .cse0))) (<= |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_15 Int) (v_DerPreprocessor_34 Int) (v_prenex_1 Int)) (let ((.cse37 (select .cse2 v_prenex_1)) (.cse40 (select .cse2 v_subst_15))) (let ((.cse35 (store (store .cse1 v_prenex_1 .cse37) v_subst_15 .cse40)) (.cse36 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse43 (store .cse35 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse36 1)))) (let ((.cse38 (select .cse43 v_prenex_1)) (.cse39 (select .cse43 v_subst_15))) (and (= (store .cse35 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse36) .cse2) (= .cse37 .cse38) (<= (+ 56 v_prenex_1) .cse0) (<= (+ v_subst_15 28) .cse0) (= .cse39 .cse40) (let ((.cse42 (store (store (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_DerPreprocessor_34) v_prenex_1 .cse38) v_subst_15 .cse39))) (let ((.cse41 (select .cse42 v_prenex_1))) (= .cse41 (select (store (store (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse42 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) v_prenex_1 .cse41) v_subst_15 (+ .cse39 1)) v_prenex_1)))))))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_14 Int)) (and (= (store (store .cse1 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) (<= (+ 84 v_prenex_14) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 84 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))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_19 Int)) (and (<= (+ 84 v_subst_19) .cse0) (= (store (store .cse1 v_subst_19 (select .cse2 v_subst_19)) |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)))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (= |c_~#cache~0.base| 4))) is different from false [2024-10-17 08:31:39,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| 4)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#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_41| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| 28) .cse0) (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) |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)))) (or (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 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse5 (select .cse2 v_prenex_1))) (let ((.cse3 (store (store .cse1 v_prenex_2 (select .cse2 v_prenex_2)) v_prenex_1 .cse5)) (.cse4 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_2)) (<= (+ 56 v_prenex_2) .cse0) (= (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4) .cse2) (not (= v_prenex_2 v_prenex_1)) (<= (+ 28 v_prenex_1) .cse0) (= .cse5 (select (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse4 1)) v_prenex_1)))))) (<= |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_41| Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) .cse0) (= (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) |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_41| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (<= |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))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_14 Int)) (and (<= (+ 56 v_subst_14) .cse0) (= (store (store .cse1 v_subst_14 (select .cse2 v_subst_14)) |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) (exists ((v_subst_13 Int)) (and (<= (+ v_subst_13 28) .cse0) (= (store (store .cse1 v_subst_13 (select .cse2 v_subst_13)) |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 (= (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))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse6 (select .cse2 v_prenex_15)) (.cse10 (select .cse2 v_prenex_16))) (let ((.cse8 (store (store .cse1 v_prenex_15 .cse6) v_prenex_16 .cse10)) (.cse9 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse7 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse9 1)))) (and (<= (+ 56 v_prenex_15) .cse0) (= .cse6 (select .cse7 v_prenex_15)) (= (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) .cse2) (not (= v_prenex_16 v_prenex_15)) (= (select .cse7 v_prenex_16) .cse10) (<= (+ 84 v_prenex_16) .cse0)))))) (<= |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) (v_prenex_17 Int)) (let ((.cse13 (select .cse2 v_prenex_17)) (.cse11 (select .cse2 v_prenex_18))) (let ((.cse14 (store (store .cse1 v_prenex_17 .cse13) v_prenex_18 .cse11)) (.cse15 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse12 (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse15 1)))) (and (<= (+ 56 v_prenex_18) .cse0) (= .cse11 (select .cse12 v_prenex_18)) (= .cse13 (select .cse12 v_prenex_17)) (not (= v_prenex_18 v_prenex_17)) (<= (+ 84 v_prenex_17) .cse0) (= (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse15) .cse2)))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_16 Int)) (and (<= (+ 84 v_subst_16) .cse0) (= (store (store .cse1 v_subst_16 (select .cse2 v_subst_16)) |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_subst_14 Int)) (and (<= (+ 84 v_subst_14) .cse0) (= (store (store .cse1 v_subst_14 (select .cse2 v_subst_14)) |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_7 Int)) (and (= (store (store .cse1 v_prenex_7 (select .cse2 v_prenex_7)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 28 v_prenex_7) .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_17 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse16 (select .cse2 v_subst_17))) (let ((.cse17 (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|)) v_subst_17 .cse16)) (.cse18 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| v_subst_17)) (<= (+ v_subst_17 28) .cse0) (= .cse16 (select (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse18 1)) v_subst_17)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| 84) .cse0) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse18) .cse2))))) (<= |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_prenex_2 Int)) (let ((.cse19 (select .cse2 v_prenex_2))) (let ((.cse20 (store (store .cse1 v_prenex_2 .cse19) v_prenex_4 (select .cse2 v_prenex_4))) (.cse21 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_2) .cse0) (<= (+ 28 v_prenex_4) .cse0) (not (= v_prenex_4 v_prenex_2)) (= .cse19 (select (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse21 1)) v_prenex_2)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_4)) (= (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse21) .cse2))))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_5 Int)) (and (<= (+ 56 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))) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (select .cse2 v_prenex_8)) (.cse23 (select .cse2 v_prenex_9))) (let ((.cse24 (store (store .cse1 v_prenex_8 .cse26) v_prenex_9 .cse23)) (.cse25 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse22 (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse25 1)))) (and (= (select .cse22 v_prenex_9) .cse23) (<= (+ 56 v_prenex_9) .cse0) (not (= v_prenex_9 v_prenex_8)) (= (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse25) .cse2) (= .cse26 (select .cse22 v_prenex_8)) (<= (+ 84 v_prenex_8) .cse0)))))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .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 (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0) (exists ((v_prenex_13 Int)) (and (= (store (store .cse1 v_prenex_13 (select .cse2 v_prenex_13)) |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_13)) (<= (+ v_prenex_13 28) .cse0))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_13 Int)) (and (<= (+ 56 v_subst_13) .cse0) (= (store (store .cse1 v_subst_13 (select .cse2 v_subst_13)) |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_20 Int) (v_prenex_19 Int)) (let ((.cse29 (select .cse2 v_prenex_20))) (let ((.cse27 (store (store .cse1 v_prenex_19 (select .cse2 v_prenex_19)) v_prenex_20 .cse29)) (.cse28 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ 84 v_prenex_19) .cse0) (= (store .cse27 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse28) .cse2) (<= (+ v_prenex_20 28) .cse0) (= .cse29 (select (store .cse27 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse28 1)) v_prenex_20)) (not (= v_prenex_19 v_prenex_20)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_19)))))) (<= |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_6 Int)) (and (<= (+ 84 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))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse34 (select .cse2 v_prenex_11)) (.cse33 (select .cse2 v_prenex_10))) (let ((.cse30 (store (store (store .cse1 v_prenex_11 .cse34) v_prenex_12 (select .cse2 v_prenex_12)) v_prenex_10 .cse33)) (.cse31 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse32 (store .cse30 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse31 1)))) (and (not (= v_prenex_12 v_prenex_11)) (<= (+ 84 v_prenex_11) .cse0) (= .cse2 (store .cse30 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse31)) (not (= v_prenex_12 v_prenex_10)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_prenex_12)) (not (= v_prenex_11 v_prenex_10)) (= (select .cse32 v_prenex_10) .cse33) (= (select .cse32 v_prenex_11) .cse34) (<= (+ v_prenex_10 28) .cse0) (<= (+ 56 v_prenex_12) .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) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_18 Int)) (and (= (store (store .cse1 v_subst_18 (select .cse2 v_subst_18)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse2) (<= (+ 84 v_subst_18) .cse0))) (<= |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_15 Int) (v_DerPreprocessor_34 Int) (v_prenex_1 Int)) (let ((.cse37 (select .cse2 v_prenex_1)) (.cse40 (select .cse2 v_subst_15))) (let ((.cse35 (store (store .cse1 v_prenex_1 .cse37) v_subst_15 .cse40)) (.cse36 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse43 (store .cse35 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse36 1)))) (let ((.cse38 (select .cse43 v_prenex_1)) (.cse39 (select .cse43 v_subst_15))) (and (= (store .cse35 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse36) .cse2) (= .cse37 .cse38) (<= (+ 56 v_prenex_1) .cse0) (<= (+ v_subst_15 28) .cse0) (= .cse39 .cse40) (let ((.cse42 (store (store (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_DerPreprocessor_34) v_prenex_1 .cse38) v_subst_15 .cse39))) (let ((.cse41 (select .cse42 v_prenex_1))) (= .cse41 (select (store (store (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse42 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) v_prenex_1 .cse41) v_subst_15 (+ .cse39 1)) v_prenex_1)))))))))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_prenex_14 Int)) (and (= (store (store .cse1 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) (<= (+ 84 v_prenex_14) .cse0))) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_20 Int)) (and (<= (+ 84 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))) (<= (+ 56 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse0))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (exists ((v_subst_19 Int)) (and (<= (+ 84 v_subst_19) .cse0) (= (store (store .cse1 v_subst_19 (select .cse2 v_subst_19)) |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)))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (= |c_~#cache~0.base| 4))) is different from false Killed by 15