./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 08:39:06,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 08:39:06,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 08:39:06,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 08:39:06,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 08:39:06,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 08:39:06,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 08:39:06,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 08:39:06,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 08:39:06,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 08:39:06,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 08:39:06,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 08:39:06,813 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 08:39:06,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 08:39:06,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 08:39:06,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 08:39:06,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 08:39:06,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 08:39:06,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 08:39:06,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 08:39:06,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 08:39:06,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 08:39:06,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 08:39:06,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 08:39:06,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 08:39:06,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 08:39:06,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 08:39:06,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 08:39:06,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 08:39:06,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 08:39:06,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:39:06,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 08:39:06,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 08:39:06,819 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 08:39:06,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 08:39:06,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 08:39:06,819 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 08:39:06,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 08:39:06,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 08:39:06,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 08:39:06,826 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 08:39:06,826 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 08:39:07,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 08:39:07,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 08:39:07,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 08:39:07,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 08:39:07,071 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 08:39:07,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-19 08:39:08,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 08:39:08,510 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 08:39:08,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-19 08:39:08,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a34f600fd/a7af4c35a6e7434081d14636add412e3/FLAG7b011ef9e [2024-10-19 08:39:08,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a34f600fd/a7af4c35a6e7434081d14636add412e3 [2024-10-19 08:39:08,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 08:39:08,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 08:39:08,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 08:39:08,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 08:39:08,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 08:39:08,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:39:08" (1/1) ... [2024-10-19 08:39:08,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c522e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:08, skipping insertion in model container [2024-10-19 08:39:08,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:39:08" (1/1) ... [2024-10-19 08:39:08,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 08:39:09,021 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_70-funloop_racefree.i[41323,41336] [2024-10-19 08:39:09,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:39:09,075 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 08:39:09,114 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_70-funloop_racefree.i[41323,41336] [2024-10-19 08:39:09,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:39:09,186 INFO L204 MainTranslator]: Completed translation [2024-10-19 08:39:09,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09 WrapperNode [2024-10-19 08:39:09,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 08:39:09,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 08:39:09,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 08:39:09,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 08:39:09,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,242 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 218 [2024-10-19 08:39:09,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 08:39:09,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 08:39:09,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 08:39:09,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 08:39:09,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 08:39:09,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 08:39:09,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 08:39:09,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 08:39:09,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (1/1) ... [2024-10-19 08:39:09,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:39:09,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:09,318 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-19 08:39:09,322 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-19 08:39:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 08:39:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 08:39:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 08:39:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 08:39:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 08:39:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 08:39:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 08:39:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-19 08:39:09,363 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-19 08:39:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 08:39:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 08:39:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 08:39:09,366 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 08:39:09,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 08:39:09,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 08:39:09,775 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 08:39:09,775 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 08:39:09,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 08:39:09,978 INFO L314 CfgBuilder]: Removed 25 assume(true) statements. [2024-10-19 08:39:09,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:39:09 BoogieIcfgContainer [2024-10-19 08:39:09,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 08:39:09,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 08:39:09,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 08:39:09,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 08:39:09,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 08:39:08" (1/3) ... [2024-10-19 08:39:09,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae5dbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:39:09, skipping insertion in model container [2024-10-19 08:39:09,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:39:09" (2/3) ... [2024-10-19 08:39:09,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae5dbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:39:09, skipping insertion in model container [2024-10-19 08:39:09,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:39:09" (3/3) ... [2024-10-19 08:39:09,988 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-10-19 08:39:10,002 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 08:39:10,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 08:39:10,003 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 08:39:10,050 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-19 08:39:10,094 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:39:10,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:39:10,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:10,097 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-19 08:39:10,098 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-19 08:39:10,194 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:39:10,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:10,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-19 08:39:10,235 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;@a526951, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:39:10,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:39:10,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:39:10,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1853550032, now seen corresponding path program 1 times [2024-10-19 08:39:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:39:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686048592] [2024-10-19 08:39:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:10,904 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-19 08:39:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:39:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686048592] [2024-10-19 08:39:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686048592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:39:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:39:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:39:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981179285] [2024-10-19 08:39:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:39:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 08:39:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:39:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:39:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:39:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:10,937 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:39:10,938 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-19 08:39:10,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:10,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 08:39:10,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:39:10,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1805902569, now seen corresponding path program 1 times [2024-10-19 08:39:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:39:10,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019134508] [2024-10-19 08:39:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:11,122 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-19 08:39:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:39:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019134508] [2024-10-19 08:39:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019134508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:39:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751866860] [2024-10-19 08:39:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:39:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:11,136 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-19 08:39:11,137 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-19 08:39:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:11,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-19 08:39:11,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:39:11,243 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-19 08:39:11,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:39:11,262 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-19 08:39:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751866860] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:39:11,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:39:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-19 08:39:11,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829877027] [2024-10-19 08:39:11,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:39:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 08:39:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:39:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 08:39:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-19 08:39:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:11,266 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:39:11,266 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-19 08:39:11,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:11,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:11,344 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-19 08:39:11,530 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-19 08:39:11,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:39:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash -342103024, now seen corresponding path program 2 times [2024-10-19 08:39:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:39:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959092379] [2024-10-19 08:39:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:11,714 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-19 08:39:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:39:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959092379] [2024-10-19 08:39:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959092379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:39:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613016422] [2024-10-19 08:39:11,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 08:39:11,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:39:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:11,720 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-19 08:39:11,730 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-19 08:39:11,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 08:39:11,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:39:11,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-19 08:39:11,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:39:11,874 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-19 08:39:11,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:39:11,932 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-19 08:39:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613016422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:39:11,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:39:11,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-19 08:39:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784621966] [2024-10-19 08:39:11,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:39:11,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-19 08:39:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:39:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-19 08:39:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-19 08:39:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:11,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:39:11,937 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-19 08:39:11,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:11,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:11,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:39:12,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-19 08:39:12,219 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-19 08:39:12,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:39:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1712501392, now seen corresponding path program 3 times [2024-10-19 08:39:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:39:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272895045] [2024-10-19 08:39:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:12,521 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-19 08:39:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:39:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272895045] [2024-10-19 08:39:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272895045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:39:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426920525] [2024-10-19 08:39:12,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 08:39:12,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:39:12,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:12,526 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-19 08:39:12,527 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-19 08:39:12,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-19 08:39:12,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:39:12,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-19 08:39:12,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:39:12,642 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-19 08:39:12,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:39:12,722 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-19 08:39:12,744 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-19 08:39:12,801 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-19 08:39:12,836 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-19 08:39:12,856 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-19 08:39:12,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:39:20,925 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-19 08:39:20,939 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-19 08:39:21,063 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-19 08:39:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426920525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:39:21,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:39:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-19 08:39:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946258491] [2024-10-19 08:39:21,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:39:21,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-19 08:39:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:39:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-19 08:39:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-19 08:39:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:21,067 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:39:21,067 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-19 08:39:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:39:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:39:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:21,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-19 08:39:21,457 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-19 08:39:21,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:39:21,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2049452556, now seen corresponding path program 1 times [2024-10-19 08:39:21,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:39:21,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546734667] [2024-10-19 08:39:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:21,990 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-19 08:39:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:39:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546734667] [2024-10-19 08:39:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546734667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:39:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370170385] [2024-10-19 08:39:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:21,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:39:21,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:21,994 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-19 08:39:21,996 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-19 08:39:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:22,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-19 08:39:22,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:39:22,095 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-19 08:39:22,168 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:39:22,168 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-19 08:39:22,199 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-19 08:39:22,264 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-19 08:39:22,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-19 08:39:22,348 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-19 08:39:22,422 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-19 08:39:22,438 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-19 08:39:22,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:39:36,524 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-19 08:39:40,586 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-19 08:39:40,673 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-19 08:39:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370170385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:39:40,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:39:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-19 08:39:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859687926] [2024-10-19 08:39:40,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:39:40,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-19 08:39:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:39:40,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-19 08:39:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=324, Unknown=6, NotChecked=78, Total=506 [2024-10-19 08:39:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:40,675 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:39:40,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 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-19 08:39:40,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:40,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:40,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:39:40,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:40,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:39:46,232 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:39:46,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 270 [2024-10-19 08:39:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash -936332181, now seen corresponding path program 1 times [2024-10-19 08:39:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:48,344 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-19 08:39:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:48,389 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-19 08:39:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:39:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:39:48,707 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:39:48,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1260 treesize of output 1120 [2024-10-19 08:39:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2003208536, now seen corresponding path program 1 times [2024-10-19 08:39:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:39:48,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:39:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:39:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:39:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:39:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:39:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 08:39:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:39:49,105 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-19 08:39:49,292 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,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-19 08:39:49,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:39:49,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:39:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1652070412, now seen corresponding path program 2 times [2024-10-19 08:39:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:39:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377595692] [2024-10-19 08:39:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:39:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:39:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:39:49,785 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-19 08:39:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:39:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377595692] [2024-10-19 08:39:49,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377595692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:39:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156244022] [2024-10-19 08:39:49,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 08:39:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:39:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:39:49,787 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-19 08:39:49,788 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-19 08:39:49,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 08:39:49,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:39:49,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-19 08:39:49,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:39:49,893 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-19 08:39:49,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:39:49,947 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-19 08:39:49,965 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-19 08:39:50,069 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-19 08:39:50,128 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-19 08:39:50,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-19 08:39:52,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-19 08:39:52,966 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-19 08:39:52,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:40:05,879 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:40:07,665 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:40:09,406 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:40:11,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:40:13,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-19 08:40:15,523 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_454 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_454) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-19 08:40:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-19 08:40:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156244022] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:40:15,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:40:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-19 08:40:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525402008] [2024-10-19 08:40:15,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:40:15,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-19 08:40:15,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:40:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-19 08:40:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=326, Unknown=14, NotChecked=258, Total=702 [2024-10-19 08:40:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:40:15,676 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:40:15,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 26 states have internal predecessors, (104), 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-19 08:40:15,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:40:15,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:40:15,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:40:15,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 08:40:15,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:40:15,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:40:22,184 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:40:22,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 561 [2024-10-19 08:40:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1226173221, now seen corresponding path program 1 times [2024-10-19 08:40:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:40:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:40:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:40:22,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:40:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:40:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:40:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:40:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:40:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 08:40:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:40:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:40:22,420 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-19 08:40:22,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-19 08:40:22,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:40:22,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:40:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1136682792, now seen corresponding path program 3 times [2024-10-19 08:40:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:40:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024823317] [2024-10-19 08:40:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:40:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:40:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:40:23,815 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-19 08:40:23,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:40:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024823317] [2024-10-19 08:40:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024823317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:40:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600209424] [2024-10-19 08:40:23,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 08:40:23,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:40:23,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:40:23,817 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-19 08:40:23,819 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-19 08:40:23,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-19 08:40:23,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:40:23,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-19 08:40:23,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:40:23,971 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-19 08:40:24,119 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-19 08:40:24,119 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-19 08:40:24,153 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-19 08:40:24,339 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-19 08:40:24,431 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-19 08:40:27,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-19 08:40:31,159 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-19 08:40:39,355 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 96 treesize of output 77 [2024-10-19 08:41:01,133 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 102 treesize of output 82 [2024-10-19 08:41:01,180 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-19 08:41:01,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:41:25,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |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_45|) 0))) is different from false [2024-10-19 08:41:27,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-19 08:41:29,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-19 08:41:31,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-19 08:41:33,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (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_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-10-19 08:41:33,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (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_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-19 08:41:35,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_47| (+ v_ArrVal_641 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 08:41:37,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_639 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 08:41:39,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (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_49| (+ v_ArrVal_639 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-19 08:41:41,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_641 Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (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_637) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_639 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_641 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_644) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-19 08:41:42,011 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-19 08:41:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600209424] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:41:42,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:41:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-19 08:41:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766005608] [2024-10-19 08:41:42,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:41:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-19 08:41:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:41:42,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-19 08:41:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=678, Unknown=41, NotChecked=650, Total=1560 [2024-10-19 08:41:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:41:42,013 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:41:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:41:42,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:41:42,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:41:42,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:41:42,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 08:41:42,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:41:42,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:41:42,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:41:43,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 08:41:45,389 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-19 08:41:50,712 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-19 08:41:52,725 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-19 08:41:54,746 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-19 08:41:59,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 08:42:01,382 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-19 08:42:03,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 08:42:05,024 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-19 08:42:22,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 08:42:24,763 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-19 08:42:26,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 08:42:28,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-19 08:42:47,663 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:42:47,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 561 [2024-10-19 08:42:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1345752871, now seen corresponding path program 1 times [2024-10-19 08:42:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:42:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:42:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:42:49,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:42:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 08:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:42:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:42:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-19 08:42:49,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-19 08:42:50,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-10-19 08:42:50,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:42:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:42:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash -514855942, now seen corresponding path program 4 times [2024-10-19 08:42:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:42:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835231207] [2024-10-19 08:42:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:42:50,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:42:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:20,481 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-19 08:48:20,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:48:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835231207] [2024-10-19 08:48:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835231207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:48:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674930781] [2024-10-19 08:48:20,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-19 08:48:20,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:48:20,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:48:20,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:48:20,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-19 08:48:20,766 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-19 08:48:20,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:48:20,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-19 08:48:20,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:48:20,781 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-19 08:48:20,985 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:48:20,986 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-19 08:48:21,213 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-19 08:48:21,429 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-19 08:48:21,631 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-19 08:48:25,973 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-19 08:48:30,487 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-19 08:48:50,769 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-19 08:49:01,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 189 [2024-10-19 08:49:46,764 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 291 treesize of output 244 [2024-10-19 08:49:54,441 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 490 treesize of output 417 [2024-10-19 08:49:58,520 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 579 treesize of output 504 [2024-10-19 08:50:59,033 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 1078 treesize of output 934 [2024-10-19 08:51:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 121 refuted. 21 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-19 08:51:00,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:51:30,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:51:33,056 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:51:33,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925))) (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_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:51:33,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |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| (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| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 08:51:35,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|))))) is different from false [2024-10-19 08:51:37,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-19 08:51:39,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ .cse0 |c_~#cache~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 08:51:41,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_921 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 08:51:43,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 08:51:45,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:51:47,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse3 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|)) (< .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:51:50,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse3 |c_~#cache~0.offset|))) (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_917 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:51:52,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:51:54,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:51:56,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse3 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse3 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:51:58,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse3 |c_~#cache~0.offset|))) (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_915 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse2 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-19 08:52:01,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 84)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ v_ArrVal_915 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse1 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |~#cache~0.offset| .cse2 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))))) is different from false [2024-10-19 08:52:03,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_ArrVal_921 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 84)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|))) (store (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ v_ArrVal_915 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse0 (+ (select .cse1 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |~#cache~0.offset| .cse2 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))))) is different from false [2024-10-19 08:52:04,941 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-19 08:52:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674930781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:52:04,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:52:04,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 66 [2024-10-19 08:52:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356197811] [2024-10-19 08:52:04,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:52:04,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-19 08:52:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:52:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-19 08:52:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2049, Unknown=99, NotChecked=1998, Total=4422 [2024-10-19 08:52:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:04,944 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:52:04,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.253731343283582) internal successors, (285), 66 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-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-19 08:52:04,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:09,357 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-19 08:52:15,078 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse117 (@diff .cse19 .cse5))) (let ((.cse128 (store .cse19 .cse117 0))) (let ((.cse121 (@diff .cse128 .cse5))) (let ((.cse129 (store .cse128 .cse121 0))) (let ((.cse120 (@diff .cse129 .cse5))) (let ((.cse127 (store .cse129 .cse120 0))) (let ((.cse122 (@diff .cse127 .cse5))) (let ((.cse126 (store .cse127 .cse122 0))) (let ((.cse123 (@diff .cse126 .cse5))) (let ((.cse125 (store .cse126 .cse123 0))) (let ((.cse124 (@diff .cse125 .cse5))) (let ((.cse118 (= .cse5 .cse19)) (.cse2 (= .cse5 .cse129)) (.cse116 (= .cse5 .cse128)) (.cse4 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse119 (= .cse5 .cse127)) (.cse115 (= .cse5 .cse126)) (.cse21 (store .cse125 .cse124 0)) (.cse37 (= .cse5 .cse125)) (.cse38 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse23 (<= (+ .cse38 80) .cse8)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse90 (= .cse5 (select |c_#memory_int| |c_~#cache~0.base|))) (.cse24 (or .cse37 (< (+ .cse124 27) .cse8))) (.cse25 (= .cse5 .cse21)) (.cse27 (or .cse115 (< (+ .cse123 27) .cse8))) (.cse28 (or (< (+ .cse122 27) .cse8) .cse119)) (.cse33 (select |c_#memory_int| 4)) (.cse31 (<= 0 |c_~#cache~0.offset|)) (.cse32 (+ |c_~#cache~0.offset| 1)) (.cse29 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse20 (not .cse4)) (.cse1 (or .cse116 (< (+ .cse121 27) .cse8))) (.cse26 (or (< (+ .cse120 27) .cse8) .cse2)) (.cse3 (or .cse118 (< (+ .cse117 27) .cse8))) (.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (or (let ((.cse18 (store .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse17 (@diff .cse18 .cse5))) (let ((.cse11 (store .cse18 .cse17 0))) (let ((.cse12 (@diff .cse11 .cse5))) (let ((.cse15 (store .cse11 .cse12 0))) (let ((.cse16 (@diff .cse15 .cse5))) (let ((.cse13 (store .cse15 .cse16 0))) (let ((.cse14 (@diff .cse13 .cse5))) (let ((.cse10 (store .cse13 .cse14 0))) (let ((.cse9 (@diff .cse10 .cse5))) (let ((.cse6 (store .cse10 .cse9 0))) (let ((.cse7 (@diff .cse6 .cse5))) (and (or (= .cse5 .cse6) (< (+ .cse7 27) .cse8)) (or (< (+ .cse9 27) .cse8) (= .cse5 .cse10)) .cse0 (= .cse5 (store .cse6 .cse7 0)) (or (= .cse5 .cse11) (< (+ .cse12 27) .cse8)) (or (= .cse5 .cse13) (< (+ .cse14 27) .cse8)) (or (= .cse5 .cse15) (< (+ .cse16 27) .cse8)) (or (< (+ .cse17 27) .cse8) (= .cse5 .cse18))))))))))))))) .cse4) (or .cse20 (let ((.cse22 (@diff .cse21 .cse5))) (and (= .cse5 (store .cse21 .cse22 0)) .cse23 .cse24 (or .cse25 (< (+ .cse22 27) .cse8)) .cse1 .cse26 .cse27 .cse3 .cse28 .cse29))) (or (and (= .cse5 (store .cse30 0 0)) .cse31) .cse20) (or .cse20 (< 0 .cse32)) (or (exists ((v_subst_19 Int) (v_subst_17 Int)) (and (<= (+ 84 v_subst_19) .cse8) (<= (+ 56 v_subst_17) .cse8) (= (store (store .cse5 v_subst_17 (select .cse33 v_subst_17)) v_subst_19 (select .cse33 v_subst_19)) .cse33))) (exists ((v_subst_23 Int) (v_prenex_2 Int)) (let ((.cse36 (select .cse33 v_prenex_2))) (let ((.cse34 (store .cse5 v_prenex_2 .cse36)) (.cse35 (select .cse33 v_subst_23))) (and (<= (+ 84 v_prenex_2) .cse8) (= (store .cse34 v_subst_23 .cse35) .cse33) (<= (+ v_subst_23 28) .cse8) (= .cse36 (select (store .cse34 v_subst_23 (+ .cse35 1)) v_prenex_2)))))) (exists ((v_subst_18 Int) (v_subst_21 Int)) (and (= (store (store .cse5 v_subst_18 (select .cse33 v_subst_18)) v_subst_21 (select .cse33 v_subst_21)) .cse33) (<= (+ v_subst_21 28) .cse8) (<= (+ 84 v_subst_18) .cse8))) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (v_subst_20 Int)) (and (not (= v_prenex_4 v_prenex_3)) (not (= v_subst_20 v_prenex_3)) (= (store (store (store .cse5 v_prenex_3 (select .cse33 v_prenex_3)) v_prenex_4 (select .cse33 v_prenex_4)) v_subst_20 (select .cse33 v_subst_20)) .cse33) (<= (+ v_subst_20 28) .cse8) (<= (+ 84 v_prenex_3) .cse8) (not (= v_subst_20 v_prenex_4)) (<= (+ 56 v_prenex_4) .cse8))) (exists ((v_subst_24 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (and (<= (+ 56 v_subst_24) .cse8) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 84) .cse8) (= (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse33 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_24 (select .cse33 v_subst_24)) .cse33))) (exists ((v_subst_22 Int)) (and (= (store .cse5 v_subst_22 (select .cse33 v_subst_22)) .cse33) (<= (+ 84 v_subst_22) .cse8)))) (or .cse20 (and .cse37 (<= (+ .cse38 52) .cse8) .cse0 .cse1 .cse26 .cse27 .cse3 .cse28)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (exists ((v_prenex_7 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse40 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse39 (+ |~#cache~0.offset| .cse40))) (and (<= (+ 84 v_prenex_7) .cse39) (<= (+ |~#cache~0.offset| .cse40 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store (store .cse5 v_prenex_7 (select .cse33 v_prenex_7)) .cse39 (select .cse5 .cse39)) .cse33))))) (exists ((v_subst_19 Int) (v_subst_17 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse42 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse41 (+ |~#cache~0.offset| .cse42))) (let ((.cse43 (store (store .cse5 v_subst_17 (select .cse33 v_subst_17)) v_subst_19 (select .cse33 v_subst_19))) (.cse44 (select .cse33 .cse41))) (and (not (= v_subst_19 v_subst_17)) (<= (+ 84 v_subst_19) .cse41) (<= (+ 56 v_subst_17) .cse41) (<= (+ |~#cache~0.offset| .cse42 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= .cse33 (store .cse43 .cse41 .cse44)) (= (select (let ((.cse45 (store .cse43 .cse41 (+ 1 .cse44)))) (store (store .cse5 v_subst_17 (select .cse45 v_subst_17)) v_subst_19 (select .cse45 v_subst_19))) .cse41) .cse44)))))) (exists ((v_prenex_5 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse47 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse46 (+ |~#cache~0.offset| .cse47))) (and (<= (+ 84 v_prenex_5) .cse46) (= (store (store .cse5 v_prenex_5 (select .cse33 v_prenex_5)) .cse46 (select .cse5 .cse46)) .cse33) (<= (+ |~#cache~0.offset| .cse47 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) (exists ((|~#cache~0.offset| Int) (v_subst_22 Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse49 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse48 (+ |~#cache~0.offset| .cse49))) (and (= (store (store .cse5 v_subst_22 (select .cse33 v_subst_22)) .cse48 (select .cse5 .cse48)) .cse33) (<= (+ |~#cache~0.offset| .cse49 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 84 v_subst_22) .cse48))))) (exists ((v_subst_18 Int) (|~#cache~0.offset| Int) (v_subst_21 Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse54 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse50 (+ |~#cache~0.offset| .cse54))) (let ((.cse52 (store (store .cse5 v_subst_18 (select .cse33 v_subst_18)) v_subst_21 (select .cse33 v_subst_21))) (.cse53 (select .cse33 .cse50))) (and (<= (+ v_subst_21 28) .cse50) (= (select (let ((.cse51 (store .cse52 .cse50 (+ 1 .cse53)))) (store (store .cse5 v_subst_18 (select .cse51 v_subst_18)) v_subst_21 (select .cse51 v_subst_21))) .cse50) .cse53) (= (store .cse52 .cse50 .cse53) .cse33) (<= (+ |~#cache~0.offset| .cse54 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (not (= v_subst_21 v_subst_18)) (<= (+ 84 v_subst_18) .cse50)))))) (exists ((v_subst_24 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse58 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse56 (+ |~#cache~0.offset| .cse58))) (let ((.cse55 (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse33 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_24 (select .cse33 v_subst_24))) (.cse57 (select .cse33 .cse56))) (and (= (store .cse55 .cse56 .cse57) .cse33) (<= (+ |~#cache~0.offset| .cse58 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_subst_24)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 84) .cse56) (<= (+ 56 v_subst_24) .cse56) (= (select (let ((.cse59 (store .cse55 .cse56 (+ 1 .cse57)))) (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse59 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_24 (select .cse59 v_subst_24))) .cse56) .cse57)))))) (exists ((v_prenex_6 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse61 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse60 (+ |~#cache~0.offset| .cse61))) (and (<= (+ 84 v_prenex_6) .cse60) (<= (+ |~#cache~0.offset| .cse61 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store (store .cse5 v_prenex_6 (select .cse33 v_prenex_6)) .cse60 (select .cse5 .cse60)) .cse33))))) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|~#cache~0.offset| Int) (v_subst_20 Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse66 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse63 (+ |~#cache~0.offset| .cse66))) (let ((.cse62 (store (store (store .cse5 v_prenex_3 (select .cse33 v_prenex_3)) v_prenex_4 (select .cse33 v_prenex_4)) v_subst_20 (select .cse33 v_subst_20))) (.cse64 (select .cse33 .cse63))) (and (= (store .cse62 .cse63 .cse64) .cse33) (not (= v_prenex_4 v_prenex_3)) (= (select (let ((.cse65 (store .cse62 .cse63 (+ 1 .cse64)))) (store (store (store .cse5 v_prenex_3 (select .cse65 v_prenex_3)) v_prenex_4 (select .cse65 v_prenex_4)) v_subst_20 (select .cse65 v_subst_20))) .cse63) .cse64) (not (= v_subst_20 v_prenex_3)) (<= (+ |~#cache~0.offset| .cse66 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ v_subst_20 28) .cse63) (<= (+ 84 v_prenex_3) .cse63) (<= (+ 56 v_prenex_4) .cse63) (not (= v_subst_20 v_prenex_4))))))) (exists ((v_subst_23 Int) (v_prenex_2 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse67 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse68 (+ |~#cache~0.offset| .cse67))) (let ((.cse70 (store (store .cse5 v_prenex_2 (select .cse33 v_prenex_2)) v_subst_23 (select .cse33 v_subst_23))) (.cse71 (select .cse33 .cse68))) (and (not (= v_subst_23 v_prenex_2)) (<= (+ |~#cache~0.offset| .cse67 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ v_subst_23 28) .cse68) (<= (+ 84 v_prenex_2) .cse68) (= (select (let ((.cse69 (store .cse70 .cse68 (+ 1 .cse71)))) (store (store .cse5 v_prenex_2 (select .cse69 v_prenex_2)) v_subst_23 (select .cse69 v_subst_23))) .cse68) .cse71) (= (store .cse70 .cse68 .cse71) .cse33))))))) (or .cse20 (let ((.cse72 (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse73 (@diff .cse72 .cse5))) (let ((.cse83 (store .cse72 .cse73 0))) (let ((.cse82 (@diff .cse83 .cse5))) (let ((.cse75 (store .cse83 .cse82 0))) (let ((.cse74 (@diff .cse75 .cse5))) (let ((.cse77 (store .cse75 .cse74 0))) (let ((.cse76 (@diff .cse77 .cse5))) (let ((.cse84 (store .cse77 .cse76 0))) (let ((.cse85 (@diff .cse84 .cse5))) (let ((.cse79 (store .cse84 .cse85 0))) (let ((.cse78 (@diff .cse79 .cse5))) (let ((.cse81 (store .cse79 .cse78 0))) (let ((.cse80 (@diff .cse81 .cse5))) (and .cse23 (or (= .cse5 .cse72) (< (+ .cse73 27) .cse8)) (or (< (+ .cse74 27) .cse8) (= .cse5 .cse75)) (or (< (+ .cse76 27) .cse8) (= .cse5 .cse77)) (or (< (+ .cse78 27) .cse8) (= .cse5 .cse79)) (or (< (+ 27 .cse80) .cse8) (= .cse5 .cse81)) (= .cse5 (store .cse81 .cse80 0)) (or (< (+ .cse82 27) .cse8) (= .cse5 .cse83)) .cse29 (or (= .cse5 .cse84) (< (+ .cse85 27) .cse8)))))))))))))))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_917 Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_915 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_921 Int)) (let ((.cse89 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse88 (+ .cse89 |c_~#cache~0.offset|))) (or (= (select (select (store (let ((.cse86 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_915 (- 1)))))) (store .cse86 |c_~#cache~0.base| (let ((.cse87 (select .cse86 |c_~#cache~0.base|))) (store (store (store .cse87 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ v_ArrVal_917 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ v_ArrVal_921 (- 1))) .cse88 (+ (select .cse87 .cse88) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_925) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse89 28 |c_~#cache~0.offset|)) (< .cse88 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< .cse88 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) (or .cse90 .cse4) .cse90 (or (and .cse24 .cse0 .cse25 .cse1 .cse26 .cse27 .cse3 .cse28) .cse4) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or (exists ((v_subst_18 Int)) (and (= (store .cse5 v_subst_18 (select .cse33 v_subst_18)) .cse33) (<= (+ 56 v_subst_18) .cse8))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_subst_17 Int)) (and (<= (+ v_subst_17 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) .cse8) (= (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse33 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_17 (select .cse33 v_subst_17)) .cse33)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (or (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (v_subst_20 Int)) (let ((.cse92 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse91 (store (store (store .cse5 v_prenex_3 (select .cse33 v_prenex_3)) v_prenex_4 (select .cse33 v_prenex_4)) v_subst_20 (select .cse33 v_subst_20))) (.cse93 (select .cse33 .cse92))) (and (not (= v_prenex_4 v_prenex_3)) (= (store .cse91 .cse92 .cse93) .cse33) (= .cse93 (select (let ((.cse94 (store .cse91 .cse92 (+ .cse93 1)))) (store (store (store .cse5 v_prenex_3 (select .cse94 v_prenex_3)) v_prenex_4 (select .cse94 v_prenex_4)) v_subst_20 (select .cse94 v_subst_20))) .cse92)) (<= (+ 56 v_prenex_4) .cse92) (not (= v_subst_20 v_prenex_3)) (<= (+ 84 v_prenex_3) .cse92) (<= (+ v_subst_20 28) .cse92) (not (= v_subst_20 v_prenex_4)))))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_23 Int) (v_prenex_2 Int)) (let ((.cse96 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse95 (store (store .cse5 v_prenex_2 (select .cse33 v_prenex_2)) v_subst_23 (select .cse33 v_subst_23))) (.cse97 (select .cse33 .cse96))) (and (not (= v_subst_23 v_prenex_2)) (= (store .cse95 .cse96 .cse97) .cse33) (<= (+ 84 v_prenex_2) .cse96) (= .cse97 (select (let ((.cse98 (store .cse95 .cse96 (+ .cse97 1)))) (store (store .cse5 v_prenex_2 (select .cse98 v_prenex_2)) v_subst_23 (select .cse98 v_subst_23))) .cse96)) (<= (+ v_subst_23 28) .cse96))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_subst_24 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (let ((.cse100 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse99 (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse33 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_24 (select .cse33 v_subst_24))) (.cse101 (select .cse33 .cse100))) (and (= (store .cse99 .cse100 .cse101) .cse33) (<= (+ 56 v_subst_24) .cse100) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_subst_24)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 84) .cse100) (= (select (let ((.cse102 (store .cse99 .cse100 (+ .cse101 1)))) (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse102 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_24 (select .cse102 v_subst_24))) .cse100) .cse101))))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_prenex_6 Int)) (let ((.cse103 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (= (store (store .cse5 v_prenex_6 (select .cse33 v_prenex_6)) .cse103 (select .cse5 .cse103)) .cse33) (<= (+ 84 v_prenex_6) .cse103)))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_19 Int) (v_subst_17 Int)) (let ((.cse105 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse104 (store (store .cse5 v_subst_17 (select .cse33 v_subst_17)) v_subst_19 (select .cse33 v_subst_19))) (.cse106 (select .cse33 .cse105))) (and (= (store .cse104 .cse105 .cse106) .cse33) (not (= v_subst_19 v_subst_17)) (= (select (let ((.cse107 (store .cse104 .cse105 (+ .cse106 1)))) (store (store .cse5 v_subst_17 (select .cse107 v_subst_17)) v_subst_19 (select .cse107 v_subst_19))) .cse105) .cse106) (<= (+ 84 v_subst_19) .cse105) (<= (+ 56 v_subst_17) .cse105))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_prenex_7 Int)) (let ((.cse108 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (= (store (store .cse5 v_prenex_7 (select .cse33 v_prenex_7)) .cse108 (select .cse5 .cse108)) .cse33) (<= (+ 84 v_prenex_7) .cse108)))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_22 Int)) (let ((.cse109 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (<= (+ 84 v_subst_22) .cse109) (= .cse33 (store (store .cse5 v_subst_22 (select .cse33 v_subst_22)) .cse109 (select .cse5 .cse109)))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_5 Int)) (let ((.cse110 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (= (store (store .cse5 v_prenex_5 (select .cse33 v_prenex_5)) .cse110 (select .cse5 .cse110)) .cse33) (<= (+ 84 v_prenex_5) .cse110)))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_18 Int) (v_subst_21 Int)) (let ((.cse113 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse112 (store (store .cse5 v_subst_18 (select .cse33 v_subst_18)) v_subst_21 (select .cse33 v_subst_21))) (.cse114 (select .cse33 .cse113))) (and (= (select (let ((.cse111 (store .cse112 .cse113 (+ .cse114 1)))) (store (store .cse5 v_subst_18 (select .cse111 v_subst_18)) v_subst_21 (select .cse111 v_subst_21))) .cse113) .cse114) (= (store .cse112 .cse113 .cse114) .cse33) (<= (+ v_subst_21 28) .cse113) (not (= v_subst_21 v_subst_18)) (<= (+ 84 v_subst_18) .cse113))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|)))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (and (= (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse33 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) .cse33) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) .cse8))) (= (select |c_#valid| 4) 1) (or (and .cse0 .cse115 .cse1 .cse26 .cse3 .cse28) .cse4) (= .cse5 .cse33) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse31 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (or .cse20 (and .cse116 (or (< .cse117 .cse32) .cse118) (<= .cse38 (+ |c_~#cache~0.offset| 4)) .cse29)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (or .cse20 (and .cse0 .cse119 .cse1 (<= (+ .cse38 24) .cse8) .cse26 .cse3)) (= |c_~#cache~0.base| 4) (or (and .cse0 .cse118) .cse4)))))))))))))))) is different from true [2024-10-19 08:52:22,661 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-19 08:52:25,887 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-19 08:52:53,315 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-19 08:52:59,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 08:53:01,447 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-19 08:53:03,459 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-19 08:53:05,472 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-19 08:53:07,483 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-19 08:53:09,517 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] Killed by 15