./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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 04:31:32,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 04:31:32,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 04:31:32,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 04:31:32,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 04:31:32,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 04:31:32,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 04:31:32,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 04:31:32,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 04:31:32,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 04:31:32,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 04:31:32,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 04:31:32,995 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 04:31:32,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 04:31:32,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 04:31:32,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 04:31:32,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 04:31:32,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 04:31:32,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 04:31:32,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 04:31:32,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 04:31:33,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 04:31:33,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 04:31:33,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 04:31:33,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 04:31:33,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 04:31:33,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 04:31:33,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 04:31:33,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 04:31:33,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 04:31:33,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 04:31:33,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 04:31:33,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 04:31:33,003 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 04:31:33,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 04:31:33,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 04:31:33,004 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 04:31:33,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 04:31:33,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 04:31:33,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 04:31:33,004 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 04:31:33,005 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-17 04:31:33,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 04:31:33,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 04:31:33,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 04:31:33,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 04:31:33,244 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 04:31:33,245 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-17 04:31:34,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 04:31:34,753 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 04:31:34,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-17 04:31:34,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d723bca91/5f242ea9dd454a2eb0550b16aefd912d/FLAG571062de1 [2024-10-17 04:31:34,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d723bca91/5f242ea9dd454a2eb0550b16aefd912d [2024-10-17 04:31:34,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 04:31:34,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 04:31:34,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 04:31:34,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 04:31:34,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 04:31:34,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:31:34" (1/1) ... [2024-10-17 04:31:34,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2527d94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:34, skipping insertion in model container [2024-10-17 04:31:34,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:31:34" (1/1) ... [2024-10-17 04:31:34,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 04:31:35,202 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-17 04:31:35,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 04:31:35,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 04:31:35,263 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-17 04:31:35,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 04:31:35,312 INFO L204 MainTranslator]: Completed translation [2024-10-17 04:31:35,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35 WrapperNode [2024-10-17 04:31:35,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 04:31:35,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 04:31:35,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 04:31:35,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 04:31:35,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,352 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 218 [2024-10-17 04:31:35,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 04:31:35,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 04:31:35,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 04:31:35,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 04:31:35,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 04:31:35,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 04:31:35,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 04:31:35,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 04:31:35,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (1/1) ... [2024-10-17 04:31:35,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 04:31:35,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:31:35,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 04:31:35,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 04:31:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 04:31:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 04:31:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 04:31:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 04:31:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 04:31:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 04:31:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 04:31:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 04:31:35,480 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 04:31:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 04:31:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 04:31:35,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 04:31:35,483 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 04:31:35,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 04:31:35,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 04:31:35,830 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 04:31:35,831 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 04:31:35,963 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 04:31:35,963 INFO L314 CfgBuilder]: Removed 25 assume(true) statements. [2024-10-17 04:31:35,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:31:35 BoogieIcfgContainer [2024-10-17 04:31:35,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 04:31:35,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 04:31:35,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 04:31:35,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 04:31:35,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 04:31:34" (1/3) ... [2024-10-17 04:31:35,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc53892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:31:35, skipping insertion in model container [2024-10-17 04:31:35,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:31:35" (2/3) ... [2024-10-17 04:31:35,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc53892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:31:35, skipping insertion in model container [2024-10-17 04:31:35,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:31:35" (3/3) ... [2024-10-17 04:31:35,971 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-10-17 04:31:35,984 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 04:31:35,984 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-17 04:31:35,985 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 04:31:36,028 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 04:31:36,069 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 04:31:36,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 04:31:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:31:36,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 04:31:36,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 04:31:36,165 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 04:31:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:31:36,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 04:31:36,185 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;@532a1402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 04:31:36,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 04:31:36,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:31:36,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:31:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1853550032, now seen corresponding path program 1 times [2024-10-17 04:31:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:31:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779784183] [2024-10-17 04:31:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:31:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:31:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779784183] [2024-10-17 04:31:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779784183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 04:31:36,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 04:31:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 04:31:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976568552] [2024-10-17 04:31:36,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 04:31:36,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 04:31:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:31:36,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 04:31:36,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 04:31:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:36,933 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:31:36,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:31:36,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:36,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 04:31:36,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:31:36,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:31:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1805902569, now seen corresponding path program 1 times [2024-10-17 04:31:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:31:36,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678831212] [2024-10-17 04:31:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:31:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:31:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678831212] [2024-10-17 04:31:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678831212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:31:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571375962] [2024-10-17 04:31:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:31:37,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:31:37,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:31:37,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 04:31:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:37,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 04:31:37,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:31:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:37,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:31:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571375962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:31:37,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:31:37,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 04:31:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324256074] [2024-10-17 04:31:37,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:31:37,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 04:31:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:31:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 04:31:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 04:31:37,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:37,216 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:31:37,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:31:37,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:37,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:31:37,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 04:31:37,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-17 04:31:37,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:31:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:31:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash -342103024, now seen corresponding path program 2 times [2024-10-17 04:31:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:31:37,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550826343] [2024-10-17 04:31:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:31:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:31:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550826343] [2024-10-17 04:31:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550826343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:31:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350030814] [2024-10-17 04:31:37,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:31:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:31:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:31:37,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:31:37,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 04:31:37,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:31:37,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:31:37,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 04:31:37,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:31:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:37,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:31:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:31:37,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350030814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:31:37,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:31:37,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 04:31:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508418287] [2024-10-17 04:31:37,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:31:37,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 04:31:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:31:37,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 04:31:37,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 04:31:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:37,778 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:31:37,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:31:37,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:37,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:31:37,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:31:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:31:37,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 04:31:38,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:31:38,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:31:38,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:31:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1712501392, now seen corresponding path program 3 times [2024-10-17 04:31:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:31:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812691236] [2024-10-17 04:31:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:31:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:31:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:31:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812691236] [2024-10-17 04:31:38,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812691236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:31:38,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542577012] [2024-10-17 04:31:38,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:31:38,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:31:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:31:38,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:31:38,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 04:31:38,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 04:31:38,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:31:38,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 04:31:38,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:31:38,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:31:38,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:31:38,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 04:31:38,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:31:38,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:31:38,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-10-17 04:31:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:31:38,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:31:44,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 04:31:46,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 04:31:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-17 04:31:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542577012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:31:46,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:31:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 04:31:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656218107] [2024-10-17 04:31:46,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:31:46,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 04:31:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:31:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 04:31:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-17 04:31:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:46,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:31:46,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:31:46,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:46,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:31:46,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:31:46,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:31:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:31:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:31:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:31:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:31:47,044 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-17 04:31:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:31:47,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:31:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:31:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2049452556, now seen corresponding path program 1 times [2024-10-17 04:31:47,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:31:47,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11266306] [2024-10-17 04:31:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:31:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:31:47,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:31:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11266306] [2024-10-17 04:31:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11266306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:31:47,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288456404] [2024-10-17 04:31:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:31:47,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:31:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:31:47,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:31:47,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 04:31:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:31:47,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-17 04:31:47,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:31:47,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:31:48,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:31:48,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 04:31:48,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:31:48,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:31:48,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-10-17 04:31:48,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-10-17 04:31:48,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-17 04:31:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:31:48,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:31:56,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-17 04:32:02,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 04:32:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-17 04:32:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288456404] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:32:02,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:32:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-17 04:32:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758164713] [2024-10-17 04:32:02,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:32:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-17 04:32:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:32:02,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-17 04:32:02,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=326, Unknown=4, NotChecked=78, Total=506 [2024-10-17 04:32:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:02,526 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:32:02,527 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-17 04:32:02,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:02,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:02,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:02,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:02,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:04,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-17 04:32:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:32:04,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:32:04,742 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 04:32:04,742 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 29 treesize of output 25 [2024-10-17 04:32:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1610656064, now seen corresponding path program 1 times [2024-10-17 04:32:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:32:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:32:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:32:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 04:32:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:32:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:32:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:32:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 04:32:04,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 04:32:04,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 04:32:04,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-17 04:32:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:04,910 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:32:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:32:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:04,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:04,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:04,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:05,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-17 04:32:05,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:32:05,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:32:05,251 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 1291 treesize of output 1221 [2024-10-17 04:32:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2003208486, now seen corresponding path program 1 times [2024-10-17 04:32:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:32:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:32:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:32:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:32:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:32:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:32:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:32:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:32:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 04:32:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 04:32:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-17 04:32:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:05,719 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:32:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:32:05,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:05,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:05,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:05,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:05,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:05,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:05,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:05,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7 [2024-10-17 04:32:05,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:32:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:32:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1652070412, now seen corresponding path program 2 times [2024-10-17 04:32:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:32:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905248843] [2024-10-17 04:32:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:32:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:32:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:32:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:32:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:32:07,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905248843] [2024-10-17 04:32:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905248843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:32:07,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184360018] [2024-10-17 04:32:07,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:32:07,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:32:07,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:32:07,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:32:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 04:32:07,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:32:07,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:32:07,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-17 04:32:07,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:32:07,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:32:07,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:32:07,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 04:32:07,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:32:07,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 04:32:07,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 04:32:07,550 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-17 04:32:09,994 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-17 04:32:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:32:10,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:32:27,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |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_37|) 0))) is different from false [2024-10-17 04:32:29,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_573 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|)))) is different from false [2024-10-17 04:32:30,651 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_573 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |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_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:32:32,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_573 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |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_570 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:32:34,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_573 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 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_39| (+ v_ArrVal_570 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 28)))) is different from false [2024-10-17 04:32:36,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_573 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 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_569) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| (+ v_ArrVal_570 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:32:36,905 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-17 04:32:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184360018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:32:36,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:32:36,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 30 [2024-10-17 04:32:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027899754] [2024-10-17 04:32:36,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:32:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-17 04:32:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:32:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-17 04:32:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=506, Unknown=17, NotChecked=306, Total=930 [2024-10-17 04:32:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:36,907 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:32:36,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:32:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:36,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:36,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:36,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:32:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:32:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:32:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:32:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:32:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:32:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:32:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:32:48,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-17 04:32:48,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-17 04:32:48,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:32:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:32:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1136682792, now seen corresponding path program 3 times [2024-10-17 04:32:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:32:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945343887] [2024-10-17 04:32:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:32:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:32:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:32:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:32:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:32:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945343887] [2024-10-17 04:32:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945343887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:32:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946226845] [2024-10-17 04:32:49,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:32:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:32:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:32:49,947 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:32:49,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 04:32:50,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 04:32:50,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:32:50,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-17 04:32:50,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:32:50,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:32:50,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:32:50,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 04:32:50,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:32:50,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 04:32:50,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 04:32:53,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-17 04:32:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-17 04:33:03,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-10-17 04:33:19,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2024-10-17 04:33:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:33:19,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:33:43,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |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_43|) 0))) is different from false [2024-10-17 04:33:45,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |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_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0))) is different from false [2024-10-17 04:33:47,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int))) (or (= (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_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:33:49,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 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_705 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:33:51,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_705 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)))) is different from false [2024-10-17 04:33:51,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_705 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)))))) is different from false [2024-10-17 04:33:53,941 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) (= (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_45| (+ v_ArrVal_705 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0)))) is different from false [2024-10-17 04:33:56,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_703 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) (= (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_703 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_705 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0)))) is different from false [2024-10-17 04:33:58,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_705 Int) (v_ArrVal_703 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)) (= (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_47| (+ v_ArrVal_703 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_705 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| 28)))) is different from false [2024-10-17 04:34:00,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_708 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_705 Int) (v_ArrVal_703 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)) (= (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_701) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_703 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_705 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_708) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| 28)))) is different from false [2024-10-17 04:34:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-17 04:34:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946226845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:34:00,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:34:00,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2024-10-17 04:34:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848759303] [2024-10-17 04:34:00,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:34:00,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-17 04:34:00,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:34:00,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-17 04:34:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=630, Unknown=38, NotChecked=630, Total=1482 [2024-10-17 04:34:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:00,417 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:34:00,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 38 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:34:00,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:01,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:03,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:08,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:10,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:12,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:16,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:17,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:19,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:20,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:36,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:37,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:38,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:40,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:34:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:34:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:34:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:34:57,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 04:34:57,609 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 [2024-10-17 04:34:57,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:34:57,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:34:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash -514855942, now seen corresponding path program 4 times [2024-10-17 04:34:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:34:57,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482587414] [2024-10-17 04:34:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:34:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:34:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482587414] [2024-10-17 04:35:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482587414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610509828] [2024-10-17 04:35:13,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 04:35:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:13,908 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-17 04:35:13,909 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-17 04:35:14,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 04:35:14,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:35:14,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-17 04:35:14,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:14,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:35:14,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:35:14,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 04:35:14,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:35:14,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 04:35:14,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 04:35:18,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-17 04:35:21,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-17 04:35:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2024-10-17 04:35:48,175 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-17 04:36:19,568 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 298 treesize of output 249 [2024-10-17 04:36:23,208 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 579 treesize of output 486 [2024-10-17 04:36:25,664 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 668 treesize of output 573 [2024-10-17 04:37:11,994 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 1537 treesize of output 1313 [2024-10-17 04:37:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:37:12,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:37:49,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:51,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| 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_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:51,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_913 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913))) (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_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:53,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_913 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |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_913) |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_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:55,198 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_913 (Array Int Int))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 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_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse2 28 |c_~#cache~0.offset|))))) is different from false [2024-10-17 04:37:57,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_913 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 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_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse2 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 04:37:59,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .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|)) (.cse3 (+ .cse0 |c_~#cache~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:38:01,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 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_909 (- 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_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:38:03,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:38:05,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse1 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse0 (+ (select .cse2 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 04:38:07,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse1 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse2 (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 .cse2 |c_~#cache~0.base| (let ((.cse3 (select .cse2 |c_~#cache~0.base|))) (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse0 (+ (select .cse3 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 04:38:09,742 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 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_905 (- 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_54| (+ v_ArrVal_909 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 04:38:11,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 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_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse2 28 |c_~#cache~0.offset|)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 04:38:13,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 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_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-17 04:38:15,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (let ((.cse0 (+ .cse4 |c_~#cache~0.offset|))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |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_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse0 (+ (select .cse2 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse4 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-17 04:38:17,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (let ((.cse0 (+ .cse4 |c_~#cache~0.offset|))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |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_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse0 (+ (select .cse2 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse4 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-17 04:38:19,742 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (v_ArrVal_902 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 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_902 (- 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_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< .cse2 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse3 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-17 04:38:21,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_902 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 84)) (= 0 (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_58| (+ v_ArrVal_902 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse0 (+ 1 (select .cse1 .cse0))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |~#cache~0.offset| .cse2 28)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)))))) is different from false [2024-10-17 04:38:24,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_909 Int) (v_ArrVal_913 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_905 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_902 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (let ((.cse1 (+ |~#cache~0.offset| .cse2))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_900) |c_~#cache~0.base|))) (store (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ v_ArrVal_902 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ v_ArrVal_905 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ v_ArrVal_909 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |~#cache~0.offset| .cse2 28)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28)) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)))))) is different from false [2024-10-17 04:38:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-17 04:38:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610509828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:38:24,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:38:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 24] total 63 [2024-10-17 04:38:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053642937] [2024-10-17 04:38:24,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:38:24,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-17 04:38:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:38:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-17 04:38:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=1563, Unknown=79, NotChecked=1976, Total=4032 [2024-10-17 04:38:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:38:24,969 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:38:24,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.421875) internal successors, (283), 63 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:38:24,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:38:27,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:29,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:31,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:32,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:34,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:47,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:49,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:51,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:53,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:55,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:57,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:59,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:19,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:21,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:23,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:25,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:27,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:29,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:31,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:38,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:40,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:42,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:44,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:46,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:48,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:50,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:04,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:06,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:08,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:10,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:12,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:14,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:34,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:36,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:38,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:40,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:42,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:06,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:08,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:10,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:12,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:14,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:16,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:18,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:20,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:22,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:24,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:26,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:28,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:30,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:32,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:34,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:36,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:38,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:40,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:42,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:44,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:46,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:48,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:50,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:52,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:55,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:10,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:12,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:21,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:23,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:25,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:27,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-17 04:42:29,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:31,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:33,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:36,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:38,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:40,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:42,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:44,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:46,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:48,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:49,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:00,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:02,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:05,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:08,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:10,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:12,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:15,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:17,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:19,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:21,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:23,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:25,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:27,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:29,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:31,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:33,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:35,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:44:37,661 WARN L286 SmtUtils]: Spent 29.30s on a formula simplification that was a NOOP. DAG size: 272 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 04:44:42,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:44:44,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:44:46,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:44:49,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse7 (select |c_#memory_int| 4))) (and (or (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_subst_24 Int) (v_prenex_2 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse4 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (let ((.cse6 (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 (select .cse7 v_prenex_2)) v_subst_24 (select .cse7 v_subst_24))) (.cse5 (select .cse7 .cse4))) (let ((.cse8 (store .cse6 .cse4 (+ .cse5 1)))) (let ((.cse3 (select .cse8 v_subst_24))) (let ((.cse1 (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse8 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 (select .cse8 v_prenex_2)) v_subst_24 .cse3))) (and (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_prenex_2)) (let ((.cse2 (select .cse1 v_prenex_2))) (= (select (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 .cse2) v_subst_24 (+ .cse3 1)) v_prenex_2) .cse2)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| 84) .cse4) (<= (+ 56 v_prenex_2) .cse4) (= (select .cse1 .cse4) .cse5) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_subst_24)) (= (store .cse6 .cse4 .cse5) .cse7) (<= (+ v_subst_24 28) .cse4)))))))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_6 Int)) (let ((.cse9 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (and (<= (+ 84 v_prenex_6) .cse9) (= (store (store .cse0 v_prenex_6 (select .cse7 v_prenex_6)) .cse9 (select .cse0 .cse9)) .cse7)))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_4 Int) (v_subst_23 Int)) (let ((.cse10 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (let ((.cse12 (store (store .cse0 v_prenex_4 (select .cse7 v_prenex_4)) v_subst_23 (select .cse7 v_subst_23))) (.cse13 (select .cse7 .cse10))) (and (<= (+ v_subst_23 28) .cse10) (<= (+ 84 v_prenex_4) .cse10) (not (= v_subst_23 v_prenex_4)) (= (select (let ((.cse11 (store .cse12 .cse10 (+ .cse13 1)))) (store (store .cse0 v_prenex_4 (select .cse11 v_prenex_4)) v_subst_23 (select .cse11 v_subst_23))) .cse10) .cse13) (= (store .cse12 .cse10 .cse13) .cse7))))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_5 Int)) (let ((.cse14 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (and (= (store (store .cse0 v_prenex_5 (select .cse7 v_prenex_5)) .cse14 (select .cse0 .cse14)) .cse7) (<= (+ 84 v_prenex_5) .cse14)))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (exists ((v_subst_26 Int) (v_prenex_3 Int)) (let ((.cse16 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (let ((.cse15 (store (store .cse0 v_prenex_3 (select .cse7 v_prenex_3)) v_subst_26 (select .cse7 v_subst_26))) (.cse17 (select .cse7 .cse16))) (and (= (store .cse15 .cse16 .cse17) .cse7) (<= (+ 84 v_prenex_3) .cse16) (not (= v_subst_26 v_prenex_3)) (= (select (let ((.cse18 (store .cse15 .cse16 (+ .cse17 1)))) (store (store .cse0 v_prenex_3 (select .cse18 v_prenex_3)) v_subst_26 (select .cse18 v_subst_26))) .cse16) .cse17) (<= (+ 56 v_subst_26) .cse16))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (exists ((v_subst_27 Int) (v_subst_22 Int)) (let ((.cse19 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (let ((.cse21 (store (store .cse0 v_subst_22 (select .cse7 v_subst_22)) v_subst_27 (select .cse7 v_subst_27))) (.cse22 (select .cse7 .cse19))) (and (<= (+ 84 v_subst_27) .cse19) (= (select (let ((.cse20 (store .cse21 .cse19 (+ .cse22 1)))) (store (store .cse0 v_subst_22 (select .cse20 v_subst_22)) v_subst_27 (select .cse20 v_subst_27))) .cse19) .cse22) (<= (+ 56 v_subst_22) .cse19) (= (store .cse21 .cse19 .cse22) .cse7) (not (= v_subst_27 v_subst_22)))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_7 Int)) (let ((.cse23 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (and (<= (+ 84 v_prenex_7) .cse23) (= (store (store .cse0 v_prenex_7 (select .cse7 v_prenex_7)) .cse23 (select .cse0 .cse23)) .cse7)))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_subst_25 Int)) (let ((.cse24 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (and (<= (+ 84 v_subst_25) .cse24) (= (store (store .cse0 v_subst_25 (select .cse7 v_subst_25)) .cse24 (select .cse0 .cse24)) .cse7)))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_37| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_subst_28 Int) (v_subst_21 Int)) (let ((.cse26 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28) |c_~#cache~0.offset|))) (let ((.cse25 (store (store .cse0 v_subst_21 (select .cse7 v_subst_21)) v_subst_28 (select .cse7 v_subst_28))) (.cse27 (select .cse7 .cse26))) (and (= (store .cse25 .cse26 .cse27) .cse7) (= (select (let ((.cse28 (store .cse25 .cse26 (+ .cse27 1)))) (store (store .cse0 v_subst_21 (select .cse28 v_subst_21)) v_subst_28 (select .cse28 v_subst_28))) .cse26) .cse27) (<= (+ 84 v_subst_21) .cse26) (<= (+ v_subst_28 28) .cse26) (not (= v_subst_28 v_subst_21))))))))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (exists ((v_subst_24 Int) (v_prenex_2 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse29 (select .cse7 v_prenex_2))) (let ((.cse30 (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 .cse29)) (.cse31 (select .cse7 v_subst_24))) (and (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_prenex_2)) (= .cse29 (select (store .cse30 v_subst_24 (+ .cse31 1)) v_prenex_2)) (<= (+ 56 v_prenex_2) .cse32) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_subst_24)) (<= (+ v_subst_24 28) .cse32) (= (store .cse30 v_subst_24 .cse31) .cse7) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| 84) .cse32))))) (exists ((v_subst_26 Int) (v_prenex_3 Int)) (and (<= (+ 84 v_prenex_3) .cse32) (= .cse7 (store (store .cse0 v_prenex_3 (select .cse7 v_prenex_3)) v_subst_26 (select .cse7 v_subst_26))) (<= (+ 56 v_subst_26) .cse32))) (exists ((v_subst_28 Int) (v_subst_21 Int)) (and (= (store (store .cse0 v_subst_21 (select .cse7 v_subst_21)) v_subst_28 (select .cse7 v_subst_28)) .cse7) (<= (+ 84 v_subst_21) .cse32) (<= (+ v_subst_28 28) .cse32))) (exists ((v_subst_27 Int) (v_subst_22 Int)) (and (= (store (store .cse0 v_subst_22 (select .cse7 v_subst_22)) v_subst_27 (select .cse7 v_subst_27)) .cse7) (<= (+ 84 v_subst_27) .cse32) (<= (+ 56 v_subst_22) .cse32))) (exists ((v_subst_25 Int)) (and (<= (+ 84 v_subst_25) .cse32) (= (store .cse0 v_subst_25 (select .cse7 v_subst_25)) .cse7))) (exists ((v_prenex_4 Int) (v_subst_23 Int)) (and (= (store (store .cse0 v_prenex_4 (select .cse7 v_prenex_4)) v_subst_23 (select .cse7 v_subst_23)) .cse7) (<= (+ 84 v_prenex_4) .cse32) (<= (+ v_subst_23 28) .cse32) (not (= v_subst_23 v_prenex_4))))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse32) (or (exists ((v_subst_21 Int)) (and (<= (+ 56 v_subst_21) .cse32) (= (store .cse0 v_subst_21 (select .cse7 v_subst_21)) .cse7))) (exists ((v_subst_22 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (and (= (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_subst_22 (select .cse7 v_subst_22)) .cse7) (<= (+ v_subst_22 28) .cse32) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) .cse32)))) (= .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| 28) .cse32) (= (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) .cse7))) (or (exists ((v_subst_26 Int) (v_prenex_3 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int)) (let ((.cse37 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse36 (+ |~#cache~0.offset| .cse37))) (let ((.cse35 (store (store .cse0 v_prenex_3 (select .cse7 v_prenex_3)) v_subst_26 (select .cse7 v_subst_26))) (.cse33 (select .cse7 .cse36))) (and (= .cse33 (select (let ((.cse34 (store .cse35 .cse36 (+ .cse33 1)))) (store (store .cse0 v_prenex_3 (select .cse34 v_prenex_3)) v_subst_26 (select .cse34 v_subst_26))) .cse36)) (= (store .cse35 .cse36 .cse33) .cse7) (<= (+ 84 v_prenex_3) .cse36) (<= (+ |~#cache~0.offset| .cse37 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (not (= v_subst_26 v_prenex_3)) (<= (+ 56 v_subst_26) .cse36)))))) (exists ((v_prenex_6 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int)) (let ((.cse39 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse38 (+ |~#cache~0.offset| .cse39))) (and (= (store (store .cse0 v_prenex_6 (select .cse7 v_prenex_6)) .cse38 (select .cse0 .cse38)) .cse7) (<= (+ 84 v_prenex_6) .cse38) (<= (+ |~#cache~0.offset| .cse39 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) (exists ((v_subst_25 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int)) (let ((.cse41 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse40 (+ |~#cache~0.offset| .cse41))) (and (<= (+ 84 v_subst_25) .cse40) (<= (+ |~#cache~0.offset| .cse41 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store (store .cse0 v_subst_25 (select .cse7 v_subst_25)) .cse40 (select .cse0 .cse40)) .cse7))))) (exists ((v_prenex_4 Int) (v_subst_23 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int)) (let ((.cse46 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse42 (+ |~#cache~0.offset| .cse46))) (let ((.cse44 (store (store .cse0 v_prenex_4 (select .cse7 v_prenex_4)) v_subst_23 (select .cse7 v_subst_23))) (.cse45 (select .cse7 .cse42))) (and (<= (+ 84 v_prenex_4) .cse42) (<= (+ v_subst_23 28) .cse42) (= (select (let ((.cse43 (store .cse44 .cse42 (+ .cse45 1)))) (store (store .cse0 v_prenex_4 (select .cse43 v_prenex_4)) v_subst_23 (select .cse43 v_subst_23))) .cse42) .cse45) (not (= v_subst_23 v_prenex_4)) (= (store .cse44 .cse42 .cse45) .cse7) (<= (+ |~#cache~0.offset| .cse46 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (exists ((v_subst_28 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_subst_21 Int)) (let ((.cse50 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse48 (+ |~#cache~0.offset| .cse50))) (let ((.cse47 (store (store .cse0 v_subst_21 (select .cse7 v_subst_21)) v_subst_28 (select .cse7 v_subst_28))) (.cse49 (select .cse7 .cse48))) (and (= (store .cse47 .cse48 .cse49) .cse7) (<= (+ v_subst_28 28) .cse48) (<= (+ 84 v_subst_21) .cse48) (<= (+ |~#cache~0.offset| .cse50 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select (let ((.cse51 (store .cse47 .cse48 (+ .cse49 1)))) (store (store .cse0 v_subst_21 (select .cse51 v_subst_21)) v_subst_28 (select .cse51 v_subst_28))) .cse48) .cse49) (not (= v_subst_28 v_subst_21))))))) (exists ((v_prenex_5 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int)) (let ((.cse53 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse52 (+ |~#cache~0.offset| .cse53))) (and (<= (+ 84 v_prenex_5) .cse52) (= (store (store .cse0 v_prenex_5 (select .cse7 v_prenex_5)) .cse52 (select .cse0 .cse52)) .cse7) (<= (+ |~#cache~0.offset| .cse53 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) (exists ((v_subst_24 Int) (v_prenex_2 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse60 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse55 (+ |~#cache~0.offset| .cse60))) (let ((.cse54 (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 (select .cse7 v_prenex_2)) v_subst_24 (select .cse7 v_subst_24))) (.cse56 (select .cse7 .cse55))) (let ((.cse61 (store .cse54 .cse55 (+ .cse56 1)))) (let ((.cse59 (select .cse61 v_subst_24))) (let ((.cse57 (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse61 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 (select .cse61 v_prenex_2)) v_subst_24 .cse59))) (and (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_prenex_2)) (= (store .cse54 .cse55 .cse56) .cse7) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_subst_24)) (= (select .cse57 .cse55) .cse56) (let ((.cse58 (select .cse57 v_prenex_2))) (= .cse58 (select (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (select .cse57 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) v_prenex_2 .cse58) v_subst_24 (+ .cse59 1)) v_prenex_2))) (<= (+ |~#cache~0.offset| .cse60 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ v_subst_24 28) .cse55) (<= (+ 56 v_prenex_2) .cse55) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| 84) .cse55))))))))) (exists ((v_prenex_7 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int)) (let ((.cse63 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse62 (+ |~#cache~0.offset| .cse63))) (and (= (store (store .cse0 v_prenex_7 (select .cse7 v_prenex_7)) .cse62 (select .cse0 .cse62)) .cse7) (<= (+ |~#cache~0.offset| .cse63 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 84 v_prenex_7) .cse62))))) (exists ((v_subst_27 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_subst_22 Int)) (let ((.cse68 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse64 (+ |~#cache~0.offset| .cse68))) (let ((.cse67 (store (store .cse0 v_subst_22 (select .cse7 v_subst_22)) v_subst_27 (select .cse7 v_subst_27))) (.cse65 (select .cse7 .cse64))) (and (<= (+ 84 v_subst_27) .cse64) (= .cse65 (select (let ((.cse66 (store .cse67 .cse64 (+ .cse65 1)))) (store (store .cse0 v_subst_22 (select .cse66 v_subst_22)) v_subst_27 (select .cse66 v_subst_27))) .cse64)) (= (store .cse67 .cse64 .cse65) .cse7) (not (= v_subst_27 v_subst_22)) (<= (+ |~#cache~0.offset| .cse68 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 56 v_subst_22) .cse64))))))) (= |c_~#cache~0.base| 4))) is different from false [2024-10-17 04:45:39,652 WARN L286 SmtUtils]: Spent 30.44s on a formula simplification. DAG size of input: 255 DAG size of output: 298 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 04:45:41,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:45:43,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:45:45,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:45:49,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:45:51,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:45:53,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:45:56,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:46:00,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:46:02,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:46:06,263 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] Killed by 15