./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9a849f68 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/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 11:05:17,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 11:05:17,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-10-26 11:05:17,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 11:05:17,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 11:05:17,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 11:05:17,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 11:05:17,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 11:05:17,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 11:05:17,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 11:05:17,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 11:05:17,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 11:05:17,312 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 11:05:17,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 11:05:17,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 11:05:17,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 11:05:17,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 11:05:17,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 11:05:17,314 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 11:05:17,314 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 11:05:17,315 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 11:05:17,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 11:05:17,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 11:05:17,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 11:05:17,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 11:05:17,317 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 11:05:17,317 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 11:05:17,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 11:05:17,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 11:05:17,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 11:05:17,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 11:05:17,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 11:05:17,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 11:05:17,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 11:05:17,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 11:05:17,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 11:05:17,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 11:05:17,323 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 11:05:17,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 11:05:17,324 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 11:05:17,324 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 11:05:17,324 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2024-10-26 11:05:17,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 11:05:17,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 11:05:17,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 11:05:17,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 11:05:17,591 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 11:05:17,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-10-26 11:05:19,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 11:05:19,294 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 11:05:19,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-10-26 11:05:19,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/df28b4f08/1733f9210f7447eab92c8c41f9c86bd4/FLAGab5c9c8e2 [2024-10-26 11:05:19,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/df28b4f08/1733f9210f7447eab92c8c41f9c86bd4 [2024-10-26 11:05:19,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 11:05:19,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 11:05:19,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 11:05:19,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 11:05:19,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 11:05:19,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:05:19" (1/1) ... [2024-10-26 11:05:19,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da637ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:19, skipping insertion in model container [2024-10-26 11:05:19,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:05:19" (1/1) ... [2024-10-26 11:05:19,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 11:05:19,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 11:05:19,960 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 11:05:20,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 11:05:20,099 INFO L204 MainTranslator]: Completed translation [2024-10-26 11:05:20,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20 WrapperNode [2024-10-26 11:05:20,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 11:05:20,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 11:05:20,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 11:05:20,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 11:05:20,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,174 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 350 [2024-10-26 11:05:20,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 11:05:20,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 11:05:20,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 11:05:20,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 11:05:20,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 11:05:20,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 11:05:20,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 11:05:20,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 11:05:20,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (1/1) ... [2024-10-26 11:05:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 11:05:20,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:20,258 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-26 11:05:20,260 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-26 11:05:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 11:05:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 11:05:20,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 11:05:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 11:05:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 11:05:20,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 11:05:20,307 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 11:05:20,438 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 11:05:20,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 11:05:20,927 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 11:05:20,927 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 11:05:21,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 11:05:21,384 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-26 11:05:21,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:05:21 BoogieIcfgContainer [2024-10-26 11:05:21,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 11:05:21,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 11:05:21,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 11:05:21,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 11:05:21,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:05:19" (1/3) ... [2024-10-26 11:05:21,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e7bbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:05:21, skipping insertion in model container [2024-10-26 11:05:21,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:05:20" (2/3) ... [2024-10-26 11:05:21,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e7bbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:05:21, skipping insertion in model container [2024-10-26 11:05:21,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:05:21" (3/3) ... [2024-10-26 11:05:21,395 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-10-26 11:05:21,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 11:05:21,413 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-10-26 11:05:21,413 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 11:05:21,475 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 11:05:21,529 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:05:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:05:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:21,532 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-26 11:05:21,534 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-26 11:05:21,576 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:05:21,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 11:05:21,596 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=None, 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;@2d1046dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:05:21,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-26 11:05:21,917 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 9 treesize of output 3 [2024-10-26 11:05:21,921 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 9 treesize of output 3 [2024-10-26 11:05:21,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:21,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash -435966666, now seen corresponding path program 1 times [2024-10-26 11:05:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514269860] [2024-10-26 11:05:21,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514269860] [2024-10-26 11:05:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514269860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:05:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:05:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:05:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129496989] [2024-10-26 11:05:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:05:22,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:05:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:05:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:05:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:22,377 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:22,378 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-26 11:05:22,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:22,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 11:05:22,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash -69258264, now seen corresponding path program 1 times [2024-10-26 11:05:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610683177] [2024-10-26 11:05:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:22,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:22,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610683177] [2024-10-26 11:05:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610683177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976918260] [2024-10-26 11:05:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:22,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:22,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:22,625 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-26 11:05:22,627 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-26 11:05:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:22,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:05:22,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:22,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:22,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976918260] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:22,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:22,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:05:22,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654117722] [2024-10-26 11:05:22,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:05:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:05:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:05:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:22,816 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:22,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-26 11:05:22,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:22,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:22,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 11:05:23,092 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-26 11:05:23,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1646045562, now seen corresponding path program 2 times [2024-10-26 11:05:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269359736] [2024-10-26 11:05:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269359736] [2024-10-26 11:05:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269359736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740392621] [2024-10-26 11:05:23,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:05:23,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:23,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:23,302 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-26 11:05:23,305 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-26 11:05:23,414 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 11:05:23,414 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:05:23,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:05:23,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:23,493 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 11:05:23,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 11:05:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 11:05:23,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:05:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740392621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:05:23,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:05:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 11:05:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277458592] [2024-10-26 11:05:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:05:23,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 11:05:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 11:05:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-26 11:05:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:23,564 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:23,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-26 11:05:23,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:23,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:23,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:23,673 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 9 treesize of output 3 [2024-10-26 11:05:23,676 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 9 treesize of output 3 [2024-10-26 11:05:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:23,729 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-26 11:05:23,917 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-26 11:05:23,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1646045563, now seen corresponding path program 1 times [2024-10-26 11:05:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066527540] [2024-10-26 11:05:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:24,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066527540] [2024-10-26 11:05:24,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066527540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815750011] [2024-10-26 11:05:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:24,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:24,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:24,056 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-26 11:05:24,059 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-26 11:05:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:24,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:05:24,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:24,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:05:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815750011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:24,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:05:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802870130] [2024-10-26 11:05:24,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:24,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:05:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:05:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:05:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:24,250 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:24,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-26 11:05:24,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:24,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:24,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:24,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:24,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:24,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-26 11:05:24,529 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-26 11:05:24,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1794051397, now seen corresponding path program 2 times [2024-10-26 11:05:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:24,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010280399] [2024-10-26 11:05:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:24,854 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-26 11:05:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010280399] [2024-10-26 11:05:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010280399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:05:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:05:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:05:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477833570] [2024-10-26 11:05:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:05:24,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:05:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:05:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:05:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:24,857 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:24,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-26 11:05:24,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:24,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:24,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:24,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:24,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:24,985 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 9 treesize of output 3 [2024-10-26 11:05:24,987 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 9 treesize of output 3 [2024-10-26 11:05:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 11:05:25,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:25,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1366948472, now seen corresponding path program 1 times [2024-10-26 11:05:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603530956] [2024-10-26 11:05:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603530956] [2024-10-26 11:05:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603530956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812836431] [2024-10-26 11:05:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:25,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:25,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:25,711 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-26 11:05:25,713 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-26 11:05:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:25,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:05:25,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:25,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:25,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 11:05:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:26,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812836431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:26,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-10-26 11:05:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667590168] [2024-10-26 11:05:26,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:26,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:05:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:05:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-26 11:05:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:26,695 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:26,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 11:05:26,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:26,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:26,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:26,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:26,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:26,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:05:27,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 11:05:27,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-26 11:05:27,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1587533905, now seen corresponding path program 2 times [2024-10-26 11:05:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:27,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804043380] [2024-10-26 11:05:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804043380] [2024-10-26 11:05:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804043380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217378432] [2024-10-26 11:05:28,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:05:28,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:28,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:28,420 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-26 11:05:28,422 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-26 11:05:28,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:05:28,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:05:28,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 11:05:28,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:28,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:28,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 11:05:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:29,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217378432] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:30,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2024-10-26 11:05:30,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64978955] [2024-10-26 11:05:30,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:30,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-26 11:05:30,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:30,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-26 11:05:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-10-26 11:05:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:30,192 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 11.2) internal successors, (336), 30 states have internal predecessors, (336), 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-26 11:05:30,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:30,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:30,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:30,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:30,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:30,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:05:30,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:05:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:05:31,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-26 11:05:31,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:31,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:31,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:31,741 INFO L85 PathProgramCache]: Analyzing trace with hash -336567011, now seen corresponding path program 3 times [2024-10-26 11:05:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986552554] [2024-10-26 11:05:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 953 proven. 217 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986552554] [2024-10-26 11:05:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986552554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439146301] [2024-10-26 11:05:32,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:05:32,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:32,405 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-26 11:05:32,406 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-26 11:05:32,624 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 11:05:32,625 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:05:32,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:05:32,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:32,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:32,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 11:05:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 217 proven. 80 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:05:33,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:05:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439146301] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:35,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 25 [2024-10-26 11:05:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324583198] [2024-10-26 11:05:35,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:35,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-26 11:05:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-26 11:05:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-26 11:05:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:35,190 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.36) internal successors, (384), 25 states have internal predecessors, (384), 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-26 11:05:35,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:35,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:35,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:35,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:35,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:35,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:05:35,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:05:35,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:37,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-26 11:05:37,870 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,SelfDestructingSolverStorable7 [2024-10-26 11:05:37,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:37,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash 490056177, now seen corresponding path program 1 times [2024-10-26 11:05:37,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:37,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724447] [2024-10-26 11:05:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:37,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-10-26 11:05:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724447] [2024-10-26 11:05:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:05:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:05:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 11:05:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002537331] [2024-10-26 11:05:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:05:38,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:05:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:05:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:05:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:38,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:38,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-26 11:05:38,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:38,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:38,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:38,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:38,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:38,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:38,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:38,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:38,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:38,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 11:05:38,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash -944669885, now seen corresponding path program 1 times [2024-10-26 11:05:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945661176] [2024-10-26 11:05:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-10-26 11:05:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945661176] [2024-10-26 11:05:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945661176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808445564] [2024-10-26 11:05:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:38,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:38,507 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-26 11:05:38,509 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-26 11:05:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:38,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 11:05:38,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2024-10-26 11:05:38,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:05:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808445564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:05:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:05:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-26 11:05:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693088442] [2024-10-26 11:05:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:05:38,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:05:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:05:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 11:05:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:38,845 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:38,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:38,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:38,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:38,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:38,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:39,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-26 11:05:39,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:39,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:39,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1139599449, now seen corresponding path program 1 times [2024-10-26 11:05:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403516467] [2024-10-26 11:05:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403516467] [2024-10-26 11:05:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403516467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649770607] [2024-10-26 11:05:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:45,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:45,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:45,790 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:05:45,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-26 11:05:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:46,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-26 11:05:46,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:46,168 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:05:46,169 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-26 11:05:46,202 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 16 treesize of output 11 [2024-10-26 11:05:46,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:46,363 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 23 treesize of output 11 [2024-10-26 11:05:46,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:46,421 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 23 treesize of output 11 [2024-10-26 11:05:46,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:46,586 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 23 treesize of output 11 [2024-10-26 11:05:46,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:46,653 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 23 treesize of output 11 [2024-10-26 11:05:46,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:46,834 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 23 treesize of output 11 [2024-10-26 11:05:46,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:46,892 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 23 treesize of output 11 [2024-10-26 11:05:47,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,086 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 23 treesize of output 11 [2024-10-26 11:05:47,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:05:47,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,349 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 23 treesize of output 11 [2024-10-26 11:05:47,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,437 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 23 treesize of output 11 [2024-10-26 11:05:47,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,681 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 23 treesize of output 11 [2024-10-26 11:05:47,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,747 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 23 treesize of output 11 [2024-10-26 11:05:47,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,915 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 23 treesize of output 11 [2024-10-26 11:05:47,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:47,971 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 23 treesize of output 11 [2024-10-26 11:05:48,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:48,145 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 23 treesize of output 11 [2024-10-26 11:05:48,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:48,197 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 23 treesize of output 11 [2024-10-26 11:05:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:48,370 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 23 treesize of output 11 [2024-10-26 11:05:48,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:05:48,433 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 23 treesize of output 11 [2024-10-26 11:05:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:48,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:50,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1734 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1734) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:05:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:05:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649770607] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:50,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2024-10-26 11:05:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181577672] [2024-10-26 11:05:50,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:50,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 11:05:50,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 11:05:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4513, Unknown=1, NotChecked=136, Total=4970 [2024-10-26 11:05:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:50,213 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:50,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 9.704225352112676) internal successors, (689), 70 states have internal predecessors, (689), 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-26 11:05:50,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:50,550 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 9 treesize of output 3 [2024-10-26 11:05:50,552 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 9 treesize of output 3 [2024-10-26 11:05:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:05:56,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-26 11:05:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:56,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1745932176, now seen corresponding path program 1 times [2024-10-26 11:05:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218365549] [2024-10-26 11:05:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-26 11:05:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218365549] [2024-10-26 11:05:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218365549] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573227559] [2024-10-26 11:05:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:57,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:57,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:57,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:05:57,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-26 11:05:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:57,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:05:57,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:05:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-26 11:05:57,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:05:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-26 11:05:57,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573227559] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:05:57,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:05:57,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-26 11:05:57,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957546447] [2024-10-26 11:05:57,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:05:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:05:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:05:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:05:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:05:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:57,917 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:05:57,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-26 11:05:57,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:57,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:05:57,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:58,365 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 9 treesize of output 3 [2024-10-26 11:05:58,367 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 9 treesize of output 3 [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:05:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:58,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-26 11:05:58,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-26 11:05:58,707 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:58,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1605649194, now seen corresponding path program 2 times [2024-10-26 11:05:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515812531] [2024-10-26 11:05:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515812531] [2024-10-26 11:06:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515812531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123946173] [2024-10-26 11:06:02,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:06:02,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:02,406 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:02,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-26 11:06:02,693 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:06:02,693 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:02,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-10-26 11:06:02,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:02,780 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:02,780 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-26 11:06:02,812 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 16 treesize of output 11 [2024-10-26 11:06:02,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:02,962 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 23 treesize of output 11 [2024-10-26 11:06:03,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,038 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 23 treesize of output 11 [2024-10-26 11:06:03,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,241 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 23 treesize of output 11 [2024-10-26 11:06:03,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,295 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 23 treesize of output 11 [2024-10-26 11:06:03,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,454 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 23 treesize of output 11 [2024-10-26 11:06:03,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,512 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 23 treesize of output 11 [2024-10-26 11:06:03,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,672 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 23 treesize of output 11 [2024-10-26 11:06:03,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,730 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 23 treesize of output 11 [2024-10-26 11:06:03,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,898 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 23 treesize of output 11 [2024-10-26 11:06:03,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:03,954 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 23 treesize of output 11 [2024-10-26 11:06:04,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:04,121 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 23 treesize of output 11 [2024-10-26 11:06:04,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:04,176 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 23 treesize of output 11 [2024-10-26 11:06:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:04,359 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 23 treesize of output 11 [2024-10-26 11:06:04,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:04,418 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 23 treesize of output 11 [2024-10-26 11:06:04,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:04,581 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 23 treesize of output 11 [2024-10-26 11:06:04,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:04,636 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 23 treesize of output 11 [2024-10-26 11:06:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:04,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:06,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2439) |c_~#cache~0.base|) (+ 224 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:06:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123946173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:06,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:06,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2024-10-26 11:06:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935191031] [2024-10-26 11:06:06,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:06,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-26 11:06:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:06,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-26 11:06:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3745, Unknown=1, NotChecked=124, Total=4160 [2024-10-26 11:06:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:06,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:06,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 9.507692307692308) internal successors, (618), 64 states have internal predecessors, (618), 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-26 11:06:06,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:06,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:06,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:06,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:06:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:09,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-26 11:06:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:09,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1297479763, now seen corresponding path program 3 times [2024-10-26 11:06:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652236270] [2024-10-26 11:06:09,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652236270] [2024-10-26 11:06:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652236270] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198578973] [2024-10-26 11:06:11,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:06:11,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:11,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:11,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:11,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-26 11:06:14,949 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-26 11:06:14,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:14,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-26 11:06:14,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:15,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:15,061 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-26 11:06:15,096 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 23 treesize of output 16 [2024-10-26 11:06:15,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:15,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:15,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:15,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:15,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:15,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:16,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:16,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:16,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:16,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:16,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:06:16,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-26 11:06:16,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-26 11:06:17,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:17,040 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 23 treesize of output 11 [2024-10-26 11:06:17,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:17,117 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 23 treesize of output 11 [2024-10-26 11:06:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:17,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:18,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2752) |c_~#cache~0.base|) (+ 196 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:06:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198578973] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:18,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 21] total 61 [2024-10-26 11:06:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621954197] [2024-10-26 11:06:18,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:18,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-26 11:06:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-26 11:06:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3360, Unknown=1, NotChecked=118, Total=3782 [2024-10-26 11:06:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:18,427 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:18,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.790322580645162) internal successors, (545), 61 states have internal predecessors, (545), 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-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:18,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:18,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:18,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:18,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:06:18,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:18,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:18,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:18,600 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 9 treesize of output 3 [2024-10-26 11:06:18,602 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 9 treesize of output 3 [2024-10-26 11:06:20,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-26 11:06:20,425 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 9 treesize of output 3 [2024-10-26 11:06:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:06:21,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-26 11:06:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-26 11:06:21,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash 334456112, now seen corresponding path program 4 times [2024-10-26 11:06:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122034749] [2024-10-26 11:06:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122034749] [2024-10-26 11:06:23,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122034749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681300849] [2024-10-26 11:06:23,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 11:06:23,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:23,270 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:23,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-26 11:06:24,507 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 11:06:24,507 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:24,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-26 11:06:24,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:24,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:24,598 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-26 11:06:24,625 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 16 treesize of output 11 [2024-10-26 11:06:24,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:24,765 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 23 treesize of output 11 [2024-10-26 11:06:24,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:24,822 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 23 treesize of output 11 [2024-10-26 11:06:24,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:24,978 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 23 treesize of output 11 [2024-10-26 11:06:25,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,031 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 23 treesize of output 11 [2024-10-26 11:06:25,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:06:25,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,240 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 23 treesize of output 11 [2024-10-26 11:06:25,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,396 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 23 treesize of output 11 [2024-10-26 11:06:25,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,464 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 23 treesize of output 11 [2024-10-26 11:06:25,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,653 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 23 treesize of output 11 [2024-10-26 11:06:25,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,705 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 23 treesize of output 11 [2024-10-26 11:06:25,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,858 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 23 treesize of output 11 [2024-10-26 11:06:25,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:25,917 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 23 treesize of output 11 [2024-10-26 11:06:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:26,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681300849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:26,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2024-10-26 11:06:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095243898] [2024-10-26 11:06:26,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:26,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-26 11:06:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:26,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-26 11:06:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2507, Unknown=17, NotChecked=0, Total=2756 [2024-10-26 11:06:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:26,966 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:26,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 8.924528301886792) internal successors, (473), 52 states have internal predecessors, (473), 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-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:26,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:06:26,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:26,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:26,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:06:26,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 11:06:30,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-26 11:06:30,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-26 11:06:30,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:30,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 39119670, now seen corresponding path program 5 times [2024-10-26 11:06:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551432511] [2024-10-26 11:06:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551432511] [2024-10-26 11:06:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551432511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496730961] [2024-10-26 11:06:31,700 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 11:06:31,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:31,701 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:31,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-26 11:06:32,871 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-26 11:06:32,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:32,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-26 11:06:32,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:32,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:32,950 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-26 11:06:32,975 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 16 treesize of output 11 [2024-10-26 11:06:33,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,112 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 23 treesize of output 11 [2024-10-26 11:06:33,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,169 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 23 treesize of output 11 [2024-10-26 11:06:33,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,353 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 23 treesize of output 11 [2024-10-26 11:06:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,407 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 23 treesize of output 11 [2024-10-26 11:06:33,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,558 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 23 treesize of output 11 [2024-10-26 11:06:33,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,617 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 23 treesize of output 11 [2024-10-26 11:06:33,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,773 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 23 treesize of output 11 [2024-10-26 11:06:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:33,828 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 23 treesize of output 11 [2024-10-26 11:06:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:33,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:34,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3238) |c_~#cache~0.base|) (+ 112 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:06:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:34,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496730961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:34,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:34,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-10-26 11:06:34,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830037575] [2024-10-26 11:06:34,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:34,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-26 11:06:34,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-26 11:06:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1393, Unknown=1, NotChecked=76, Total=1640 [2024-10-26 11:06:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:34,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:34,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.024390243902438) internal successors, (329), 40 states have internal predecessors, (329), 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-26 11:06:34,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:34,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:34,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:34,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:34,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:06:34,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 11:06:34,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:06:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:36,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-26 11:06:36,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-26 11:06:36,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:36,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash -764734535, now seen corresponding path program 6 times [2024-10-26 11:06:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087134133] [2024-10-26 11:06:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087134133] [2024-10-26 11:06:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087134133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552113378] [2024-10-26 11:06:37,405 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 11:06:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:37,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:37,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:37,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-26 11:06:37,878 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-26 11:06:37,878 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:37,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-26 11:06:37,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:37,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:37,955 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-26 11:06:37,980 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 16 treesize of output 11 [2024-10-26 11:06:38,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:38,117 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 23 treesize of output 11 [2024-10-26 11:06:38,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:38,173 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 23 treesize of output 11 [2024-10-26 11:06:38,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:38,318 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 23 treesize of output 11 [2024-10-26 11:06:38,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:38,374 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 23 treesize of output 11 [2024-10-26 11:06:38,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:38,518 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 23 treesize of output 11 [2024-10-26 11:06:38,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:38,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:06:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:38,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552113378] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:39,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-26 11:06:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298445951] [2024-10-26 11:06:39,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:39,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 11:06:39,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:39,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 11:06:39,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1041, Unknown=7, NotChecked=0, Total=1190 [2024-10-26 11:06:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:39,154 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:39,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.3428571428571425) internal successors, (257), 34 states have internal predecessors, (257), 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-26 11:06:39,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:39,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:39,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:39,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 11:06:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 11:06:40,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-26 11:06:40,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-26 11:06:40,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:40,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 918345020, now seen corresponding path program 7 times [2024-10-26 11:06:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558326956] [2024-10-26 11:06:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558326956] [2024-10-26 11:06:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558326956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963751327] [2024-10-26 11:06:41,472 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-26 11:06:41,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:41,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:41,473 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:41,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-26 11:06:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:41,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-26 11:06:41,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:41,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:41,783 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-26 11:06:41,805 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 16 treesize of output 11 [2024-10-26 11:06:41,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:41,927 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 23 treesize of output 11 [2024-10-26 11:06:41,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:41,988 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 23 treesize of output 11 [2024-10-26 11:06:42,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:42,135 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 23 treesize of output 11 [2024-10-26 11:06:42,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:42,192 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 23 treesize of output 11 [2024-10-26 11:06:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:42,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:42,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963751327] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:42,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 11:06:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561997727] [2024-10-26 11:06:42,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:42,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 11:06:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 11:06:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=690, Unknown=10, NotChecked=0, Total=812 [2024-10-26 11:06:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:42,615 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:42,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.413793103448276) internal successors, (186), 28 states have internal predecessors, (186), 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-26 11:06:42,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:42,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:42,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:42,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:42,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:42,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 11:06:42,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 11:06:42,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 11:06:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 11:06:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:44,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-26 11:06:44,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-26 11:06:44,262 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:44,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 323301311, now seen corresponding path program 8 times [2024-10-26 11:06:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348510555] [2024-10-26 11:06:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:44,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:44,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348510555] [2024-10-26 11:06:44,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348510555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:44,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13837903] [2024-10-26 11:06:44,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:06:44,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:44,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:44,853 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:44,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-26 11:06:45,104 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:06:45,104 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:45,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-26 11:06:45,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:45,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:45,178 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-26 11:06:45,204 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 16 treesize of output 11 [2024-10-26 11:06:45,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:45,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:06:45,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:45,419 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 23 treesize of output 11 [2024-10-26 11:06:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:45,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:45,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3637) |c_~#cache~0.base|) (+ 28 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:06:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13837903] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:45,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-26 11:06:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555210996] [2024-10-26 11:06:45,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-26 11:06:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-26 11:06:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=515, Unknown=1, NotChecked=46, Total=650 [2024-10-26 11:06:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:45,725 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:45,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:45,834 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 9 treesize of output 3 [2024-10-26 11:06:45,837 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 9 treesize of output 3 [2024-10-26 11:06:46,275 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 9 treesize of output 3 [2024-10-26 11:06:46,276 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 9 treesize of output 3 [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:06:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:47,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-26 11:06:47,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:47,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:47,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash -855694526, now seen corresponding path program 1 times [2024-10-26 11:06:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671090104] [2024-10-26 11:06:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:47,821 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-26 11:06:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671090104] [2024-10-26 11:06:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671090104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:06:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:06:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-26 11:06:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419496167] [2024-10-26 11:06:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:06:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-26 11:06:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:47,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-26 11:06:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-26 11:06:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:47,823 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:47,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:06:47,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:47,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:06:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 11:06:48,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:48,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2043368256, now seen corresponding path program 1 times [2024-10-26 11:06:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:48,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963587295] [2024-10-26 11:06:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:48,561 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-26 11:06:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963587295] [2024-10-26 11:06:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963587295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380155109] [2024-10-26 11:06:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:48,564 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-26 11:06:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:48,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-26 11:06:48,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:49,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:06:49,020 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-26 11:06:49,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 23 treesize of output 16 [2024-10-26 11:06:49,170 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 23 treesize of output 16 [2024-10-26 11:06:49,194 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-26 11:06:49,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:49,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3731 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3731) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-26 11:06:49,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3731 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3731) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) is different from false [2024-10-26 11:06:49,299 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-26 11:06:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380155109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:49,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-26 11:06:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582158878] [2024-10-26 11:06:49,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:49,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-26 11:06:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-26 11:06:49,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=225, Unknown=2, NotChecked=62, Total=342 [2024-10-26 11:06:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:49,301 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:49,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 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-26 11:06:49,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:06:49,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:06:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:06:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:06:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:06:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 11:06:49,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2024-10-26 11:06:49,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2024-10-26 11:06:49,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-26 11:06:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-26 11:06:50,122 INFO L407 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-26 11:06:50,124 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-10-26 11:06:50,128 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:06:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:06:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:50,133 INFO L229 MonitoredProcess]: Starting monitored process 20 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-26 11:06:50,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-10-26 11:06:50,138 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:06:50,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 11:06:50,139 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=None, 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;@2d1046dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:06:50,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-26 11:06:50,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:06:50,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash 4521519, now seen corresponding path program 1 times [2024-10-26 11:06:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:50,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64181484] [2024-10-26 11:06:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64181484] [2024-10-26 11:06:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64181484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:06:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:06:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:06:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50579601] [2024-10-26 11:06:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:06:50,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:06:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:06:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:06:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:50,243 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:50,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-26 11:06:50,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:50,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 11:06:50,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:06:50,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash 492773021, now seen corresponding path program 1 times [2024-10-26 11:06:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894660624] [2024-10-26 11:06:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894660624] [2024-10-26 11:06:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894660624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472830244] [2024-10-26 11:06:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:50,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:50,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:50,300 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:50,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-26 11:06:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:50,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:06:50,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:50,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472830244] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:50,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:06:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505920629] [2024-10-26 11:06:50,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:50,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:06:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:06:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:06:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:50,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-26 11:06:50,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:50,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:50,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-26 11:06:50,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-26 11:06:50,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:06:50,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2046776913, now seen corresponding path program 2 times [2024-10-26 11:06:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842299578] [2024-10-26 11:06:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:50,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:50,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842299578] [2024-10-26 11:06:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842299578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:50,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427115163] [2024-10-26 11:06:50,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:06:50,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:50,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:50,812 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:50,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-26 11:06:51,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:06:51,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:51,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:06:51,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:51,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:06:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427115163] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:51,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:06:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784191464] [2024-10-26 11:06:51,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:06:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:06:51,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:06:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:51,094 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:51,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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-26 11:06:51,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:51,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:51,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:51,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-26 11:06:51,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:51,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:06:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -214637841, now seen corresponding path program 3 times [2024-10-26 11:06:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693469516] [2024-10-26 11:06:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 11:06:51,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 11:06:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 11:06:51,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 11:06:51,372 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 11:06:51,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2024-10-26 11:06:51,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2024-10-26 11:06:51,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2024-10-26 11:06:51,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2024-10-26 11:06:51,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2024-10-26 11:06:51,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (20 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2024-10-26 11:06:51,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 28 remaining) [2024-10-26 11:06:51,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (3 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2024-10-26 11:06:51,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (0 of 28 remaining) [2024-10-26 11:06:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 11:06:51,379 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-26 11:06:51,379 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-26 11:06:51,380 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 11:06:51,380 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 11:06:51,406 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 11:06:51,409 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:06:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:06:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:51,411 INFO L229 MonitoredProcess]: Starting monitored process 23 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-26 11:06:51,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-10-26 11:06:51,417 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:06:51,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-26 11:06:51,418 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=None, 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;@2d1046dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:06:51,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-26 11:06:51,508 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 9 treesize of output 3 [2024-10-26 11:06:51,510 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 9 treesize of output 3 [2024-10-26 11:06:51,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:51,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash -962778151, now seen corresponding path program 1 times [2024-10-26 11:06:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:51,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40124572] [2024-10-26 11:06:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:51,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40124572] [2024-10-26 11:06:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40124572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:06:51,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:06:51,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:06:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750070949] [2024-10-26 11:06:51,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:06:51,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:06:51,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:51,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:06:51,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:06:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:51,553 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:51,553 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-26 11:06:51,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 11:06:51,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:51,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2120031515, now seen corresponding path program 1 times [2024-10-26 11:06:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490024473] [2024-10-26 11:06:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:51,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490024473] [2024-10-26 11:06:51,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490024473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:51,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262604855] [2024-10-26 11:06:51,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:51,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:51,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:51,608 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:51,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-26 11:06:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:51,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:06:51,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:51,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262604855] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:51,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:51,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:06:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291805365] [2024-10-26 11:06:51,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:51,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:06:51,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:06:51,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:06:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:51,847 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-26 11:06:51,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:51,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:51,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-10-26 11:06:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-26 11:06:52,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1505182414, now seen corresponding path program 2 times [2024-10-26 11:06:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020967332] [2024-10-26 11:06:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:52,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020967332] [2024-10-26 11:06:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020967332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502662778] [2024-10-26 11:06:52,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:06:52,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:52,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:52,211 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:52,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-26 11:06:52,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 11:06:52,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:52,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:06:52,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:52,453 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 11:06:52,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 11:06:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 11:06:52,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:06:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502662778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:06:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:06:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 11:06:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971187341] [2024-10-26 11:06:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:06:52,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 11:06:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 11:06:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-26 11:06:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:52,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:52,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-26 11:06:52,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:52,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:52,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:52,546 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 9 treesize of output 3 [2024-10-26 11:06:52,548 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 9 treesize of output 3 [2024-10-26 11:06:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:52,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-10-26 11:06:52,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:52,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:52,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1505182415, now seen corresponding path program 1 times [2024-10-26 11:06:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976524908] [2024-10-26 11:06:52,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:52,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:52,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976524908] [2024-10-26 11:06:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976524908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296182214] [2024-10-26 11:06:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:52,836 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:52,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-26 11:06:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:53,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:06:53,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:53,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:06:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296182214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:53,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:06:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637861337] [2024-10-26 11:06:53,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:53,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:06:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:06:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:06:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:53,102 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-26 11:06:53,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:53,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:53,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:53,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:53,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-26 11:06:53,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-26 11:06:53,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash -749110417, now seen corresponding path program 2 times [2024-10-26 11:06:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:53,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150069505] [2024-10-26 11:06:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:53,530 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-26 11:06:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150069505] [2024-10-26 11:06:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150069505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:06:53,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:06:53,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:06:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713995942] [2024-10-26 11:06:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:06:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:06:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:06:53,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:06:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:53,533 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:53,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-26 11:06:53,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:53,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:53,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:53,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:53,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:53,629 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 9 treesize of output 3 [2024-10-26 11:06:53,632 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 9 treesize of output 3 [2024-10-26 11:06:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-26 11:06:53,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1625093716, now seen corresponding path program 1 times [2024-10-26 11:06:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948085808] [2024-10-26 11:06:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948085808] [2024-10-26 11:06:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948085808] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788956377] [2024-10-26 11:06:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:54,053 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:54,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-26 11:06:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:54,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:06:54,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:54,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:54,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 11:06:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:54,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788956377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:54,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-10-26 11:06:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908378637] [2024-10-26 11:06:54,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:54,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:06:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:06:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-26 11:06:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:54,928 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:54,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 11:06:54,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:54,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:54,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:54,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:54,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:54,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:06:55,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-26 11:06:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:55,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1239796323, now seen corresponding path program 2 times [2024-10-26 11:06:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200255800] [2024-10-26 11:06:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200255800] [2024-10-26 11:06:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200255800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105365701] [2024-10-26 11:06:56,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:06:56,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:56,065 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:56,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-26 11:06:56,358 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:06:56,358 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:56,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 11:06:56,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:56,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 11:06:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:57,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:06:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105365701] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:06:57,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:06:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2024-10-26 11:06:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416333873] [2024-10-26 11:06:57,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:06:57,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-26 11:06:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:06:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-26 11:06:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-10-26 11:06:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:57,563 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:06:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 11.2) internal successors, (336), 30 states have internal predecessors, (336), 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-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:06:57,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:06:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:06:58,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-26 11:06:58,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:58,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:06:58,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:06:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash 75017937, now seen corresponding path program 3 times [2024-10-26 11:06:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:06:58,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447504817] [2024-10-26 11:06:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:06:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:06:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:06:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 953 proven. 217 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:06:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:06:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447504817] [2024-10-26 11:06:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447504817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:06:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993466373] [2024-10-26 11:06:59,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:06:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:06:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:06:59,269 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:06:59,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-26 11:06:59,604 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 11:06:59,604 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:06:59,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:06:59,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:06:59,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:06:59,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 11:07:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 217 proven. 80 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:07:00,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:07:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:07:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993466373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:07:01,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:07:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 25 [2024-10-26 11:07:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883697647] [2024-10-26 11:07:01,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:07:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-26 11:07:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:07:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-26 11:07:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-26 11:07:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:01,552 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:07:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.36) internal successors, (384), 25 states have internal predecessors, (384), 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-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:07:01,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:02,451 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 9 treesize of output 3 [2024-10-26 11:07:02,453 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 9 treesize of output 3 [2024-10-26 11:07:02,456 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 9 treesize of output 3 [2024-10-26 11:07:02,458 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 9 treesize of output 3 [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:04,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-10-26 11:07:04,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:07:04,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:07:04,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:07:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -959679783, now seen corresponding path program 1 times [2024-10-26 11:07:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:07:04,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362147569] [2024-10-26 11:07:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:07:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2024-10-26 11:07:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:07:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362147569] [2024-10-26 11:07:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362147569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:07:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:07:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 11:07:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10125436] [2024-10-26 11:07:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:07:04,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:07:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:07:04,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:07:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:07:04,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:04,784 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:07:04,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-26 11:07:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:04,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:04,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:04,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:04,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:04,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:04,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:04,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-26 11:07:04,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:07:04,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:07:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash -474452309, now seen corresponding path program 1 times [2024-10-26 11:07:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:07:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393167915] [2024-10-26 11:07:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:07:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2024-10-26 11:07:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:07:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393167915] [2024-10-26 11:07:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393167915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:07:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531038062] [2024-10-26 11:07:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:05,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:07:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:07:05,133 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:07:05,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-26 11:07:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:05,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 11:07:05,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:07:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2024-10-26 11:07:05,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:07:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531038062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:07:05,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:07:05,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-26 11:07:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911384173] [2024-10-26 11:07:05,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:07:05,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:07:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:07:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:07:05,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 11:07:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:05,601 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:07:05,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-26 11:07:05,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:05,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:06,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-10-26 11:07:06,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:07:06,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:07:06,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:07:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2141272901, now seen corresponding path program 1 times [2024-10-26 11:07:06,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:07:06,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791197247] [2024-10-26 11:07:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:07:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:07:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:07:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791197247] [2024-10-26 11:07:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791197247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:07:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672503709] [2024-10-26 11:07:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:11,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:07:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:07:11,070 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:07:11,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-26 11:07:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:11,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-26 11:07:11,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:07:11,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:07:11,567 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-26 11:07:11,601 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 16 treesize of output 11 [2024-10-26 11:07:11,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:11,754 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 23 treesize of output 11 [2024-10-26 11:07:11,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:11,809 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 23 treesize of output 11 [2024-10-26 11:07:11,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:11,981 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 23 treesize of output 11 [2024-10-26 11:07:12,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,043 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 23 treesize of output 11 [2024-10-26 11:07:12,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,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 23 treesize of output 11 [2024-10-26 11:07:12,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:07:12,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,421 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 23 treesize of output 11 [2024-10-26 11:07:12,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,477 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 23 treesize of output 11 [2024-10-26 11:07:12,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,642 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 23 treesize of output 11 [2024-10-26 11:07:12,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,694 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 23 treesize of output 11 [2024-10-26 11:07:12,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,863 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 23 treesize of output 11 [2024-10-26 11:07:12,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:12,916 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 23 treesize of output 11 [2024-10-26 11:07:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:13,081 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 23 treesize of output 11 [2024-10-26 11:07:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:13,139 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 23 treesize of output 11 [2024-10-26 11:07:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:13,307 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 23 treesize of output 11 [2024-10-26 11:07:13,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:13,363 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 23 treesize of output 11 [2024-10-26 11:07:13,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:13,530 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 23 treesize of output 11 [2024-10-26 11:07:13,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:13,587 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 23 treesize of output 11 [2024-10-26 11:07:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:07:13,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:07:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:07:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672503709] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:07:15,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:07:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2024-10-26 11:07:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130738537] [2024-10-26 11:07:15,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:07:15,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 11:07:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:07:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 11:07:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=4631, Unknown=17, NotChecked=0, Total=4970 [2024-10-26 11:07:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:15,361 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:07:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 9.704225352112676) internal successors, (689), 70 states have internal predecessors, (689), 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-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:15,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:15,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:15,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:15,573 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 9 treesize of output 3 [2024-10-26 11:07:15,574 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 9 treesize of output 3 [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:07:21,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-10-26 11:07:22,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-26 11:07:22,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:07:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:07:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1451677776, now seen corresponding path program 1 times [2024-10-26 11:07:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:07:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415237493] [2024-10-26 11:07:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:07:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-10-26 11:07:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:07:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415237493] [2024-10-26 11:07:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415237493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:07:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318117845] [2024-10-26 11:07:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:07:22,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:07:22,546 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:07:22,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-26 11:07:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:22,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-26 11:07:22,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:07:23,434 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 11 treesize of output 7 [2024-10-26 11:07:23,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:23,490 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 16 treesize of output 11 [2024-10-26 11:07:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-10-26 11:07:23,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:07:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318117845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:07:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:07:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-26 11:07:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385014994] [2024-10-26 11:07:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:07:23,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 11:07:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:07:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 11:07:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-26 11:07:23,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:23,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:07:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:07:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:07:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:07:33,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-10-26 11:07:33,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-26 11:07:33,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:07:33,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:07:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1372589789, now seen corresponding path program 1 times [2024-10-26 11:07:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:07:33,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697583353] [2024-10-26 11:07:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:07:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:07:39,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:07:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697583353] [2024-10-26 11:07:39,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697583353] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:07:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188897661] [2024-10-26 11:07:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:07:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:07:39,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:07:39,241 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:07:39,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-26 11:07:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:07:39,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-10-26 11:07:39,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:07:39,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:07:39,787 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-26 11:07:39,820 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 16 treesize of output 11 [2024-10-26 11:07:39,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:39,984 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 23 treesize of output 11 [2024-10-26 11:07:40,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,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 23 treesize of output 11 [2024-10-26 11:07:40,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,247 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 23 treesize of output 11 [2024-10-26 11:07:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,313 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 23 treesize of output 11 [2024-10-26 11:07:40,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,510 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 23 treesize of output 11 [2024-10-26 11:07:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,606 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 23 treesize of output 11 [2024-10-26 11:07:40,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,829 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 23 treesize of output 11 [2024-10-26 11:07:40,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:40,897 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 23 treesize of output 11 [2024-10-26 11:07:41,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:41,097 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 23 treesize of output 11 [2024-10-26 11:07:41,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:41,169 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 23 treesize of output 11 [2024-10-26 11:07:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:41,388 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 23 treesize of output 11 [2024-10-26 11:07:41,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:41,469 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 23 treesize of output 11 [2024-10-26 11:07:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:41,745 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 23 treesize of output 11 [2024-10-26 11:07:41,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:41,818 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 23 treesize of output 11 [2024-10-26 11:07:42,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:42,020 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 23 treesize of output 11 [2024-10-26 11:07:42,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:42,092 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 23 treesize of output 11 [2024-10-26 11:07:42,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:42,303 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 23 treesize of output 11 [2024-10-26 11:07:42,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:42,369 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 23 treesize of output 11 [2024-10-26 11:07:42,540 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 16 treesize of output 11 [2024-10-26 11:07:42,574 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 16 treesize of output 11 [2024-10-26 11:07:42,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:07:42,750 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 23 treesize of output 11 [2024-10-26 11:07:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 5 proven. 911 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:07:42,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:07:43,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)))) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|))) is different from false [2024-10-26 11:07:43,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0))) is different from false [2024-10-26 11:07:43,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))))) is different from false [2024-10-26 11:07:43,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 28 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:07:43,674 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:07:43,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6350)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:07:43,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:07:43,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:07:43,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6347)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:07:44,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:07:44,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:07:44,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6342)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse1 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:07:44,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:07:44,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:07:44,983 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6339)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:07:45,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:07:45,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:07:45,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6334)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:07:46,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:07:46,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:07:46,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6331)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:07:47,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|)))) is different from false [2024-10-26 11:07:47,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:07:47,505 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6326)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:07:48,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:07:48,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:07:48,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= 0 (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6322)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|))) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:07:49,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|)))) is different from false [2024-10-26 11:07:49,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|))) is different from false [2024-10-26 11:07:49,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|))) is different from false [2024-10-26 11:07:49,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (v_ArrVal_6319 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6319) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|))) is different from false [2024-10-26 11:07:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 916 not checked. [2024-10-26 11:07:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188897661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:07:50,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:07:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 39] total 93 [2024-10-26 11:07:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109584634] [2024-10-26 11:07:50,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:07:50,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-10-26 11:07:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:07:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-10-26 11:07:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=3654, Unknown=41, NotChecked=4712, Total=8742 [2024-10-26 11:07:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:07:50,214 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:07:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 7.946808510638298) internal successors, (747), 93 states have internal predecessors, (747), 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-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:07:50,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:07:50,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:08:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:08:06,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-10-26 11:08:07,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-26 11:08:07,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:08:07,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:08:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1320610048, now seen corresponding path program 1 times [2024-10-26 11:08:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:08:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252168847] [2024-10-26 11:08:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:08:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:08:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:08:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 35 proven. 186 refuted. 0 times theorem prover too weak. 797 trivial. 0 not checked. [2024-10-26 11:08:07,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:08:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252168847] [2024-10-26 11:08:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252168847] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:08:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139564690] [2024-10-26 11:08:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:08:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:08:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:08:07,667 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:08:07,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-26 11:08:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:08:08,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-26 11:08:08,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:08:08,722 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 11 treesize of output 7 [2024-10-26 11:08:08,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:08,767 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 16 treesize of output 11 [2024-10-26 11:08:08,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:08,795 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 16 treesize of output 11 [2024-10-26 11:08:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2024-10-26 11:08:08,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:08:08,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6790 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| v_ArrVal_6790) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|) 0))) is different from false [2024-10-26 11:08:08,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| Int) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6790 (Array Int Int))) (or (not (= 0 (select (select (store (store |c_#pthreadsMutex| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| v_ArrVal_6789) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| v_ArrVal_6790) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|))) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| |c_~#cache~0.base|))) is different from false [2024-10-26 11:08:08,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 11:08:08,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-26 11:08:08,883 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 65 treesize of output 57 [2024-10-26 11:08:08,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 38 [2024-10-26 11:08:08,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 [2024-10-26 11:08:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 977 trivial. 1 not checked. [2024-10-26 11:08:09,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139564690] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:08:09,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:08:09,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-26 11:08:09,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877710899] [2024-10-26 11:08:09,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:08:09,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-26 11:08:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:08:09,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-26 11:08:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=252, Unknown=3, NotChecked=70, Total=420 [2024-10-26 11:08:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:08:09,163 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:08:09,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.285714285714286) internal successors, (258), 20 states have internal predecessors, (258), 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-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:08:09,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:08:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:08:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:08:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:08:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:08:18,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-10-26 11:08:18,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:08:18,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:08:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:08:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1546152617, now seen corresponding path program 2 times [2024-10-26 11:08:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:08:18,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780384814] [2024-10-26 11:08:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:08:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:08:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:08:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 962 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:08:25,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:08:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780384814] [2024-10-26 11:08:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780384814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:08:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11688309] [2024-10-26 11:08:25,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:08:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:08:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:08:25,737 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:08:25,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-26 11:08:26,257 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:08:26,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:08:26,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 182 conjuncts are in the unsatisfiable core [2024-10-26 11:08:26,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:08:26,356 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:08:26,356 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-26 11:08:26,391 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 16 treesize of output 11 [2024-10-26 11:08:26,555 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 23 treesize of output 11 [2024-10-26 11:08:26,628 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 23 treesize of output 11 [2024-10-26 11:08:26,836 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 23 treesize of output 11 [2024-10-26 11:08:26,931 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 23 treesize of output 11 [2024-10-26 11:08:27,164 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 23 treesize of output 11 [2024-10-26 11:08:27,235 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 23 treesize of output 11 [2024-10-26 11:08:27,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:27,438 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 23 treesize of output 11 [2024-10-26 11:08:27,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:27,646 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 23 treesize of output 11 [2024-10-26 11:08:27,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:27,882 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 23 treesize of output 11 [2024-10-26 11:08:27,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:27,973 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 23 treesize of output 11 [2024-10-26 11:08:28,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:28,216 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 23 treesize of output 11 [2024-10-26 11:08:28,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:28,302 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 23 treesize of output 11 [2024-10-26 11:08:28,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:28,552 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 23 treesize of output 11 [2024-10-26 11:08:28,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:28,637 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 23 treesize of output 11 [2024-10-26 11:08:28,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:28,890 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 23 treesize of output 11 [2024-10-26 11:08:28,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:28,978 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 23 treesize of output 11 [2024-10-26 11:08:29,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:29,298 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 23 treesize of output 11 [2024-10-26 11:08:29,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:29,386 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 23 treesize of output 11 [2024-10-26 11:08:29,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 11:08:29,637 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 16 treesize of output 11 [2024-10-26 11:08:29,930 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 23 treesize of output 11 [2024-10-26 11:08:30,029 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 23 treesize of output 11 [2024-10-26 11:08:30,325 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 23 treesize of output 11 [2024-10-26 11:08:30,430 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 23 treesize of output 11 [2024-10-26 11:08:30,658 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 23 treesize of output 11 [2024-10-26 11:08:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 5 proven. 957 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:08:30,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:08:32,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (= (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:08:32,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (= (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:08:32,509 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 28 |c_~#cache~0.offset|)) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:32,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:08:32,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7254)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse1 |c_~#cache~0.offset|)) 0) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:32,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:08:32,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= 0 (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)))))) is different from false [2024-10-26 11:08:32,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7251)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:08:32,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|)))) is different from false [2024-10-26 11:08:32,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:08:32,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7246)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:08:33,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|)))) is different from false [2024-10-26 11:08:33,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:33,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7243)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:33,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:08:33,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|)))) is different from false [2024-10-26 11:08:33,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7239)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|)))) is different from false [2024-10-26 11:08:34,148 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|)))) is different from false [2024-10-26 11:08:34,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:34,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7234)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:42,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:44,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7231)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:47,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_7231) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:08:49,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:10:11,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7226 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_7226) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:10:11,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7226 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (or (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7226) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|))) is different from false [2024-10-26 11:10:11,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7226 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7251 Int) (v_ArrVal_7223 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (or (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7223) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7226) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|))) is different from false [2024-10-26 11:10:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 58 trivial. 891 not checked. [2024-10-26 11:10:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11688309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:10:11,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:10:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 44] total 106 [2024-10-26 11:10:11,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147098205] [2024-10-26 11:10:11,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:10:11,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-10-26 11:10:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:10:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-10-26 11:10:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=5789, Unknown=134, NotChecked=4914, Total=11342 [2024-10-26 11:10:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:10:11,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:10:11,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 8.336448598130842) internal successors, (892), 106 states have internal predecessors, (892), 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-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:10:11,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:10:11,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:10:11,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:10:11,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:10:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:10:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:10:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 11:10:44,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-10-26 11:10:44,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-26 11:10:44,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:10:44,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:10:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1520225867, now seen corresponding path program 3 times [2024-10-26 11:10:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:10:44,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160039076] [2024-10-26 11:10:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:10:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:10:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:10:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 5 proven. 1337 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:10:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:10:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160039076] [2024-10-26 11:10:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160039076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:10:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190046228] [2024-10-26 11:10:59,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:10:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:10:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:10:59,813 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:10:59,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-26 11:14:10,311 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-26 11:14:10,311 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:14:10,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 267 conjuncts are in the unsatisfiable core [2024-10-26 11:14:10,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:14:10,533 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:14:10,534 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-26 11:14:10,591 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 30 treesize of output 21 [2024-10-26 11:14:10,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:10,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:11,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:11,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:11,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:11,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:11,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:11,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:11,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:11,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:11,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:12,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:12,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:12,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:12,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:12,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:13,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:13,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:13,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:13,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:13,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:13,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:13,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:13,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:14:13,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:14:13,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:14:14,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:14:14,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:14:14,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:14,781 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-26 11:14:14,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2024-10-26 11:14:15,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:15,030 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-26 11:14:15,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2024-10-26 11:14:15,400 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 31 treesize of output 22 [2024-10-26 11:14:15,462 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 31 treesize of output 22 [2024-10-26 11:14:15,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:15,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:16,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:16,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:17,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:17,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:17,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:17,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:18,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:18,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:18,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:18,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:14:18,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:14:19,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-10-26 11:14:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:14:19,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:16:12,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7880 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_7885 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_7883 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51|) (= (select (select (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_7880) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_7883) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_7885) (+ 84 .cse0 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2024-10-26 11:17:23,094 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7880 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_7885 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_7877 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_7883 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_53|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49|) (= (select (select (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_7877) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_7880) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_7883) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_7885) (+ 112 .cse0 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51|)))) is different from false [2024-10-26 11:18:12,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7880 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_7885 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_7877 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_7883 Int) (v_ArrVal_7873 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_53|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49|) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7873)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_7877) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_7880) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_7883) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_7885) (+ 140 .cse0 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)))) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false Killed by 15