./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.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_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 11:00:15,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 11:00:15,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-10-26 11:00:15,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 11:00:15,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 11:00:15,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 11:00:15,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 11:00:15,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 11:00:15,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 11:00:15,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 11:00:15,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 11:00:15,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 11:00:15,798 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 11:00:15,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 11:00:15,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 11:00:15,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 11:00:15,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 11:00:15,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 11:00:15,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 11:00:15,802 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 11:00:15,802 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 11:00:15,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 11:00:15,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 11:00:15,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 11:00:15,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 11:00:15,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 11:00:15,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 11:00:15,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 11:00:15,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 11:00:15,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 11:00:15,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 11:00:15,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 11:00:15,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 11:00:15,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 11:00:15,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 11:00:15,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 11:00:15,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 11:00:15,810 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 11:00:15,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 11:00:15,812 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 11:00:15,812 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 11:00:15,812 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2024-10-26 11:00:16,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 11:00:16,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 11:00:16,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 11:00:16,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 11:00:16,089 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 11:00:16,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-26 11:00:17,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 11:00:17,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 11:00:17,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-26 11:00:17,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/14d5bd183/886f55d620e2404b956716467c01ba70/FLAGaffe13af0 [2024-10-26 11:00:17,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/14d5bd183/886f55d620e2404b956716467c01ba70 [2024-10-26 11:00:17,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 11:00:17,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 11:00:17,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 11:00:17,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 11:00:17,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 11:00:17,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:00:17" (1/1) ... [2024-10-26 11:00:17,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272a7f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:17, skipping insertion in model container [2024-10-26 11:00:17,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:00:17" (1/1) ... [2024-10-26 11:00:17,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 11:00:18,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 11:00:18,304 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 11:00:18,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 11:00:18,408 INFO L204 MainTranslator]: Completed translation [2024-10-26 11:00:18,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18 WrapperNode [2024-10-26 11:00:18,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 11:00:18,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 11:00:18,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 11:00:18,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 11:00:18,417 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:00:18" (1/1) ... [2024-10-26 11:00:18,436 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:00:18" (1/1) ... [2024-10-26 11:00:18,483 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 344 [2024-10-26 11:00:18,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 11:00:18,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 11:00:18,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 11:00:18,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 11:00:18,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 11:00:18,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 11:00:18,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 11:00:18,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 11:00:18,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (1/1) ... [2024-10-26 11:00:18,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 11:00:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:18,575 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:00:18,579 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:00:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 11:00:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 11:00:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 11:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 11:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 11:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 11:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 11:00:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 11:00:18,637 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 11:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 11:00:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 11:00:18,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 11:00:18,639 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:00:18,805 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 11:00:18,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 11:00:19,353 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 11:00:19,354 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 11:00:19,798 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 11:00:19,799 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-26 11:00:19,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:00:19 BoogieIcfgContainer [2024-10-26 11:00:19,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 11:00:19,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 11:00:19,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 11:00:19,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 11:00:19,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:00:17" (1/3) ... [2024-10-26 11:00:19,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8e9283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:00:19, skipping insertion in model container [2024-10-26 11:00:19,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:00:18" (2/3) ... [2024-10-26 11:00:19,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8e9283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:00:19, skipping insertion in model container [2024-10-26 11:00:19,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:00:19" (3/3) ... [2024-10-26 11:00:19,809 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-26 11:00:19,836 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 11:00:19,864 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-10-26 11:00:19,864 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 11:00:19,943 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 11:00:19,989 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:00:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:00:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:19,992 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:00:19,993 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:00:20,033 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:00:20,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 11:00:20,050 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;@658b7cb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:00:20,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-26 11:00:20,346 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:00:20,352 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:00:20,396 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:00:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1315694629, now seen corresponding path program 1 times [2024-10-26 11:00:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228013696] [2024-10-26 11:00:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:20,696 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:00:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228013696] [2024-10-26 11:00:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228013696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:00:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:00:20,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:00:20,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272355233] [2024-10-26 11:00:20,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:00:20,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:00:20,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:00:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:00:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:20,735 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:20,736 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:00:20,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:20,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 11:00:20,810 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:00:20,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash -991465734, now seen corresponding path program 1 times [2024-10-26 11:00:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824359568] [2024-10-26 11:00:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:20,945 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:00:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824359568] [2024-10-26 11:00:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824359568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996137066] [2024-10-26 11:00:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:20,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:20,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:20,969 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:00:20,971 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:00:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:21,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:00:21,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:21,126 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:00:21,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:21,151 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:00:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996137066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:21,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:21,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:00:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14724958] [2024-10-26 11:00:21,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:21,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:00:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:00:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:00:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:21,158 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:21,159 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:00:21,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:21,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:21,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-26 11:00:21,444 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:00:21,445 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:00:21,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2087779590, now seen corresponding path program 2 times [2024-10-26 11:00:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117720] [2024-10-26 11:00:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:21,644 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:00:21,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117720] [2024-10-26 11:00:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576488931] [2024-10-26 11:00:21,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:00:21,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:21,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:21,652 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:00:21,657 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:00:21,757 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 11:00:21,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:00:21,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:00:21,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:21,825 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 11:00:21,826 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:00:21,885 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:00:21,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:00:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576488931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:00:21,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:00:21,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 11:00:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472037650] [2024-10-26 11:00:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:00:21,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 11:00:21,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 11:00:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-26 11:00:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:21,892 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:21,892 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:00:21,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:21,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:21,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:21,988 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:00:21,991 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:00:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:22,039 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:00:22,223 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:00:22,223 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:00:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2087779589, now seen corresponding path program 1 times [2024-10-26 11:00:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942219790] [2024-10-26 11:00:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:22,336 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:00:22,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942219790] [2024-10-26 11:00:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942219790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376996399] [2024-10-26 11:00:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:22,339 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:00:22,340 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:00:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:22,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:00:22,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:22,462 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:00:22,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:22,524 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:00:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376996399] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:22,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:00:22,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609006514] [2024-10-26 11:00:22,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:22,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:00:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:22,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:00:22,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:00:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:22,529 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:22,529 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:00:22,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:22,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:22,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:22,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:22,633 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:00:22,823 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:00:22,824 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:00:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 846693115, now seen corresponding path program 2 times [2024-10-26 11:00:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61733894] [2024-10-26 11:00:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:23,188 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:00:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61733894] [2024-10-26 11:00:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61733894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:00:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:00:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:00:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961025115] [2024-10-26 11:00:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:00:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:00:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:23,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:00:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:00:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:23,194 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:23,195 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:00:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:23,334 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:00:23,337 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:00:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 11:00:23,554 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:00:23,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash 729661752, now seen corresponding path program 1 times [2024-10-26 11:00:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:23,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71379392] [2024-10-26 11:00:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:24,101 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:00:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71379392] [2024-10-26 11:00:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71379392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581621448] [2024-10-26 11:00:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:24,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:24,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:24,104 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:00:24,105 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:00:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:24,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:00:24,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:24,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:24,342 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:00:24,688 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:00:24,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:25,097 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:00:25,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581621448] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:25,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-10-26 11:00:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790172423] [2024-10-26 11:00:25,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:25,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:00:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:00:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-26 11:00:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:25,101 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:25,102 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:00:25,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:25,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:25,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:25,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:25,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:25,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:00:25,678 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:00:25,862 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:00:25,863 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:00:25,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1550413329, now seen corresponding path program 2 times [2024-10-26 11:00:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468254462] [2024-10-26 11:00:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:26,830 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:00:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468254462] [2024-10-26 11:00:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468254462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244818910] [2024-10-26 11:00:26,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:00:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:26,833 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:00:26,835 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:00:27,056 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:00:27,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:00:27,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 11:00:27,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:27,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:27,192 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:00:28,035 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:00:28,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:28,789 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:00:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244818910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:28,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:28,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2024-10-26 11:00:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079877982] [2024-10-26 11:00:28,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:28,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-26 11:00:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-26 11:00:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-10-26 11:00:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:28,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:28,795 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:00:28,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:00:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:00:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:00:30,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-26 11:00:30,407 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:00:30,408 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:00:30,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 304453213, now seen corresponding path program 3 times [2024-10-26 11:00:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294430166] [2024-10-26 11:00:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:30,963 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:00:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294430166] [2024-10-26 11:00:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294430166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506284011] [2024-10-26 11:00:30,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:00:30,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:30,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:30,966 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:00:30,968 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:00:31,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 11:00:31,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:00:31,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:00:31,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:31,304 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:00:32,453 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:00:32,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:33,518 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:00:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506284011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:33,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 25 [2024-10-26 11:00:33,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788786694] [2024-10-26 11:00:33,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:33,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-26 11:00:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-26 11:00:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-26 11:00:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:33,524 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:33,525 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:00:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:00:33,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:00:33,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:35,846 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:00:36,029 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:00:36,029 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:00:36,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1569241873, now seen corresponding path program 1 times [2024-10-26 11:00:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719949702] [2024-10-26 11:00:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:36,221 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:00:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:36,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719949702] [2024-10-26 11:00:36,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719949702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:00:36,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:00:36,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 11:00:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786469744] [2024-10-26 11:00:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:00:36,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:00:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:00:36,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:00:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:36,224 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:36,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:36,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:36,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 11:00:36,359 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:00:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2014029993, now seen corresponding path program 1 times [2024-10-26 11:00:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159635210] [2024-10-26 11:00:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:36,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:36,593 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:00:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159635210] [2024-10-26 11:00:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159635210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:36,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347329708] [2024-10-26 11:00:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:36,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:36,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:36,596 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:00:36,597 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:00:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:37,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 11:00:37,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:37,033 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:00:37,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:00:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347329708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:00:37,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:00:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-26 11:00:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273240279] [2024-10-26 11:00:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:00:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:00:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:00:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 11:00:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:37,038 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:37,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:37,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:37,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-26 11:00:37,994 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:00:37,994 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:00:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1496244295, now seen corresponding path program 1 times [2024-10-26 11:00:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068394381] [2024-10-26 11:00:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:43,923 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:00:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068394381] [2024-10-26 11:00:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068394381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86315829] [2024-10-26 11:00:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:43,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:43,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:43,927 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:00:43,931 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:00:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:44,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-26 11:00:44,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:44,373 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:00:44,373 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:00:44,409 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:00:44,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:44,579 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:00:44,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:44,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:00:44,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:44,855 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:00:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:44,933 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:00:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:45,150 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:00:45,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:45,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:00:45,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:45,431 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:00:45,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:45,504 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:00:45,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:45,769 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:00:45,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:45,851 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:00:46,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,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:00:46,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,087 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:00:46,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,253 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:00:46,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,311 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:00:46,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,495 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:00:46,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,553 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:00:46,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,729 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:00:46,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:00:46,785 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:00:46,926 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:00:46,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:48,578 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1722) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:00:48,681 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:00:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86315829] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:48,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:48,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2024-10-26 11:00:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835486305] [2024-10-26 11:00:48,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:48,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 11:00:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 11:00:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4513, Unknown=1, NotChecked=136, Total=4970 [2024-10-26 11:00:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:48,689 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:48,690 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:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:48,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:48,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:49,047 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:00:49,049 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:00:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:00:54,786 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:00:54,971 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:00:54,971 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:00:54,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash -976341842, now seen corresponding path program 1 times [2024-10-26 11:00:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591921717] [2024-10-26 11:00:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:55,206 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:00:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:00:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591921717] [2024-10-26 11:00:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591921717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:00:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130953471] [2024-10-26 11:00:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:00:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:00:55,209 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:00:55,210 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:00:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:00:55,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:00:55,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:00:55,717 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:00:55,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:00:55,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:00:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130953471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:00:55,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:00:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-26 11:00:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637794124] [2024-10-26 11:00:55,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:00:55,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:00:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:00:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:00:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:00:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:55,915 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:00:55,916 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:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:00:55,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:00:56,333 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:00:56,334 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:00:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:00:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:00:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:00:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:00:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:00:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:00:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:00:56,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-26 11:00:56,673 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:00:56,674 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:00:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:00:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1165855414, now seen corresponding path program 2 times [2024-10-26 11:00:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:00:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285155288] [2024-10-26 11:00:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:00:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:00:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:00,482 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:01:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285155288] [2024-10-26 11:01:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285155288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297628984] [2024-10-26 11:01:00,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:01:00,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:00,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:00,484 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:01:00,485 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:01:00,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:01:00,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:00,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-10-26 11:01:00,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:00,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:00,872 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:01:00,904 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:01:01,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,047 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:01:01,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,106 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:01:01,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,273 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:01:01,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,329 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:01:01,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,488 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:01:01,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,541 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:01:01,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,699 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:01:01,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,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:01:01,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:01,955 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:01:02,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,030 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:01:02,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,195 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:01:02,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,248 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:01:02,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,408 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:01:02,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,465 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:01:02,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,644 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:01:02,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:02,717 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:01:02,847 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:01:02,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:04,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2427 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#cache~0.base|) (+ 224 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:01:04,183 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:01:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297628984] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:04,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2024-10-26 11:01:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057583695] [2024-10-26 11:01:04,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:04,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-26 11:01:04,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-26 11:01:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3745, Unknown=1, NotChecked=124, Total=4160 [2024-10-26 11:01:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:04,187 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:04,188 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:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:04,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:06,702 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:01:06,888 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:01:06,888 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:01:06,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1055859533, now seen corresponding path program 3 times [2024-10-26 11:01:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415778689] [2024-10-26 11:01:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:09,307 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:01:09,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415778689] [2024-10-26 11:01:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415778689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831719854] [2024-10-26 11:01:09,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:01:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:09,309 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:01:09,310 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:01:12,767 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-26 11:01:12,767 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:12,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-10-26 11:01:12,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:12,852 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:12,852 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:01:12,881 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:01:13,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,021 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:01:13,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,077 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:01:13,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,226 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:01:13,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,282 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:01:13,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,440 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:01:13,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,492 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:01:13,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,648 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:01:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,700 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:01:13,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,859 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:01:13,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:13,946 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:01:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:14,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:01:14,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:14,153 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:01:14,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:14,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:01:14,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:14,371 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:01:14,492 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:01:14,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:15,655 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:01:15,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831719854] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:15,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 58 [2024-10-26 11:01:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233755204] [2024-10-26 11:01:15,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:15,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-26 11:01:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-26 11:01:15,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3130, Unknown=30, NotChecked=0, Total=3422 [2024-10-26 11:01:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:15,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:15,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 9.23728813559322) internal successors, (545), 58 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:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:15,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:01:18,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-26 11:01:18,213 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:01:18,213 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:01:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1427117488, now seen corresponding path program 4 times [2024-10-26 11:01:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978702624] [2024-10-26 11:01:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:19,980 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:01:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978702624] [2024-10-26 11:01:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978702624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460533265] [2024-10-26 11:01:19,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 11:01:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:19,984 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:01:19,985 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:01:23,555 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 11:01:23,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:23,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-26 11:01:23,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:23,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:23,643 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:01:23,680 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:01:23,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:23,825 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:01:23,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:23,881 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:01:24,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,037 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:01:24,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,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 11 [2024-10-26 11:01:24,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,245 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:01:24,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,332 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:01:24,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,479 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:01:24,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,538 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:01:24,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,689 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:01:24,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,739 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:01:24,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,891 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:01:24,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:24,949 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:01:25,075 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:01:25,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:25,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3017 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3017) |c_~#cache~0.base|) (+ 168 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:01:25,907 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:01:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460533265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:25,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:25,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2024-10-26 11:01:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842480888] [2024-10-26 11:01:25,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:25,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-26 11:01:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-26 11:01:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2425, Unknown=1, NotChecked=100, Total=2756 [2024-10-26 11:01:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:25,910 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:25,911 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:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:01:25,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:01:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 11:01:28,195 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:01:28,379 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:01:28,379 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:01:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1006646701, now seen corresponding path program 5 times [2024-10-26 11:01:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613482403] [2024-10-26 11:01:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613482403] [2024-10-26 11:01:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613482403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591054621] [2024-10-26 11:01:29,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 11:01:29,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:29,670 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:01:29,670 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:01:36,594 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-26 11:01:36,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:36,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-26 11:01:36,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:36,699 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:36,699 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:01:36,729 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:01:36,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:36,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:36,888 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:01:36,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:36,954 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:01:37,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,133 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:01:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,199 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:01:37,403 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:01:37,493 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:01:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,664 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:01:37,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,716 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:01:37,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,871 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:01:37,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:37,935 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:01:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:38,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:38,627 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3258 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3258) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:01:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591054621] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:38,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 17] total 49 [2024-10-26 11:01:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497178723] [2024-10-26 11:01:38,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-26 11:01:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-26 11:01:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2123, Unknown=1, NotChecked=94, Total=2450 [2024-10-26 11:01:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:38,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:38,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.02) internal successors, (401), 49 states have internal predecessors, (401), 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:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:38,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 11:01:38,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:38,872 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:01:38,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-26 11:01:40,034 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:01:40,037 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:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:01:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 11:01:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:01:41,027 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:01:41,208 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:01:41,209 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:01:41,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1352254294, now seen corresponding path program 6 times [2024-10-26 11:01:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:41,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549601211] [2024-10-26 11:01:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:42,360 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:01:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549601211] [2024-10-26 11:01:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549601211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364250879] [2024-10-26 11:01:42,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 11:01:42,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:42,362 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:01:42,362 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:01:43,383 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-26 11:01:43,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:43,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-26 11:01:43,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:43,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:43,446 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:01:43,473 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:01:43,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:43,608 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:01:43,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:43,662 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:01:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:43,806 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:01:43,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:43,861 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:01:44,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:44,054 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:01:44,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:44,107 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:01:44,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:44,255 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:01:44,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:44,309 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:01:44,419 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:01:44,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:44,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3463 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3463) |c_~#cache~0.base|) (+ 112 |c_~#cache~0.offset|)))) is different from false [2024-10-26 11:01:45,063 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:01:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364250879] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:45,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 42 [2024-10-26 11:01:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281653632] [2024-10-26 11:01:45,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-26 11:01:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-26 11:01:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1532, Unknown=1, NotChecked=80, Total=1806 [2024-10-26 11:01:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:45,066 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:45,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.627906976744186) internal successors, (328), 42 states have internal predecessors, (328), 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:01:45,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:45,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:45,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:45,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:01:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:01:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:47,172 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:01:47,357 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:01:47,358 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:01:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash 406377817, now seen corresponding path program 7 times [2024-10-26 11:01:47,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:47,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717291144] [2024-10-26 11:01:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:48,245 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:01:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717291144] [2024-10-26 11:01:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717291144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608218714] [2024-10-26 11:01:48,245 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-26 11:01:48,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:48,247 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:01:48,247 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:01:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:48,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-26 11:01:48,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:48,562 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:48,562 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:01:48,585 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:01:48,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:48,722 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:01:48,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:48,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:01:48,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:48,913 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:01:48,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:48,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:01:49,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:49,134 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:01:49,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:49,185 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:01:49,288 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:01:49,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:49,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3632) |c_~#cache~0.base|) (+ 84 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:01:49,785 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:01:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608218714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:49,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2024-10-26 11:01:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942404377] [2024-10-26 11:01:49,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:49,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-26 11:01:49,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-26 11:01:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1102, Unknown=1, NotChecked=68, Total=1332 [2024-10-26 11:01:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:49,788 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:49,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.918918918918919) internal successors, (256), 36 states have internal predecessors, (256), 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:01:49,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:49,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:49,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:49,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:01:49,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:01:49,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:49,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:01:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 11:01:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 11:01:53,138 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:01:53,325 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:01:53,325 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:01:53,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2071086175, now seen corresponding path program 8 times [2024-10-26 11:01:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:53,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556024407] [2024-10-26 11:01:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:53,611 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:01:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556024407] [2024-10-26 11:01:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556024407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179575853] [2024-10-26 11:01:53,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:01:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:53,612 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:01:53,614 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:01:53,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:01:53,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:53,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-26 11:01:53,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:53,932 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:53,932 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:01:53,964 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:01:54,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:54,127 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:01:54,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:54,205 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:01:54,306 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:01:54,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:54,483 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:01:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179575853] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:54,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-26 11:01:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178366041] [2024-10-26 11:01:54,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:54,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 11:01:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 11:01:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=416, Unknown=8, NotChecked=0, Total=506 [2024-10-26 11:01:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:54,486 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:54,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 22 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:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:54,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:01:54,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 11:01:54,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 11:01:54,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:55,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-26 11:01:56,112 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:01:56,112 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:01:56,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1425890974, now seen corresponding path program 1 times [2024-10-26 11:01:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:56,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056024884] [2024-10-26 11:01:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:56,254 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:01:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056024884] [2024-10-26 11:01:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056024884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:56,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:01:56,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-26 11:01:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257940355] [2024-10-26 11:01:56,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:56,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-26 11:01:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-26 11:01:56,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-26 11:01:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:56,256 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:56,256 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:01:56,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:56,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:56,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:01:56,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 11:01:56,604 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:01:56,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1714331010, now seen corresponding path program 1 times [2024-10-26 11:01:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:56,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447465415] [2024-10-26 11:01:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:56,790 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:01:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447465415] [2024-10-26 11:01:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447465415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615905183] [2024-10-26 11:01:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:56,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:56,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:56,792 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:01:56,793 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:01:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:57,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-26 11:01:57,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:57,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:57,139 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:01:57,163 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:01:57,259 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:01:57,281 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:01:57,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:57,405 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:01:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615905183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:57,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-26 11:01:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272996782] [2024-10-26 11:01:57,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-26 11:01:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-26 11:01:57,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=265, Unknown=19, NotChecked=0, Total=342 [2024-10-26 11:01:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:57,407 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:57,407 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:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:57,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:01:57,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:01:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 11:01:58,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2024-10-26 11:01:58,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2024-10-26 11:01:58,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2024-10-26 11:01:58,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-26 11:01:58,220 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:01:58,243 INFO L407 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-26 11:01:58,246 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:01:58,250 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:01:58,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:01:58,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:58,252 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:01:58,253 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:01:58,255 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:01:58,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 11:01:58,256 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;@658b7cb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:01:58,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-26 11:01:58,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:01:58,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1996337312, now seen corresponding path program 1 times [2024-10-26 11:01:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639337101] [2024-10-26 11:01:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:58,346 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:01:58,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639337101] [2024-10-26 11:01:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639337101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:58,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:01:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:01:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973373595] [2024-10-26 11:01:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:58,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:01:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:01:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:01:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:58,348 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:58,348 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:01:58,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:58,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 11:01:58,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:01:58,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1439833248, now seen corresponding path program 1 times [2024-10-26 11:01:58,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:58,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872769293] [2024-10-26 11:01:58,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:58,400 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:01:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872769293] [2024-10-26 11:01:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872769293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957183599] [2024-10-26 11:01:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:58,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:58,403 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:01:58,405 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:01:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:58,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:01:58,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:58,619 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:01:58,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:58,626 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:01:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957183599] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:58,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:01:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121871621] [2024-10-26 11:01:58,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:58,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:01:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:01:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:01:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:58,628 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:58,628 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:01:58,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:58,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:58,659 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:01:58,846 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:01:58,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:01:58,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1095192416, now seen corresponding path program 2 times [2024-10-26 11:01:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644973818] [2024-10-26 11:01:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:58,886 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:01:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644973818] [2024-10-26 11:01:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644973818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129418019] [2024-10-26 11:01:58,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:01:58,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:58,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:58,887 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:01:58,888 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:01:59,094 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:01:59,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:59,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:01:59,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:59,104 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:01:59,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:59,142 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:01:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129418019] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:59,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:01:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068302572] [2024-10-26 11:01:59,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:59,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:01:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:59,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:01:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:01:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:59,144 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:59,144 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:01:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:59,192 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:01:59,375 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:01:59,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:01:59,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash -436129632, now seen corresponding path program 3 times [2024-10-26 11:01:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:59,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109458956] [2024-10-26 11:01:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:59,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 11:01:59,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 11:01:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 11:01:59,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 11:01:59,433 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 11:01:59,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2024-10-26 11:01:59,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2024-10-26 11:01:59,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2024-10-26 11:01:59,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2024-10-26 11:01:59,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (22 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 28 remaining) [2024-10-26 11:01:59,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (7 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2024-10-26 11:01:59,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2024-10-26 11:01:59,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2024-10-26 11:01:59,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 28 remaining) [2024-10-26 11:01:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 11:01:59,443 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-26 11:01:59,443 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:01:59,449 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 11:01:59,449 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 11:01:59,484 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 11:01:59,486 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:01:59,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:01:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:59,490 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:01:59,492 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:01:59,494 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:01:59,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-26 11:01:59,496 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;@658b7cb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:01:59,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-26 11:01:59,580 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:01:59,582 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:01:59,596 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:01:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1741089592, now seen corresponding path program 1 times [2024-10-26 11:01:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464683858] [2024-10-26 11:01:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:59,626 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:01:59,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464683858] [2024-10-26 11:01:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464683858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:59,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:01:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:01:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068528736] [2024-10-26 11:01:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:01:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:01:59,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:01:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:59,627 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:59,628 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:01:59,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 11:01:59,665 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:01:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1277244425, now seen corresponding path program 1 times [2024-10-26 11:01:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138942357] [2024-10-26 11:01:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:59,695 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:01:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138942357] [2024-10-26 11:01:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138942357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544813262] [2024-10-26 11:01:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:59,698 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:01:59,701 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:01:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:59,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:01:59,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:59,941 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:01:59,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:59,949 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:01:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544813262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:59,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:01:59,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323320172] [2024-10-26 11:01:59,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:01:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:01:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:01:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:59,950 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:59,951 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:01:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:00,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:00,190 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:02:00,190 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:02:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -265361284, now seen corresponding path program 2 times [2024-10-26 11:02:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958440498] [2024-10-26 11:02:00,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:00,252 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:02:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958440498] [2024-10-26 11:02:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958440498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910839747] [2024-10-26 11:02:00,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:02:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:00,253 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:02:00,254 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:02:00,470 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 11:02:00,470 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:00,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:02:00,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:00,499 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 11:02:00,499 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:02:00,528 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:02:00,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:02:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910839747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:00,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:02:00,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 11:02:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290461465] [2024-10-26 11:02:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 11:02:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 11:02:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-26 11:02:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:00,529 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:00,529 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:02:00,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:00,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:00,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:00,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:02:00,575 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:02:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:00,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:00,791 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:02:00,791 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:02:00,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -265361283, now seen corresponding path program 1 times [2024-10-26 11:02:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000779253] [2024-10-26 11:02:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:00,839 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:02:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000779253] [2024-10-26 11:02:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000779253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455967350] [2024-10-26 11:02:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:00,841 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:02:00,843 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:02:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:01,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:02:01,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:01,085 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:02:01,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:01,121 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:02:01,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455967350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:01,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:02:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156644466] [2024-10-26 11:02:01,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:01,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:02:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:02:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:02:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:01,122 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:01,122 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:02:01,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:01,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:01,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:01,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:01,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:01,368 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:02:01,368 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:02:01,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 155035293, now seen corresponding path program 2 times [2024-10-26 11:02:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999620667] [2024-10-26 11:02:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:01,499 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:02:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999620667] [2024-10-26 11:02:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999620667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:01,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:01,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:02:01,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228481548] [2024-10-26 11:02:01,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:01,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:02:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:02:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:02:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:01,500 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:01,500 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:02:01,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:01,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:01,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:01,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:01,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:01,584 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:02:01,585 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:02:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:01,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-26 11:02:01,704 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:02:01,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2118056358, now seen corresponding path program 1 times [2024-10-26 11:02:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:01,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063182335] [2024-10-26 11:02:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:01,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:02:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063182335] [2024-10-26 11:02:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063182335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443771934] [2024-10-26 11:02:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:01,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:01,927 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:02:01,927 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:02:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:02,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:02:02,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:02,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:02,232 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:02:02,420 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:02:02,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:02,675 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:02:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443771934] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:02,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:02,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-10-26 11:02:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496142220] [2024-10-26 11:02:02,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:02:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:02:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-26 11:02:02,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:02,677 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:02,677 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:02:02,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:02,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:02,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:02,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:02,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:02,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:03,136 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:02:03,324 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:02:03,324 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:02:03,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -255444079, now seen corresponding path program 2 times [2024-10-26 11:02:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:03,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620778364] [2024-10-26 11:02:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:03,884 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:02:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:03,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620778364] [2024-10-26 11:02:03,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620778364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:03,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790411079] [2024-10-26 11:02:03,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:02:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:03,886 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:02:03,889 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:02:04,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:02:04,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:04,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 11:02:04,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,276 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:02:04,843 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:02:04,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:05,356 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:02:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790411079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:05,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2024-10-26 11:02:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692368585] [2024-10-26 11:02:05,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-26 11:02:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-26 11:02:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-10-26 11:02:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:05,359 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:05,359 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:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:05,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:02:06,480 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:02:06,667 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:02:06,667 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:02:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 171739391, now seen corresponding path program 3 times [2024-10-26 11:02:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815332029] [2024-10-26 11:02:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:07,016 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:02:07,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815332029] [2024-10-26 11:02:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815332029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156555402] [2024-10-26 11:02:07,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:02:07,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:07,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:07,017 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:02:07,018 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:02:07,343 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 11:02:07,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:07,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:02:07,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:07,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:07,411 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:02:08,293 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:02:08,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:09,125 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:02:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156555402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:09,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 25 [2024-10-26 11:02:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663096338] [2024-10-26 11:02:09,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:09,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-26 11:02:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-26 11:02:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-26 11:02:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:09,128 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:09,128 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:02:09,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:09,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:09,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:09,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:09,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:09,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:09,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:02:09,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:09,975 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:02:09,976 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:02:09,980 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:02:09,981 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:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:11,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-10-26 11:02:12,000 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:02:12,000 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:02:12,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash -428085701, now seen corresponding path program 1 times [2024-10-26 11:02:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:12,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189770966] [2024-10-26 11:02:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:12,125 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:02:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189770966] [2024-10-26 11:02:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189770966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 11:02:12,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881414708] [2024-10-26 11:02:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:02:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:12,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:02:12,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:02:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:12,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:12,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:12,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-26 11:02:12,322 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:02:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1046375051, now seen corresponding path program 1 times [2024-10-26 11:02:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611882030] [2024-10-26 11:02:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:12,482 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:02:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611882030] [2024-10-26 11:02:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611882030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979904009] [2024-10-26 11:02:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:12,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:12,484 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:02:12,485 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:02:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:12,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 11:02:12,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:12,915 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:02:12,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:02:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979904009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:12,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:02:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-26 11:02:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476519056] [2024-10-26 11:02:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:12,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:02:12,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:12,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:02:12,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 11:02:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:12,917 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:12,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:12,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:13,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:13,980 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:02:13,981 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:02:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1456067977, now seen corresponding path program 1 times [2024-10-26 11:02:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110809337] [2024-10-26 11:02:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:17,614 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:02:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110809337] [2024-10-26 11:02:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110809337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365986755] [2024-10-26 11:02:17,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:17,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:17,616 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:02:17,617 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:02:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:18,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-26 11:02:18,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:18,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:18,186 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:02:18,233 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:02:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:18,435 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:02:18,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:18,492 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:02:18,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:18,644 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:02:18,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:18,699 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:02:18,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:18,851 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:02:18,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:18,905 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:02:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,063 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:02:19,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,119 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:02:19,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,276 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:02:19,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,332 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:02:19,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,489 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:02:19,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,545 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:02:19,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,714 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:02:19,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:19,780 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:02:20,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:20,005 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:02:20,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:20,066 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:02:20,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:20,232 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:02:20,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:20,284 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:02:20,414 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:02:20,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:21,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5631) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:02:21,989 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:02:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365986755] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:21,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2024-10-26 11:02:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952041161] [2024-10-26 11:02:21,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:21,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 11:02:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 11:02:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4513, Unknown=1, NotChecked=136, Total=4970 [2024-10-26 11:02:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:21,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:21,994 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:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:21,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:22,265 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:02:22,267 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:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:02:29,580 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:02:29,765 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:02:29,766 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:02:29,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1727671837, now seen corresponding path program 1 times [2024-10-26 11:02:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330560114] [2024-10-26 11:02:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:30,111 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:02:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330560114] [2024-10-26 11:02:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330560114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:02:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403790609] [2024-10-26 11:02:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:30,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 11:02:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 11:02:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-26 11:02:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:30,113 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:30,114 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:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:30,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:02:30,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:02:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:02:39,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-26 11:02:39,071 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:02:39,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1067478515, now seen corresponding path program 1 times [2024-10-26 11:02:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922108535] [2024-10-26 11:02:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:43,812 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:02:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922108535] [2024-10-26 11:02:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922108535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781549724] [2024-10-26 11:02:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:43,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:43,814 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:02:43,815 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:02:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:44,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-10-26 11:02:44,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:44,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:44,441 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:02:44,475 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:02:44,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:44,633 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:02:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:44,702 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:02:44,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:44,894 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:02:44,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:44,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:02:45,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,206 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:02:45,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,275 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:02:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,468 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:02:45,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,536 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:02:45,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,736 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:02:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,800 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:02:45,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:45,995 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:02:46,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,064 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:02:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,268 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:02:46,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,330 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:02:46,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:46,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,652 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:02:46,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,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:02:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:46,976 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:02:47,227 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:02:47,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 11:02:47,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:47,475 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:02:47,559 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:02:47,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:47,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (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_6256))) (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:02:47,858 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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|))) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|))) is different from false [2024-10-26 11:02:49,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (= (select (store (select (store (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_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|))) is different from false [2024-10-26 11:02:49,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (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_6253 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_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:49,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (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_6253 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_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:49,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6253 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_6249)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |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_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:02:49,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6253 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_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:49,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6253 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|) (= (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_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:02:49,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6245 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6253 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_6245)))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse1 |c_~#cache~0.offset|)) 0) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .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|)))) is different from false [2024-10-26 11:02:50,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6245 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_6253 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 (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_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:02:50,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6245 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_6253 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|) (< |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 (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:50,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6245 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6242 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_6253 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|) (< |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 (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_6242)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:50,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6245 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6242 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_6253 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 (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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) (< (+ .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|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:02:50,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6249 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_6245 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6242 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_6253 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 (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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|) (< (+ 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:02:50,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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 ((.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_6238)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse1 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 84 .cse1 |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|) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:02:51,046 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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 (< (+ 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|) (= (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_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:51,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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) (< (+ .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|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:02:51,232 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (= (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_6234)))) (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_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:02:51,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:51,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:51,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (< (+ 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|) (= (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_6230)))) (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_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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)))) is different from false [2024-10-26 11:02:52,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (< (+ 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 (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|)))) is different from false [2024-10-26 11:02:52,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (= 0 (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_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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|))) (< (+ 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:02:52,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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 ((.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_6225)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse1 224 |c_~#cache~0.offset|)) 0) (< (+ 196 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ .cse1 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse1 |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 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:02:53,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (< (+ .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|) (= (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_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:53,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (= (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_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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) (< (+ 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:02:53,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6222 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (= (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_6222)))) (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_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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 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:02:54,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6222 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (= (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_6222) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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) (< (+ 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:02:54,401 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6222 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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|) (= (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_6222) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< (+ 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:02:54,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6222 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (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)) (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|) (= (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_6222) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< (+ 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:02:54,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6238 Int) (v_ArrVal_6249 Int) (v_ArrVal_6225 Int) (v_ArrVal_6234 Int) (v_ArrVal_6245 Int) (v_ArrVal_6222 Int) (v_ArrVal_6242 Int) (v_ArrVal_6253 Int) (v_ArrVal_6230 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6256 (Array Int Int)) (v_ArrVal_6218 (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)) (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 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6218) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6222) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6225) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6230) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6238) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6242) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6245) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6249) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6253)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6256) |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:02:55,291 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:02:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781549724] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:55,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 39] total 93 [2024-10-26 11:02:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511403386] [2024-10-26 11:02:55,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:55,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-10-26 11:02:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-10-26 11:02:55,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3668, Unknown=37, NotChecked=4712, Total=8742 [2024-10-26 11:02:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:55,296 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:55,297 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:02:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:02:55,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:03:11,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-10-26 11:03:12,158 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,SelfDestructingSolverStorable37 [2024-10-26 11:03:12,158 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:03:12,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:03:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1304353203, now seen corresponding path program 1 times [2024-10-26 11:03:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:03:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859784910] [2024-10-26 11:03:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:03:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:12,848 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:03:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:03:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859784910] [2024-10-26 11:03:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859784910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:03:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770724568] [2024-10-26 11:03:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:12,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:03:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:03:12,850 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:03:12,850 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:03:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:13,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:03:13,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:03:13,860 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:03:13,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:13,901 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:03:13,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:13,928 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:03:13,945 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:03:13,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:03:13,972 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| Int) (v_ArrVal_6688 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| v_ArrVal_6688) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|) 0)) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| |c_~#cache~0.base|))) is different from false [2024-10-26 11:03:14,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 11:03:14,018 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:03:14,025 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 131 treesize of output 119 [2024-10-26 11:03:14,030 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 40 [2024-10-26 11:03:14,031 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 40 treesize of output 36 [2024-10-26 11:03:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 977 trivial. 1 not checked. [2024-10-26 11:03:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770724568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:03:14,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:03:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-26 11:03:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129833498] [2024-10-26 11:03:14,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:03:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:03:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:03:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:03:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=257, Unknown=6, NotChecked=34, Total=380 [2024-10-26 11:03:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:14,322 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:03:14,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.75) internal successors, (235), 19 states have internal predecessors, (235), 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:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:14,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:14,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:03:14,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:03:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:22,702 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:03:22,887 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,SelfDestructingSolverStorable38 [2024-10-26 11:03:22,888 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:03:22,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:03:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1042190457, now seen corresponding path program 2 times [2024-10-26 11:03:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:03:22,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351012896] [2024-10-26 11:03:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:03:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:29,433 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:03:29,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:03:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351012896] [2024-10-26 11:03:29,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351012896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:03:29,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198393285] [2024-10-26 11:03:29,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:03:29,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:03:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:03:29,435 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:03:29,436 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:03:29,944 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:03:29,944 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:03:29,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-10-26 11:03:29,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:03:30,039 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:03:30,039 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:03:30,074 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:03:30,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,245 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:03:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,312 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:03:30,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,505 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:03:30,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,573 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:03:30,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,770 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:03:30,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,841 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:03:31,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,041 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:03:31,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,111 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:03:31,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,457 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:03:31,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,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 23 treesize of output 11 [2024-10-26 11:03:31,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,777 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:03:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,861 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:03:32,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:32,110 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:03:32,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:32,191 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:03:32,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:32,435 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:03:32,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:32,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:03:32,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:32,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 23 treesize of output 11 [2024-10-26 11:03:32,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:32,847 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:03:33,054 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:03:33,095 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:03:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:33,380 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:03:33,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:33,481 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:03:33,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:33,779 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:03:33,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:33,885 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:03:34,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:34,111 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:03:34,201 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:03:34,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:03:36,373 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= (select (select (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |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:03:38,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= (select (select (let ((.cse0 (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_7165)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |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:03:40,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= (select (select (let ((.cse0 (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_7165)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 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:03:51,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (select (select (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 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_41|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:03:53,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse1 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (select (select (let ((.cse0 (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_7162)))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)))) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 56 .cse1 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:11,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 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:04:12,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) 0) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|))) is different from false [2024-10-26 11:04:14,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int)) (or (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (= (select (store (store (store (select (store (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_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|))) is different from false [2024-10-26 11:04:14,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= 0 (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_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 28 |c_~#cache~0.offset|)))))) is different from false [2024-10-26 11:04:14,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| 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|) (= 0 (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_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 56 .cse0 |c_~#cache~0.offset|))) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:14,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= (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_7152)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:14,929 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7157 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (= (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_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:14,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7157 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| 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 (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_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:15,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int 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 (< (+ .cse0 28 |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_7149)))) (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_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:15,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int 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 (< (+ .cse0 28 |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 (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|)))) is different from false [2024-10-26 11:04:15,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int 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 (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 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 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:15,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (Array Int 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 (< (+ 56 .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_7144)))) (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_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:16,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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 |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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (= (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_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2024-10-26 11:04:16,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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 (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_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:16,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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_7141)))) (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_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:16,904 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (= (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_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:16,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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 (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|)))) is different from false [2024-10-26 11:04:17,198 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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 (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_7136)))) (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_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|)))) is different from false [2024-10-26 11:04:17,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 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:04:17,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (= (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_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:18,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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)) (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|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 168 |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_7133)))) (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_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:18,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_145| 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|) (= (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|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 168 |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_145|)))) is different from false [2024-10-26 11:04:19,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_145| 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|) (< (+ 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (= (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|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|)))) is different from false [2024-10-26 11:04:19,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_145| 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|) (= (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_7128)))) (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_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< (+ 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|)))) is different from false [2024-10-26 11:04:20,182 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_147| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| 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 (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| v_ArrVal_7128) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 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|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|)))) is different from false [2024-10-26 11:04:20,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_7149 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7141 Int) (v_ArrVal_7152 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_147| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| 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 (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|) (< (+ 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 112 .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 (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| v_ArrVal_7128) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:20,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (v_ArrVal_7149 Int) (v_ArrVal_7124 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (v_ArrVal_7141 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7152 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| 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_147|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|) (< (+ 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 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|) (= (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_7124)))) (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_147| v_ArrVal_7128) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:21,713 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (v_ArrVal_7149 Int) (v_ArrVal_7124 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (v_ArrVal_7141 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7152 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| 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_149|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|) (< (+ 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|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< (+ 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|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ .cse0 224 |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 (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149| v_ArrVal_7124) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| v_ArrVal_7128) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:21,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (v_ArrVal_7149 Int) (v_ArrVal_7124 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (v_ArrVal_7141 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7133 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7152 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ 56 |c_~#cache~0.offset|))) (or (< (+ 168 |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 (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149| v_ArrVal_7124) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| v_ArrVal_7128) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< .cse0 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147|) (< .cse1 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|) (< .cse0 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< .cse1 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:21,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_7128 Int) (v_ArrVal_7149 Int) (v_ArrVal_7124 Int) (v_ArrVal_7144 Int) (v_ArrVal_7165 Int) (v_ArrVal_7141 Int) (v_ArrVal_7162 Int) (v_ArrVal_7159 (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_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_7136 Int) (v_ArrVal_7157 Int) (v_ArrVal_7121 (Array Int Int)) (v_ArrVal_7133 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7152 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ 56 |c_~#cache~0.offset|))) (or (< (+ 168 |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 (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7121) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149| v_ArrVal_7124) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147| v_ArrVal_7128) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145| v_ArrVal_7133) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7136) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7141) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7144) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7149) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7152) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7157)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7159) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43| v_ArrVal_7162) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41| v_ArrVal_7165) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1_30| 1)) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 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|) (< .cse0 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_147|) (< .cse1 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_145|) (< .cse0 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_41|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_149|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_43|) (< .cse1 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_39|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 58 trivial. 959 not checked. [2024-10-26 11:04:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198393285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:04:23,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:04:23,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 45] total 107 [2024-10-26 11:04:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553998740] [2024-10-26 11:04:23,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:04:23,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2024-10-26 11:04:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:04:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2024-10-26 11:04:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=4892, Unknown=47, NotChecked=6160, Total=11556 [2024-10-26 11:04:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:04:23,103 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:04:23,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 8.25) internal successors, (891), 107 states have internal predecessors, (891), 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:04:23,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:23,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:23,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:23,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:04:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 11:04:51,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-10-26 11:04:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-26 11:04:51,280 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:04:51,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:04:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 161306235, now seen corresponding path program 3 times [2024-10-26 11:04:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:04:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900373076] [2024-10-26 11:04:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:04:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:04:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:02,857 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:05:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900373076] [2024-10-26 11:05:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900373076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688474463] [2024-10-26 11:05:02,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:05:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:02,858 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:05:02,859 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:10:02,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-26 11:10:02,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:10:02,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 299 conjuncts are in the unsatisfiable core [2024-10-26 11:10:02,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:10:03,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:10:03,107 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:10:03,162 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 37 treesize of output 26 [2024-10-26 11:10:03,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:03,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:03,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:03,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:03,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:03,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:03,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:04,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:04,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:04,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:04,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:04,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:05,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:06,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:06,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:06,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:07,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:07,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:07,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:08,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:08,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:08,570 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 37 treesize of output 26 [2024-10-26 11:10:08,629 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 37 treesize of output 26 [2024-10-26 11:10:09,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:09,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:09,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:09,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:09,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:10,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:10,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:10,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:10,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:11,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:11,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:11,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:10:11,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-10-26 11:10:11,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:11,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:12,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-26 11:10:12,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-10-26 11:10:13,057 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 37 treesize of output 24 [2024-10-26 11:10:13,190 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:13,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... Killed by 15